/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/array-examples/standard_sentinel.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 06:50:20,792 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 06:50:20,873 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 06:50:20,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 06:50:20,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 06:50:20,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 06:50:20,905 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 06:50:20,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 06:50:20,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 06:50:20,906 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 06:50:20,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 06:50:20,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 06:50:20,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 06:50:20,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 06:50:20,908 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 06:50:20,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 06:50:20,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 06:50:20,909 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 06:50:20,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 06:50:20,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 06:50:20,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 06:50:20,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 06:50:20,910 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 06:50:20,911 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 06:50:20,911 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 06:50:20,911 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 06:50:20,911 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 06:50:20,911 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 06:50:20,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 06:50:20,912 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 06:50:20,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 06:50:20,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 06:50:20,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 06:50:20,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 06:50:20,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 06:50:20,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 06:50:20,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 06:50:20,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 06:50:20,914 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 06:50:20,914 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 06:50:20,914 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 06:50:20,914 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 06:50:20,915 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 06:50:20,915 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 06:50:20,915 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 06:50:20,915 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 06:50:20,915 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 06:50:21,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 06:50:21,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 06:50:21,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 06:50:21,148 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 06:50:21,148 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 06:50:21,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_sentinel.i.v+cfa-reducer.c [2023-12-16 06:50:22,222 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 06:50:22,369 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 06:50:22,369 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_sentinel.i.v+cfa-reducer.c [2023-12-16 06:50:22,374 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8279e75d4/2ebd5b3760bc482b8383775d2cbbaf1a/FLAG99d394d47 [2023-12-16 06:50:22,384 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8279e75d4/2ebd5b3760bc482b8383775d2cbbaf1a [2023-12-16 06:50:22,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 06:50:22,388 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 06:50:22,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 06:50:22,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 06:50:22,394 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 06:50:22,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:50:22" (1/1) ... [2023-12-16 06:50:22,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47fe590d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:22, skipping insertion in model container [2023-12-16 06:50:22,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:50:22" (1/1) ... [2023-12-16 06:50:22,417 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 06:50:22,584 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_sentinel.i.v+cfa-reducer.c[991,1004] [2023-12-16 06:50:22,590 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 06:50:22,600 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 06:50:22,620 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_sentinel.i.v+cfa-reducer.c[991,1004] [2023-12-16 06:50:22,623 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 06:50:22,644 INFO L206 MainTranslator]: Completed translation [2023-12-16 06:50:22,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:22 WrapperNode [2023-12-16 06:50:22,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 06:50:22,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 06:50:22,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 06:50:22,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 06:50:22,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:22" (1/1) ... [2023-12-16 06:50:22,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:22" (1/1) ... [2023-12-16 06:50:22,678 INFO L138 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2023-12-16 06:50:22,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 06:50:22,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 06:50:22,679 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 06:50:22,679 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 06:50:22,687 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:22" (1/1) ... [2023-12-16 06:50:22,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:22" (1/1) ... [2023-12-16 06:50:22,690 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:22" (1/1) ... [2023-12-16 06:50:22,704 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2023-12-16 06:50:22,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:22" (1/1) ... [2023-12-16 06:50:22,704 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:22" (1/1) ... [2023-12-16 06:50:22,709 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:22" (1/1) ... [2023-12-16 06:50:22,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:22" (1/1) ... [2023-12-16 06:50:22,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:22" (1/1) ... [2023-12-16 06:50:22,716 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:22" (1/1) ... [2023-12-16 06:50:22,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 06:50:22,719 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 06:50:22,719 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 06:50:22,719 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 06:50:22,720 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:22" (1/1) ... [2023-12-16 06:50:22,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 06:50:22,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 06:50:22,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 06:50:22,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 06:50:22,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 06:50:22,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 06:50:22,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 06:50:22,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 06:50:22,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 06:50:22,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 06:50:22,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 06:50:22,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 06:50:22,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 06:50:22,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 06:50:22,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 06:50:22,874 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 06:50:22,876 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 06:50:23,036 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 06:50:23,067 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 06:50:23,067 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 06:50:23,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:50:23 BoogieIcfgContainer [2023-12-16 06:50:23,068 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 06:50:23,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 06:50:23,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 06:50:23,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 06:50:23,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 06:50:22" (1/3) ... [2023-12-16 06:50:23,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3b7dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:50:23, skipping insertion in model container [2023-12-16 06:50:23,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:50:22" (2/3) ... [2023-12-16 06:50:23,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3b7dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:50:23, skipping insertion in model container [2023-12-16 06:50:23,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:50:23" (3/3) ... [2023-12-16 06:50:23,081 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_sentinel.i.v+cfa-reducer.c [2023-12-16 06:50:23,096 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 06:50:23,096 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 06:50:23,143 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 06:50:23,148 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3aaf0e93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 06:50:23,149 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 06:50:23,153 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:50:23,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 06:50:23,161 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:50:23,162 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:50:23,163 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:50:23,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:50:23,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1284800003, now seen corresponding path program 1 times [2023-12-16 06:50:23,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:50:23,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137509262] [2023-12-16 06:50:23,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:50:23,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:50:23,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:50:23,186 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:50:23,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 06:50:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:50:23,295 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 06:50:23,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:50:23,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:50:23,325 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:50:23,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:50:23,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137509262] [2023-12-16 06:50:23,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137509262] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:50:23,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:50:23,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 06:50:23,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551487945] [2023-12-16 06:50:23,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:50:23,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 06:50:23,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:50:23,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 06:50:23,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:50:23,361 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:50:23,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:50:23,388 INFO L93 Difference]: Finished difference Result 23 states and 33 transitions. [2023-12-16 06:50:23,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 06:50:23,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-16 06:50:23,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:50:23,396 INFO L225 Difference]: With dead ends: 23 [2023-12-16 06:50:23,396 INFO L226 Difference]: Without dead ends: 11 [2023-12-16 06:50:23,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:50:23,405 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 06:50:23,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 06:50:23,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-16 06:50:23,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-16 06:50:23,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:50:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2023-12-16 06:50:23,431 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2023-12-16 06:50:23,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:50:23,432 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2023-12-16 06:50:23,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:50:23,432 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2023-12-16 06:50:23,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 06:50:23,433 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:50:23,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:50:23,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-16 06:50:23,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:50:23,637 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:50:23,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:50:23,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1330956527, now seen corresponding path program 1 times [2023-12-16 06:50:23,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:50:23,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273539493] [2023-12-16 06:50:23,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:50:23,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:50:23,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:50:23,640 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:50:23,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 06:50:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:50:23,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 06:50:23,684 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:50:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:50:23,712 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:50:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:50:23,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:50:23,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273539493] [2023-12-16 06:50:23,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273539493] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:50:23,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:50:23,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-16 06:50:23,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401424560] [2023-12-16 06:50:23,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:50:23,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 06:50:23,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:50:23,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 06:50:23,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 06:50:23,740 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:50:23,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:50:23,787 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2023-12-16 06:50:23,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 06:50:23,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-16 06:50:23,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:50:23,788 INFO L225 Difference]: With dead ends: 22 [2023-12-16 06:50:23,788 INFO L226 Difference]: Without dead ends: 14 [2023-12-16 06:50:23,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 06:50:23,791 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 06:50:23,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 06:50:23,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-16 06:50:23,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-12-16 06:50:23,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:50:23,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2023-12-16 06:50:23,802 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2023-12-16 06:50:23,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:50:23,803 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2023-12-16 06:50:23,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:50:23,803 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2023-12-16 06:50:23,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 06:50:23,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:50:23,804 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:50:23,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 06:50:24,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:50:24,007 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:50:24,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:50:24,007 INFO L85 PathProgramCache]: Analyzing trace with hash -533059843, now seen corresponding path program 2 times [2023-12-16 06:50:24,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:50:24,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834865862] [2023-12-16 06:50:24,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 06:50:24,008 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:50:24,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:50:24,010 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:50:24,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 06:50:24,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-16 06:50:24,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:50:24,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 06:50:24,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:50:24,145 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 06:50:24,145 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:50:24,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:50:24,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834865862] [2023-12-16 06:50:24,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834865862] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:50:24,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:50:24,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 06:50:24,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50086226] [2023-12-16 06:50:24,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:50:24,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 06:50:24,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:50:24,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 06:50:24,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 06:50:24,147 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:50:24,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:50:24,194 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2023-12-16 06:50:24,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 06:50:24,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-16 06:50:24,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:50:24,195 INFO L225 Difference]: With dead ends: 19 [2023-12-16 06:50:24,196 INFO L226 Difference]: Without dead ends: 16 [2023-12-16 06:50:24,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 06:50:24,199 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 06:50:24,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 13 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 06:50:24,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-16 06:50:24,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-12-16 06:50:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:50:24,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2023-12-16 06:50:24,207 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2023-12-16 06:50:24,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:50:24,207 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2023-12-16 06:50:24,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:50:24,208 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2023-12-16 06:50:24,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 06:50:24,208 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:50:24,208 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:50:24,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-16 06:50:24,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:50:24,411 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:50:24,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:50:24,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1171489088, now seen corresponding path program 1 times [2023-12-16 06:50:24,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:50:24,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497069383] [2023-12-16 06:50:24,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:50:24,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:50:24,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:50:24,413 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:50:24,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 06:50:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:50:24,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 06:50:24,468 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:50:24,518 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 06:50:24,518 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:50:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 06:50:24,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:50:24,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497069383] [2023-12-16 06:50:24,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497069383] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:50:24,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:50:24,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-16 06:50:24,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95096570] [2023-12-16 06:50:24,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:50:24,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 06:50:24,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:50:24,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 06:50:24,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-16 06:50:24,630 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:50:24,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:50:24,802 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2023-12-16 06:50:24,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 06:50:24,803 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-16 06:50:24,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:50:24,803 INFO L225 Difference]: With dead ends: 32 [2023-12-16 06:50:24,803 INFO L226 Difference]: Without dead ends: 22 [2023-12-16 06:50:24,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-12-16 06:50:24,805 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 06:50:24,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 06:50:24,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-16 06:50:24,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-16 06:50:24,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:50:24,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2023-12-16 06:50:24,809 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 15 [2023-12-16 06:50:24,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:50:24,810 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2023-12-16 06:50:24,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:50:24,810 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2023-12-16 06:50:24,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 06:50:24,810 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:50:24,811 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:50:24,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 06:50:25,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:50:25,012 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:50:25,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:50:25,012 INFO L85 PathProgramCache]: Analyzing trace with hash -795285952, now seen corresponding path program 2 times [2023-12-16 06:50:25,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:50:25,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [219692189] [2023-12-16 06:50:25,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 06:50:25,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:50:25,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:50:25,014 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:50:25,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 06:50:25,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 06:50:25,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:50:25,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 06:50:25,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:50:25,211 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 06:50:25,211 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:50:25,596 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 06:50:25,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:50:25,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [219692189] [2023-12-16 06:50:25,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [219692189] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:50:25,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:50:25,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-16 06:50:25,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56955284] [2023-12-16 06:50:25,597 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:50:25,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-16 06:50:25,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:50:25,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-16 06:50:25,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2023-12-16 06:50:25,599 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:50:26,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:50:26,495 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2023-12-16 06:50:26,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-16 06:50:26,497 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-16 06:50:26,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:50:26,497 INFO L225 Difference]: With dead ends: 44 [2023-12-16 06:50:26,497 INFO L226 Difference]: Without dead ends: 34 [2023-12-16 06:50:26,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2023-12-16 06:50:26,499 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 06:50:26,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 06:50:26,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-16 06:50:26,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-12-16 06:50:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:50:26,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2023-12-16 06:50:26,505 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 21 [2023-12-16 06:50:26,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:50:26,505 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2023-12-16 06:50:26,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:50:26,506 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2023-12-16 06:50:26,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-16 06:50:26,506 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:50:26,507 INFO L195 NwaCegarLoop]: trace histogram [22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:50:26,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 06:50:26,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:50:26,711 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:50:26,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:50:26,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1216795968, now seen corresponding path program 3 times [2023-12-16 06:50:26,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:50:26,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891527011] [2023-12-16 06:50:26,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 06:50:26,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:50:26,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:50:26,714 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:50:26,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 06:50:26,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-16 06:50:26,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:50:26,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 06:50:26,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:50:26,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-16 06:50:26,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 06:50:26,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2023-12-16 06:50:27,010 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2023-12-16 06:50:27,011 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:50:27,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-12-16 06:50:27,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-12-16 06:50:27,149 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2023-12-16 06:50:27,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:50:27,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891527011] [2023-12-16 06:50:27,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891527011] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:50:27,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:50:27,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-12-16 06:50:27,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630338242] [2023-12-16 06:50:27,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:50:27,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 06:50:27,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:50:27,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 06:50:27,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-12-16 06:50:27,151 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:50:27,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:50:27,379 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2023-12-16 06:50:27,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 06:50:27,380 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-12-16 06:50:27,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:50:27,381 INFO L225 Difference]: With dead ends: 42 [2023-12-16 06:50:27,381 INFO L226 Difference]: Without dead ends: 38 [2023-12-16 06:50:27,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2023-12-16 06:50:27,382 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 40 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 06:50:27,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 31 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 06:50:27,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-16 06:50:27,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-16 06:50:27,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:50:27,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2023-12-16 06:50:27,389 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 33 [2023-12-16 06:50:27,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:50:27,389 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2023-12-16 06:50:27,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:50:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2023-12-16 06:50:27,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-16 06:50:27,390 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:50:27,390 INFO L195 NwaCegarLoop]: trace histogram [22, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:50:27,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 06:50:27,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:50:27,591 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:50:27,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:50:27,591 INFO L85 PathProgramCache]: Analyzing trace with hash -622999930, now seen corresponding path program 4 times [2023-12-16 06:50:27,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:50:27,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720358871] [2023-12-16 06:50:27,592 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 06:50:27,592 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:50:27,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:50:27,593 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:50:27,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 06:50:27,692 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 06:50:27,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:50:27,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-16 06:50:27,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:50:27,968 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 06:50:27,968 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:50:29,375 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 06:50:29,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:50:29,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720358871] [2023-12-16 06:50:29,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [720358871] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:50:29,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:50:29,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2023-12-16 06:50:29,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264941892] [2023-12-16 06:50:29,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:50:29,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-16 06:50:29,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:50:29,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-16 06:50:29,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2023-12-16 06:50:29,379 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 48 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 47 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:50:35,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:50:35,033 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2023-12-16 06:50:35,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-16 06:50:35,034 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 47 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-12-16 06:50:35,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:50:35,035 INFO L225 Difference]: With dead ends: 76 [2023-12-16 06:50:35,035 INFO L226 Difference]: Without dead ends: 62 [2023-12-16 06:50:35,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2023-12-16 06:50:35,037 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 06:50:35,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 06:50:35,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-16 06:50:35,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-12-16 06:50:35,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:50:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2023-12-16 06:50:35,052 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 37 [2023-12-16 06:50:35,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:50:35,053 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2023-12-16 06:50:35,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 47 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:50:35,054 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2023-12-16 06:50:35,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-16 06:50:35,057 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:50:35,057 INFO L195 NwaCegarLoop]: trace histogram [46, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:50:35,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 06:50:35,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:50:35,261 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:50:35,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:50:35,262 INFO L85 PathProgramCache]: Analyzing trace with hash -2016467834, now seen corresponding path program 5 times [2023-12-16 06:50:35,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:50:35,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188381283] [2023-12-16 06:50:35,263 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 06:50:35,263 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:50:35,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:50:35,264 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:50:35,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 06:50:35,777 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2023-12-16 06:50:35,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:50:35,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 71 conjunts are in the unsatisfiable core [2023-12-16 06:50:35,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:50:36,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 06:50:36,727 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:50:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 06:50:42,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:50:42,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188381283] [2023-12-16 06:50:42,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1188381283] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:50:42,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:50:42,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 95 [2023-12-16 06:50:42,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456951662] [2023-12-16 06:50:42,772 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:50:42,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2023-12-16 06:50:42,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:50:42,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2023-12-16 06:50:42,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2398, Invalid=6722, Unknown=0, NotChecked=0, Total=9120 [2023-12-16 06:50:42,777 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 96 states, 96 states have (on average 1.0833333333333333) internal successors, (104), 95 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:51:28,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:51:28,501 INFO L93 Difference]: Finished difference Result 124 states and 173 transitions. [2023-12-16 06:51:28,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2023-12-16 06:51:28,504 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.0833333333333333) internal successors, (104), 95 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-12-16 06:51:28,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:51:28,506 INFO L225 Difference]: With dead ends: 124 [2023-12-16 06:51:28,506 INFO L226 Difference]: Without dead ends: 110 [2023-12-16 06:51:28,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 50.5s TimeCoverageRelationStatistics Valid=6909, Invalid=13397, Unknown=0, NotChecked=0, Total=20306 [2023-12-16 06:51:28,510 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 2353 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 2399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-16 06:51:28,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 338 Invalid, 2399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2353 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-16 06:51:28,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-16 06:51:28,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-12-16 06:51:28,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.018348623853211) internal successors, (111), 109 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:51:28,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2023-12-16 06:51:28,524 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 61 [2023-12-16 06:51:28,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:51:28,525 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2023-12-16 06:51:28,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 1.0833333333333333) internal successors, (104), 95 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:51:28,525 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2023-12-16 06:51:28,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-16 06:51:28,526 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:51:28,526 INFO L195 NwaCegarLoop]: trace histogram [94, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:51:28,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 06:51:28,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:51:28,727 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:51:28,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:51:28,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1685856122, now seen corresponding path program 6 times [2023-12-16 06:51:28,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:51:28,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034383007] [2023-12-16 06:51:28,728 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-16 06:51:28,728 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:51:28,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:51:28,731 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:51:28,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 06:51:28,934 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-12-16 06:51:28,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:51:28,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-16 06:51:28,945 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:51:29,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-16 06:51:29,286 INFO L349 Elim1Store]: treesize reduction 8, result has 74.2 percent of original size [2023-12-16 06:51:29,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 37 [2023-12-16 06:51:29,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4477 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2023-12-16 06:51:29,419 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:51:29,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2023-12-16 06:51:29,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 06:51:29,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 46 [2023-12-16 06:51:29,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4477 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2023-12-16 06:51:29,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:51:29,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034383007] [2023-12-16 06:51:29,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034383007] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:51:29,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:51:29,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2023-12-16 06:51:29,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767098131] [2023-12-16 06:51:29,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:51:29,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-16 06:51:29,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:51:29,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-16 06:51:29,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2023-12-16 06:51:29,947 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:51:30,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:51:30,897 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2023-12-16 06:51:30,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-16 06:51:30,898 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2023-12-16 06:51:30,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:51:30,899 INFO L225 Difference]: With dead ends: 124 [2023-12-16 06:51:30,899 INFO L226 Difference]: Without dead ends: 118 [2023-12-16 06:51:30,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=266, Invalid=856, Unknown=0, NotChecked=0, Total=1122 [2023-12-16 06:51:30,900 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 37 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 06:51:30,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 48 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 06:51:30,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-16 06:51:30,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-12-16 06:51:30,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.017094017094017) internal successors, (119), 117 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:51:30,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2023-12-16 06:51:30,914 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 109 [2023-12-16 06:51:30,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:51:30,914 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2023-12-16 06:51:30,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:51:30,914 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2023-12-16 06:51:30,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 06:51:30,916 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:51:30,916 INFO L195 NwaCegarLoop]: trace histogram [94, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1] Received shutdown request... [2023-12-16 06:51:30,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 06:51:31,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:51:31,120 WARN L619 AbstractCegarLoop]: Verification canceled: while executing NwaCegarLoop. [2023-12-16 06:51:31,120 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 06:51:31,121 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 06:51:31,124 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1] [2023-12-16 06:51:31,126 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 06:51:31,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 06:51:31 BoogieIcfgContainer [2023-12-16 06:51:31,128 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 06:51:31,128 INFO L158 Benchmark]: Toolchain (without parser) took 68740.47ms. Allocated memory is still 266.3MB. Free memory was 216.0MB in the beginning and 198.2MB in the end (delta: 17.7MB). Peak memory consumption was 19.3MB. Max. memory is 8.0GB. [2023-12-16 06:51:31,128 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 194.0MB. Free memory was 143.8MB in the beginning and 143.7MB in the end (delta: 129.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 06:51:31,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.68ms. Allocated memory is still 266.3MB. Free memory was 215.7MB in the beginning and 204.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 06:51:31,129 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.95ms. Allocated memory is still 266.3MB. Free memory was 204.1MB in the beginning and 202.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 06:51:31,129 INFO L158 Benchmark]: Boogie Preprocessor took 39.24ms. Allocated memory is still 266.3MB. Free memory was 202.5MB in the beginning and 200.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 06:51:31,129 INFO L158 Benchmark]: RCFGBuilder took 349.34ms. Allocated memory is still 266.3MB. Free memory was 200.7MB in the beginning and 188.4MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 06:51:31,129 INFO L158 Benchmark]: TraceAbstraction took 68057.81ms. Allocated memory is still 266.3MB. Free memory was 187.6MB in the beginning and 198.2MB in the end (delta: -10.6MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 06:51:31,130 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 194.0MB. Free memory was 143.8MB in the beginning and 143.7MB in the end (delta: 129.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 256.68ms. Allocated memory is still 266.3MB. Free memory was 215.7MB in the beginning and 204.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.95ms. Allocated memory is still 266.3MB. Free memory was 204.1MB in the beginning and 202.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.24ms. Allocated memory is still 266.3MB. Free memory was 202.5MB in the beginning and 200.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 349.34ms. Allocated memory is still 266.3MB. Free memory was 200.7MB in the beginning and 188.4MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 68057.81ms. Allocated memory is still 266.3MB. Free memory was 187.6MB in the beginning and 198.2MB in the end (delta: -10.6MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 43). Cancelled while executing NwaCegarLoop. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 68.0s, OverallIterations: 9, TraceHistogramMax: 94, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 53.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 85 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 85 mSDsluCounter, 810 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 738 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3431 IncrementalHoareTripleChecker+Invalid, 3487 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 72 mSDtfsCounter, 3431 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 681 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1632 ImplicationChecksByTransitivity, 60.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=9, InterpolantAutomatonStates: 228, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 308 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 578 ConstructedInterpolants, 0 QuantifiedInterpolants, 2205 SizeOfPredicates, 25 NumberOfNonLiveVariables, 854 ConjunctsInSsa, 158 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 9408/12330 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown