/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/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label05.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 23:37:25,835 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 23:37:25,895 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-21 23:37:25,899 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 23:37:25,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 23:37:25,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 23:37:25,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 23:37:25,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 23:37:25,927 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 23:37:25,930 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 23:37:25,930 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 23:37:25,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 23:37:25,931 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 23:37:25,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 23:37:25,932 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 23:37:25,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 23:37:25,933 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 23:37:25,933 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 23:37:25,933 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 23:37:25,933 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 23:37:25,933 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 23:37:25,934 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 23:37:25,934 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 23:37:25,934 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 23:37:25,934 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 23:37:25,934 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 23:37:25,934 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 23:37:25,935 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 23:37:25,935 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 23:37:25,935 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 23:37:25,936 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 23:37:25,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 23:37:25,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 23:37:25,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 23:37:25,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 23:37:25,936 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 23:37:25,936 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 23:37:25,937 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 23:37:25,937 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 23:37:25,937 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 23:37:25,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 23:37:25,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 23:37:25,937 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 23:37:25,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 23:37:25,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 23:37:25,938 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 23:37:25,938 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-21 23:37:26,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 23:37:26,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 23:37:26,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 23:37:26,168 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 23:37:26,171 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 23:37:26,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label05.c [2023-12-21 23:37:27,263 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 23:37:27,592 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 23:37:27,592 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label05.c [2023-12-21 23:37:27,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8738a572f/c8560d4777ef44559be10e1e42136fc2/FLAG4f919c66b [2023-12-21 23:37:27,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8738a572f/c8560d4777ef44559be10e1e42136fc2 [2023-12-21 23:37:27,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 23:37:27,633 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 23:37:27,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 23:37:27,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 23:37:27,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 23:37:27,638 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:37:27" (1/1) ... [2023-12-21 23:37:27,639 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fbcb0cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:27, skipping insertion in model container [2023-12-21 23:37:27,639 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 11:37:27" (1/1) ... [2023-12-21 23:37:27,728 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 23:37:27,981 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label05.c[6391,6404] [2023-12-21 23:37:28,051 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label05.c[13327,13340] [2023-12-21 23:37:28,684 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 23:37:28,694 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 23:37:28,723 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label05.c[6391,6404] [2023-12-21 23:37:28,731 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label05.c[13327,13340] [2023-12-21 23:37:29,058 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 23:37:29,077 INFO L206 MainTranslator]: Completed translation [2023-12-21 23:37:29,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:29 WrapperNode [2023-12-21 23:37:29,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 23:37:29,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 23:37:29,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 23:37:29,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 23:37:29,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:29" (1/1) ... [2023-12-21 23:37:29,128 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:29" (1/1) ... [2023-12-21 23:37:29,221 INFO L138 Inliner]: procedures = 34, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4962 [2023-12-21 23:37:29,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 23:37:29,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 23:37:29,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 23:37:29,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 23:37:29,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:29" (1/1) ... [2023-12-21 23:37:29,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:29" (1/1) ... [2023-12-21 23:37:29,254 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:29" (1/1) ... [2023-12-21 23:37:29,303 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-21 23:37:29,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:29" (1/1) ... [2023-12-21 23:37:29,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:29" (1/1) ... [2023-12-21 23:37:29,364 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:29" (1/1) ... [2023-12-21 23:37:29,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:29" (1/1) ... [2023-12-21 23:37:29,401 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:29" (1/1) ... [2023-12-21 23:37:29,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:29" (1/1) ... [2023-12-21 23:37:29,442 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 23:37:29,444 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 23:37:29,444 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 23:37:29,444 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 23:37:29,444 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:29" (1/1) ... [2023-12-21 23:37:29,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 23:37:29,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 23:37:29,481 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-21 23:37:29,529 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-21 23:37:29,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 23:37:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 23:37:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 23:37:29,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 23:37:29,627 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 23:37:29,628 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 23:37:55,535 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 23:37:55,579 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 23:37:55,579 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-21 23:37:55,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:37:55 BoogieIcfgContainer [2023-12-21 23:37:55,580 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 23:37:55,582 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 23:37:55,582 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 23:37:55,584 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 23:37:55,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 11:37:27" (1/3) ... [2023-12-21 23:37:55,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6000d69b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:37:55, skipping insertion in model container [2023-12-21 23:37:55,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 11:37:29" (2/3) ... [2023-12-21 23:37:55,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6000d69b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 11:37:55, skipping insertion in model container [2023-12-21 23:37:55,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 11:37:55" (3/3) ... [2023-12-21 23:37:55,586 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label05.c [2023-12-21 23:37:55,597 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 23:37:55,598 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-21 23:37:55,669 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 23:37:55,676 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;@16ec3c47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 23:37:55,676 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-21 23:37:55,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 807 states, 804 states have (on average 1.9800995024875623) internal successors, (1592), 806 states have internal predecessors, (1592), 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-21 23:37:55,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 23:37:55,691 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:55,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:37:55,692 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:55,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:55,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1100216757, now seen corresponding path program 1 times [2023-12-21 23:37:55,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:55,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [124124660] [2023-12-21 23:37:55,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:55,708 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-21 23:37:55,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:55,737 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-21 23:37:55,739 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-21 23:37:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:55,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 23:37:55,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:55,834 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-21 23:37:55,834 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:55,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:55,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [124124660] [2023-12-21 23:37:55,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [124124660] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:55,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:55,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 23:37:55,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613195305] [2023-12-21 23:37:55,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:55,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 23:37:55,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:55,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 23:37:55,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 23:37:55,860 INFO L87 Difference]: Start difference. First operand has 807 states, 804 states have (on average 1.9800995024875623) internal successors, (1592), 806 states have internal predecessors, (1592), 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 2 states, 2 states have (on average 8.5) internal successors, (17), 2 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-21 23:37:55,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:55,935 INFO L93 Difference]: Finished difference Result 1594 states and 3146 transitions. [2023-12-21 23:37:55,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 23:37:55,937 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 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) Word has length 17 [2023-12-21 23:37:55,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:55,951 INFO L225 Difference]: With dead ends: 1594 [2023-12-21 23:37:55,952 INFO L226 Difference]: Without dead ends: 803 [2023-12-21 23:37:55,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 23:37:55,960 INFO L413 NwaCegarLoop]: 1521 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:55,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1521 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:37:55,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2023-12-21 23:37:56,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2023-12-21 23:37:56,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 801 states have (on average 1.898876404494382) internal successors, (1521), 802 states have internal predecessors, (1521), 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-21 23:37:56,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1521 transitions. [2023-12-21 23:37:56,050 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1521 transitions. Word has length 17 [2023-12-21 23:37:56,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:56,050 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 1521 transitions. [2023-12-21 23:37:56,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 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-21 23:37:56,051 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1521 transitions. [2023-12-21 23:37:56,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 23:37:56,051 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:56,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:37:56,059 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 (2)] Forceful destruction successful, exit code 0 [2023-12-21 23:37:56,252 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-21 23:37:56,253 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:56,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:56,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1687022771, now seen corresponding path program 1 times [2023-12-21 23:37:56,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:56,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669557221] [2023-12-21 23:37:56,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:56,254 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-21 23:37:56,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:56,259 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-21 23:37:56,262 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-21 23:37:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:56,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 23:37:56,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:56,350 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-21 23:37:56,350 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:56,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:56,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669557221] [2023-12-21 23:37:56,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669557221] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:56,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:56,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 23:37:56,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197740210] [2023-12-21 23:37:56,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:56,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 23:37:56,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:56,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 23:37:56,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 23:37:56,353 INFO L87 Difference]: Start difference. First operand 803 states and 1521 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-21 23:37:56,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:56,415 INFO L93 Difference]: Finished difference Result 864 states and 1616 transitions. [2023-12-21 23:37:56,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 23:37:56,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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) Word has length 17 [2023-12-21 23:37:56,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:56,419 INFO L225 Difference]: With dead ends: 864 [2023-12-21 23:37:56,419 INFO L226 Difference]: Without dead ends: 832 [2023-12-21 23:37:56,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 23:37:56,420 INFO L413 NwaCegarLoop]: 1516 mSDtfsCounter, 45 mSDsluCounter, 3011 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4527 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:56,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4527 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:37:56,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2023-12-21 23:37:56,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 803. [2023-12-21 23:37:56,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 801 states have (on average 1.8789013732833957) internal successors, (1505), 802 states have internal predecessors, (1505), 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-21 23:37:56,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1505 transitions. [2023-12-21 23:37:56,442 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1505 transitions. Word has length 17 [2023-12-21 23:37:56,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:56,442 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 1505 transitions. [2023-12-21 23:37:56,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-21 23:37:56,443 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1505 transitions. [2023-12-21 23:37:56,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-21 23:37:56,444 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:56,444 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:37:56,449 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-21 23:37:56,647 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-21 23:37:56,647 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:56,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:56,648 INFO L85 PathProgramCache]: Analyzing trace with hash 613121839, now seen corresponding path program 1 times [2023-12-21 23:37:56,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:56,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292849226] [2023-12-21 23:37:56,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:56,649 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-21 23:37:56,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:56,650 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-21 23:37:56,652 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-21 23:37:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:56,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 23:37:56,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:56,889 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-21 23:37:56,889 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:56,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:56,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292849226] [2023-12-21 23:37:56,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292849226] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:56,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:56,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 23:37:56,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746065449] [2023-12-21 23:37:56,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:56,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 23:37:56,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:56,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 23:37:56,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 23:37:56,891 INFO L87 Difference]: Start difference. First operand 803 states and 1505 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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-21 23:37:56,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:56,991 INFO L93 Difference]: Finished difference Result 919 states and 1689 transitions. [2023-12-21 23:37:56,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 23:37:56,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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 32 [2023-12-21 23:37:56,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:56,995 INFO L225 Difference]: With dead ends: 919 [2023-12-21 23:37:56,995 INFO L226 Difference]: Without dead ends: 890 [2023-12-21 23:37:56,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 23:37:56,996 INFO L413 NwaCegarLoop]: 1499 mSDtfsCounter, 3033 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3033 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:56,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3033 Valid, 1656 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 23:37:56,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2023-12-21 23:37:57,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 857. [2023-12-21 23:37:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 855 states have (on average 1.8619883040935672) internal successors, (1592), 856 states have internal predecessors, (1592), 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-21 23:37:57,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1592 transitions. [2023-12-21 23:37:57,010 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1592 transitions. Word has length 32 [2023-12-21 23:37:57,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:57,010 INFO L495 AbstractCegarLoop]: Abstraction has 857 states and 1592 transitions. [2023-12-21 23:37:57,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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-21 23:37:57,010 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1592 transitions. [2023-12-21 23:37:57,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 23:37:57,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:57,011 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:37:57,014 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 (4)] Forceful destruction successful, exit code 0 [2023-12-21 23:37:57,214 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-21 23:37:57,214 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:57,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:57,215 INFO L85 PathProgramCache]: Analyzing trace with hash 675954815, now seen corresponding path program 1 times [2023-12-21 23:37:57,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:57,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459603761] [2023-12-21 23:37:57,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:57,216 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-21 23:37:57,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:57,217 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-21 23:37:57,227 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-21 23:37:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:57,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:37:57,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:57,317 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-21 23:37:57,318 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:57,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:57,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459603761] [2023-12-21 23:37:57,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459603761] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:57,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:57,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:37:57,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228521796] [2023-12-21 23:37:57,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:57,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:37:57,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:57,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:37:57,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:57,325 INFO L87 Difference]: Start difference. First operand 857 states and 1592 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-21 23:37:57,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:57,359 INFO L93 Difference]: Finished difference Result 1007 states and 1830 transitions. [2023-12-21 23:37:57,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:37:57,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2023-12-21 23:37:57,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:57,362 INFO L225 Difference]: With dead ends: 1007 [2023-12-21 23:37:57,362 INFO L226 Difference]: Without dead ends: 924 [2023-12-21 23:37:57,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-21 23:37:57,364 INFO L413 NwaCegarLoop]: 1501 mSDtfsCounter, 1464 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:57,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 1541 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:37:57,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2023-12-21 23:37:57,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 922. [2023-12-21 23:37:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 920 states have (on average 1.8380434782608697) internal successors, (1691), 921 states have internal predecessors, (1691), 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-21 23:37:57,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1691 transitions. [2023-12-21 23:37:57,379 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1691 transitions. Word has length 34 [2023-12-21 23:37:57,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:57,380 INFO L495 AbstractCegarLoop]: Abstraction has 922 states and 1691 transitions. [2023-12-21 23:37:57,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-21 23:37:57,380 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1691 transitions. [2023-12-21 23:37:57,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-21 23:37:57,384 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:57,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:37:57,406 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 (5)] Ended with exit code 0 [2023-12-21 23:37:57,587 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-21 23:37:57,587 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:57,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:57,588 INFO L85 PathProgramCache]: Analyzing trace with hash -582127364, now seen corresponding path program 1 times [2023-12-21 23:37:57,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:57,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033471371] [2023-12-21 23:37:57,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:57,588 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-21 23:37:57,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:57,605 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-21 23:37:57,629 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-21 23:37:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:57,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 23:37:57,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:57,738 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-21 23:37:57,738 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:57,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:57,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033471371] [2023-12-21 23:37:57,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033471371] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:57,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:57,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 23:37:57,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690057896] [2023-12-21 23:37:57,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:57,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 23:37:57,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:57,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 23:37:57,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 23:37:57,740 INFO L87 Difference]: Start difference. First operand 922 states and 1691 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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-21 23:37:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:57,783 INFO L93 Difference]: Finished difference Result 936 states and 1708 transitions. [2023-12-21 23:37:57,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 23:37:57,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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) Word has length 35 [2023-12-21 23:37:57,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:57,787 INFO L225 Difference]: With dead ends: 936 [2023-12-21 23:37:57,787 INFO L226 Difference]: Without dead ends: 934 [2023-12-21 23:37:57,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 23:37:57,788 INFO L413 NwaCegarLoop]: 1501 mSDtfsCounter, 1 mSDsluCounter, 2994 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4495 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:57,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4495 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:37:57,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2023-12-21 23:37:57,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 930. [2023-12-21 23:37:57,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 928 states have (on average 1.8297413793103448) internal successors, (1698), 929 states have internal predecessors, (1698), 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-21 23:37:57,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1698 transitions. [2023-12-21 23:37:57,802 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1698 transitions. Word has length 35 [2023-12-21 23:37:57,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:57,802 INFO L495 AbstractCegarLoop]: Abstraction has 930 states and 1698 transitions. [2023-12-21 23:37:57,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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-21 23:37:57,802 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1698 transitions. [2023-12-21 23:37:57,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-21 23:37:57,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:57,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:37:57,820 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 (6)] Ended with exit code 0 [2023-12-21 23:37:58,005 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-21 23:37:58,006 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:58,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:58,006 INFO L85 PathProgramCache]: Analyzing trace with hash 2127458807, now seen corresponding path program 1 times [2023-12-21 23:37:58,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:58,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110368025] [2023-12-21 23:37:58,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:58,007 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-21 23:37:58,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:58,008 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-21 23:37:58,028 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-21 23:37:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:58,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:37:58,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:58,102 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-21 23:37:58,102 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:58,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:58,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110368025] [2023-12-21 23:37:58,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110368025] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:58,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:58,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:37:58,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488816041] [2023-12-21 23:37:58,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:58,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:37:58,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:58,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:37:58,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:58,104 INFO L87 Difference]: Start difference. First operand 930 states and 1698 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-21 23:37:58,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:58,131 INFO L93 Difference]: Finished difference Result 1098 states and 1958 transitions. [2023-12-21 23:37:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:37:58,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2023-12-21 23:37:58,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:58,135 INFO L225 Difference]: With dead ends: 1098 [2023-12-21 23:37:58,135 INFO L226 Difference]: Without dead ends: 1009 [2023-12-21 23:37:58,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-21 23:37:58,135 INFO L413 NwaCegarLoop]: 1532 mSDtfsCounter, 1474 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:58,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1578 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:37:58,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2023-12-21 23:37:58,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1007. [2023-12-21 23:37:58,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1005 states have (on average 1.8049751243781094) internal successors, (1814), 1006 states have internal predecessors, (1814), 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-21 23:37:58,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1814 transitions. [2023-12-21 23:37:58,150 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1814 transitions. Word has length 36 [2023-12-21 23:37:58,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:58,151 INFO L495 AbstractCegarLoop]: Abstraction has 1007 states and 1814 transitions. [2023-12-21 23:37:58,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-21 23:37:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1814 transitions. [2023-12-21 23:37:58,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-21 23:37:58,151 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:58,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:37:58,168 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-21 23:37:58,371 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-21 23:37:58,371 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:58,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:58,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1501802743, now seen corresponding path program 1 times [2023-12-21 23:37:58,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:58,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029382198] [2023-12-21 23:37:58,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:58,372 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-21 23:37:58,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:58,375 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-21 23:37:58,376 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-21 23:37:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:58,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:37:58,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:58,470 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-21 23:37:58,471 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:58,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:58,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029382198] [2023-12-21 23:37:58,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029382198] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:58,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:58,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:37:58,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625617239] [2023-12-21 23:37:58,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:58,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:37:58,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:58,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:37:58,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:58,480 INFO L87 Difference]: Start difference. First operand 1007 states and 1814 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-21 23:37:58,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:58,528 INFO L93 Difference]: Finished difference Result 1433 states and 2457 transitions. [2023-12-21 23:37:58,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:37:58,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2023-12-21 23:37:58,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:58,543 INFO L225 Difference]: With dead ends: 1433 [2023-12-21 23:37:58,543 INFO L226 Difference]: Without dead ends: 1202 [2023-12-21 23:37:58,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-21 23:37:58,544 INFO L413 NwaCegarLoop]: 1534 mSDtfsCounter, 1472 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:58,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1584 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:37:58,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2023-12-21 23:37:58,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1200. [2023-12-21 23:37:58,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 1198 states have (on average 1.7479131886477461) internal successors, (2094), 1199 states have internal predecessors, (2094), 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-21 23:37:58,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 2094 transitions. [2023-12-21 23:37:58,576 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 2094 transitions. Word has length 36 [2023-12-21 23:37:58,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:58,576 INFO L495 AbstractCegarLoop]: Abstraction has 1200 states and 2094 transitions. [2023-12-21 23:37:58,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-21 23:37:58,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 2094 transitions. [2023-12-21 23:37:58,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-21 23:37:58,577 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:58,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:37:58,582 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-21 23:37:58,777 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-21 23:37:58,778 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:58,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:58,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1904431113, now seen corresponding path program 1 times [2023-12-21 23:37:58,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:58,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [302882529] [2023-12-21 23:37:58,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:58,779 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-21 23:37:58,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:58,780 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-21 23:37:58,782 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-21 23:37:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:58,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:37:58,825 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:58,845 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-21 23:37:58,845 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:37:58,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:37:58,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [302882529] [2023-12-21 23:37:58,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [302882529] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:37:58,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:37:58,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:37:58,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921073367] [2023-12-21 23:37:58,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:37:58,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:37:58,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:37:58,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:37:58,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:37:58,847 INFO L87 Difference]: Start difference. First operand 1200 states and 2094 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-21 23:37:58,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:37:58,888 INFO L93 Difference]: Finished difference Result 1976 states and 3234 transitions. [2023-12-21 23:37:58,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:37:58,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2023-12-21 23:37:58,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:37:58,893 INFO L225 Difference]: With dead ends: 1976 [2023-12-21 23:37:58,893 INFO L226 Difference]: Without dead ends: 1552 [2023-12-21 23:37:58,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-21 23:37:58,895 INFO L413 NwaCegarLoop]: 1532 mSDtfsCounter, 1470 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:37:58,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 1586 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:37:58,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2023-12-21 23:37:58,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1550. [2023-12-21 23:37:58,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1548 states have (on average 1.6679586563307494) internal successors, (2582), 1549 states have internal predecessors, (2582), 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-21 23:37:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2582 transitions. [2023-12-21 23:37:58,920 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2582 transitions. Word has length 36 [2023-12-21 23:37:58,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:37:58,920 INFO L495 AbstractCegarLoop]: Abstraction has 1550 states and 2582 transitions. [2023-12-21 23:37:58,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-21 23:37:58,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2582 transitions. [2023-12-21 23:37:58,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-21 23:37:58,921 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:37:58,921 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:37:58,935 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 (9)] Ended with exit code 0 [2023-12-21 23:37:59,123 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-21 23:37:59,124 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:37:59,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:37:59,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1853448570, now seen corresponding path program 1 times [2023-12-21 23:37:59,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:37:59,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754963743] [2023-12-21 23:37:59,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:37:59,125 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-21 23:37:59,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:37:59,130 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-21 23:37:59,132 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-21 23:37:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:37:59,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-21 23:37:59,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:37:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:37:59,729 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:00,043 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:00,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:00,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754963743] [2023-12-21 23:38:00,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754963743] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:00,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:00,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-21 23:38:00,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620819402] [2023-12-21 23:38:00,044 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:00,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 23:38:00,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:00,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 23:38:00,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-21 23:38:00,045 INFO L87 Difference]: Start difference. First operand 1550 states and 2582 transitions. Second operand has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 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-21 23:38:01,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:01,523 INFO L93 Difference]: Finished difference Result 3268 states and 5027 transitions. [2023-12-21 23:38:01,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 23:38:01,524 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 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 50 [2023-12-21 23:38:01,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:01,531 INFO L225 Difference]: With dead ends: 3268 [2023-12-21 23:38:01,531 INFO L226 Difference]: Without dead ends: 2714 [2023-12-21 23:38:01,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2023-12-21 23:38:01,533 INFO L413 NwaCegarLoop]: 1500 mSDtfsCounter, 3325 mSDsluCounter, 13527 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3325 SdHoareTripleChecker+Valid, 15027 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:01,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3325 Valid, 15027 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-21 23:38:01,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2714 states. [2023-12-21 23:38:01,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 2322. [2023-12-21 23:38:01,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2322 states, 2320 states have (on average 1.5905172413793103) internal successors, (3690), 2321 states have internal predecessors, (3690), 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-21 23:38:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 3690 transitions. [2023-12-21 23:38:01,581 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 3690 transitions. Word has length 50 [2023-12-21 23:38:01,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:01,581 INFO L495 AbstractCegarLoop]: Abstraction has 2322 states and 3690 transitions. [2023-12-21 23:38:01,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 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-21 23:38:01,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 3690 transitions. [2023-12-21 23:38:01,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-21 23:38:01,582 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:01,582 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:38:01,587 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-21 23:38:01,785 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-21 23:38:01,785 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:01,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:01,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1815862662, now seen corresponding path program 1 times [2023-12-21 23:38:01,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:01,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105555830] [2023-12-21 23:38:01,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:01,786 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-21 23:38:01,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:01,787 INFO L229 MonitoredProcess]: Starting monitored process 11 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-21 23:38:01,818 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 (11)] Waiting until timeout for monitored process [2023-12-21 23:38:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:01,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:38:01,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:01,868 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:01,868 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:38:01,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:01,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105555830] [2023-12-21 23:38:01,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105555830] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:38:01,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:38:01,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:38:01,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655169962] [2023-12-21 23:38:01,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:38:01,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:38:01,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:01,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:38:01,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:38:01,870 INFO L87 Difference]: Start difference. First operand 2322 states and 3690 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-21 23:38:01,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:01,909 INFO L93 Difference]: Finished difference Result 3444 states and 5327 transitions. [2023-12-21 23:38:01,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:38:01,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 50 [2023-12-21 23:38:01,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:01,915 INFO L225 Difference]: With dead ends: 3444 [2023-12-21 23:38:01,915 INFO L226 Difference]: Without dead ends: 1898 [2023-12-21 23:38:01,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-21 23:38:01,917 INFO L413 NwaCegarLoop]: 1526 mSDtfsCounter, 31 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3017 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:01,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3017 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:38:01,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2023-12-21 23:38:01,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1891. [2023-12-21 23:38:01,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1889 states have (on average 1.6236103758602436) internal successors, (3067), 1890 states have internal predecessors, (3067), 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-21 23:38:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 3067 transitions. [2023-12-21 23:38:01,950 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 3067 transitions. Word has length 50 [2023-12-21 23:38:01,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:01,950 INFO L495 AbstractCegarLoop]: Abstraction has 1891 states and 3067 transitions. [2023-12-21 23:38:01,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-21 23:38:01,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 3067 transitions. [2023-12-21 23:38:01,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-21 23:38:01,951 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:01,951 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:38:01,957 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 (11)] Forceful destruction successful, exit code 0 [2023-12-21 23:38:02,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-21 23:38:02,155 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:02,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:02,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1762784666, now seen corresponding path program 1 times [2023-12-21 23:38:02,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:02,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518039488] [2023-12-21 23:38:02,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:02,156 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-21 23:38:02,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:02,157 INFO L229 MonitoredProcess]: Starting monitored process 12 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-21 23:38:02,158 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 (12)] Waiting until timeout for monitored process [2023-12-21 23:38:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:02,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:38:02,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:02,275 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:02,275 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:38:02,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:02,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518039488] [2023-12-21 23:38:02,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518039488] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:38:02,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:38:02,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:38:02,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151851883] [2023-12-21 23:38:02,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:38:02,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:38:02,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:02,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:38:02,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:38:02,277 INFO L87 Difference]: Start difference. First operand 1891 states and 3067 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-21 23:38:02,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:02,308 INFO L93 Difference]: Finished difference Result 2447 states and 3867 transitions. [2023-12-21 23:38:02,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:38:02,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2023-12-21 23:38:02,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:02,313 INFO L225 Difference]: With dead ends: 2447 [2023-12-21 23:38:02,313 INFO L226 Difference]: Without dead ends: 1341 [2023-12-21 23:38:02,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-21 23:38:02,315 INFO L413 NwaCegarLoop]: 1519 mSDtfsCounter, 27 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3002 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:02,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3002 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:38:02,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2023-12-21 23:38:02,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1339. [2023-12-21 23:38:02,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 1337 states have (on average 1.68810770381451) internal successors, (2257), 1338 states have internal predecessors, (2257), 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-21 23:38:02,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2257 transitions. [2023-12-21 23:38:02,338 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2257 transitions. Word has length 52 [2023-12-21 23:38:02,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:02,339 INFO L495 AbstractCegarLoop]: Abstraction has 1339 states and 2257 transitions. [2023-12-21 23:38:02,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-21 23:38:02,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2257 transitions. [2023-12-21 23:38:02,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-21 23:38:02,340 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:02,340 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:38:02,357 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 (12)] Forceful destruction successful, exit code 0 [2023-12-21 23:38:02,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-21 23:38:02,543 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:02,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:02,543 INFO L85 PathProgramCache]: Analyzing trace with hash 857932558, now seen corresponding path program 1 times [2023-12-21 23:38:02,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:02,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780099510] [2023-12-21 23:38:02,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:02,544 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-21 23:38:02,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:02,545 INFO L229 MonitoredProcess]: Starting monitored process 13 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-21 23:38:02,562 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 (13)] Waiting until timeout for monitored process [2023-12-21 23:38:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:02,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-21 23:38:02,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:03,158 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:03,158 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:03,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:03,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:03,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780099510] [2023-12-21 23:38:03,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780099510] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:03,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:03,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-21 23:38:03,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602795991] [2023-12-21 23:38:03,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:03,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 23:38:03,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:03,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 23:38:03,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-21 23:38:03,378 INFO L87 Difference]: Start difference. First operand 1339 states and 2257 transitions. Second operand has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 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-21 23:38:03,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:03,992 INFO L93 Difference]: Finished difference Result 1933 states and 3088 transitions. [2023-12-21 23:38:03,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 23:38:03,992 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 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 53 [2023-12-21 23:38:03,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:03,996 INFO L225 Difference]: With dead ends: 1933 [2023-12-21 23:38:03,996 INFO L226 Difference]: Without dead ends: 1379 [2023-12-21 23:38:03,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2023-12-21 23:38:03,997 INFO L413 NwaCegarLoop]: 1474 mSDtfsCounter, 4481 mSDsluCounter, 11786 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4481 SdHoareTripleChecker+Valid, 13260 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:03,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4481 Valid, 13260 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 23:38:03,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2023-12-21 23:38:04,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1353. [2023-12-21 23:38:04,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1351 states have (on average 1.682457438934123) internal successors, (2273), 1352 states have internal predecessors, (2273), 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-21 23:38:04,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 2273 transitions. [2023-12-21 23:38:04,020 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 2273 transitions. Word has length 53 [2023-12-21 23:38:04,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:04,021 INFO L495 AbstractCegarLoop]: Abstraction has 1353 states and 2273 transitions. [2023-12-21 23:38:04,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.125) internal successors, (98), 16 states have internal predecessors, (98), 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-21 23:38:04,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 2273 transitions. [2023-12-21 23:38:04,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-21 23:38:04,021 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:04,021 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:38:04,024 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 (13)] Forceful destruction successful, exit code 0 [2023-12-21 23:38:04,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-21 23:38:04,224 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:04,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:04,225 INFO L85 PathProgramCache]: Analyzing trace with hash -443153606, now seen corresponding path program 1 times [2023-12-21 23:38:04,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:04,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122639566] [2023-12-21 23:38:04,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:04,225 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-21 23:38:04,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:04,226 INFO L229 MonitoredProcess]: Starting monitored process 14 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-21 23:38:04,255 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 (14)] Waiting until timeout for monitored process [2023-12-21 23:38:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:04,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:38:04,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:04,309 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:38:04,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:04,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122639566] [2023-12-21 23:38:04,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122639566] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:38:04,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:38:04,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:38:04,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806821602] [2023-12-21 23:38:04,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:38:04,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:38:04,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:04,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:38:04,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:38:04,311 INFO L87 Difference]: Start difference. First operand 1353 states and 2273 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-21 23:38:04,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:04,338 INFO L93 Difference]: Finished difference Result 1633 states and 2665 transitions. [2023-12-21 23:38:04,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:38:04,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 55 [2023-12-21 23:38:04,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:04,341 INFO L225 Difference]: With dead ends: 1633 [2023-12-21 23:38:04,341 INFO L226 Difference]: Without dead ends: 1079 [2023-12-21 23:38:04,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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-21 23:38:04,343 INFO L413 NwaCegarLoop]: 1512 mSDtfsCounter, 23 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2987 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:04,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2987 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:38:04,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2023-12-21 23:38:04,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1077. [2023-12-21 23:38:04,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1075 states have (on average 1.7404651162790699) internal successors, (1871), 1076 states have internal predecessors, (1871), 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-21 23:38:04,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1871 transitions. [2023-12-21 23:38:04,360 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1871 transitions. Word has length 55 [2023-12-21 23:38:04,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:04,360 INFO L495 AbstractCegarLoop]: Abstraction has 1077 states and 1871 transitions. [2023-12-21 23:38:04,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-21 23:38:04,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1871 transitions. [2023-12-21 23:38:04,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-21 23:38:04,360 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:04,360 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:38:04,366 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 (14)] Forceful destruction successful, exit code 0 [2023-12-21 23:38:04,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-21 23:38:04,564 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:04,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:04,564 INFO L85 PathProgramCache]: Analyzing trace with hash -294444102, now seen corresponding path program 1 times [2023-12-21 23:38:04,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:04,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1755100656] [2023-12-21 23:38:04,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:04,565 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-21 23:38:04,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:04,566 INFO L229 MonitoredProcess]: Starting monitored process 15 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-21 23:38:04,567 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 (15)] Waiting until timeout for monitored process [2023-12-21 23:38:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:04,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-21 23:38:04,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:05,205 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:05,206 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:05,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:05,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:05,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1755100656] [2023-12-21 23:38:05,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1755100656] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:05,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:05,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-21 23:38:05,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645928715] [2023-12-21 23:38:05,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:05,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 23:38:05,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:05,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 23:38:05,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-21 23:38:05,503 INFO L87 Difference]: Start difference. First operand 1077 states and 1871 transitions. Second operand has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 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-21 23:38:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:06,461 INFO L93 Difference]: Finished difference Result 1627 states and 2614 transitions. [2023-12-21 23:38:06,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-21 23:38:06,462 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 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 56 [2023-12-21 23:38:06,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:06,465 INFO L225 Difference]: With dead ends: 1627 [2023-12-21 23:38:06,465 INFO L226 Difference]: Without dead ends: 1349 [2023-12-21 23:38:06,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2023-12-21 23:38:06,466 INFO L413 NwaCegarLoop]: 1509 mSDtfsCounter, 6215 mSDsluCounter, 10471 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6215 SdHoareTripleChecker+Valid, 11980 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:06,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6215 Valid, 11980 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 23:38:06,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2023-12-21 23:38:06,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1285. [2023-12-21 23:38:06,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1283 states have (on average 1.6703039750584567) internal successors, (2143), 1284 states have internal predecessors, (2143), 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-21 23:38:06,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 2143 transitions. [2023-12-21 23:38:06,495 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 2143 transitions. Word has length 56 [2023-12-21 23:38:06,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:06,495 INFO L495 AbstractCegarLoop]: Abstraction has 1285 states and 2143 transitions. [2023-12-21 23:38:06,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 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-21 23:38:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 2143 transitions. [2023-12-21 23:38:06,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-21 23:38:06,495 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:06,495 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:38:06,513 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 (15)] Forceful destruction successful, exit code 0 [2023-12-21 23:38:06,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-21 23:38:06,713 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:06,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:06,714 INFO L85 PathProgramCache]: Analyzing trace with hash -402890190, now seen corresponding path program 1 times [2023-12-21 23:38:06,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:06,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870863406] [2023-12-21 23:38:06,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:06,714 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-21 23:38:06,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:06,715 INFO L229 MonitoredProcess]: Starting monitored process 16 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-21 23:38:06,745 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 (16)] Waiting until timeout for monitored process [2023-12-21 23:38:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:06,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 23:38:06,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:06,861 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 23:38:06,861 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:06,969 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 23:38:06,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:06,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870863406] [2023-12-21 23:38:06,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1870863406] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:06,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:06,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-21 23:38:06,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681924811] [2023-12-21 23:38:06,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:06,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 23:38:06,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:06,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 23:38:06,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 23:38:06,970 INFO L87 Difference]: Start difference. First operand 1285 states and 2143 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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-21 23:38:07,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:07,092 INFO L93 Difference]: Finished difference Result 2233 states and 3384 transitions. [2023-12-21 23:38:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 23:38:07,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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 58 [2023-12-21 23:38:07,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:07,097 INFO L225 Difference]: With dead ends: 2233 [2023-12-21 23:38:07,097 INFO L226 Difference]: Without dead ends: 1747 [2023-12-21 23:38:07,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 23:38:07,098 INFO L413 NwaCegarLoop]: 1510 mSDtfsCounter, 1486 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 3094 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:07,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 3094 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 23:38:07,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2023-12-21 23:38:07,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1691. [2023-12-21 23:38:07,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1689 states have (on average 1.5476613380698638) internal successors, (2614), 1690 states have internal predecessors, (2614), 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-21 23:38:07,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2614 transitions. [2023-12-21 23:38:07,128 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2614 transitions. Word has length 58 [2023-12-21 23:38:07,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:07,128 INFO L495 AbstractCegarLoop]: Abstraction has 1691 states and 2614 transitions. [2023-12-21 23:38:07,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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-21 23:38:07,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2614 transitions. [2023-12-21 23:38:07,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-21 23:38:07,129 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:07,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:38:07,132 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 (16)] Ended with exit code 0 [2023-12-21 23:38:07,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-21 23:38:07,332 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:07,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:07,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2034672704, now seen corresponding path program 1 times [2023-12-21 23:38:07,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:07,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217270172] [2023-12-21 23:38:07,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:07,333 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-21 23:38:07,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:07,334 INFO L229 MonitoredProcess]: Starting monitored process 17 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-21 23:38:07,335 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 (17)] Waiting until timeout for monitored process [2023-12-21 23:38:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:07,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:38:07,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:07,441 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-21 23:38:07,442 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:38:07,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:07,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217270172] [2023-12-21 23:38:07,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217270172] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:38:07,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:38:07,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 23:38:07,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577467259] [2023-12-21 23:38:07,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:38:07,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:38:07,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:07,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:38:07,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:38:07,443 INFO L87 Difference]: Start difference. First operand 1691 states and 2614 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 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-21 23:38:40,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:40,536 INFO L93 Difference]: Finished difference Result 3195 states and 5487 transitions. [2023-12-21 23:38:40,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:38:40,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 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 59 [2023-12-21 23:38:40,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:40,543 INFO L225 Difference]: With dead ends: 3195 [2023-12-21 23:38:40,543 INFO L226 Difference]: Without dead ends: 2442 [2023-12-21 23:38:40,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 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-21 23:38:40,544 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 786 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2467 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 2979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 2467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.9s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:40,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 287 Invalid, 2979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 2467 Invalid, 0 Unknown, 0 Unchecked, 32.9s Time] [2023-12-21 23:38:40,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2023-12-21 23:38:40,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2442. [2023-12-21 23:38:40,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 2440 states have (on average 1.5758196721311475) internal successors, (3845), 2441 states have internal predecessors, (3845), 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-21 23:38:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3845 transitions. [2023-12-21 23:38:40,632 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3845 transitions. Word has length 59 [2023-12-21 23:38:40,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:40,632 INFO L495 AbstractCegarLoop]: Abstraction has 2442 states and 3845 transitions. [2023-12-21 23:38:40,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 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-21 23:38:40,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3845 transitions. [2023-12-21 23:38:40,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-21 23:38:40,634 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:40,634 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:38:40,636 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 (17)] Forceful destruction successful, exit code 0 [2023-12-21 23:38:40,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-21 23:38:40,837 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:40,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:40,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1592884220, now seen corresponding path program 1 times [2023-12-21 23:38:40,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:40,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1685273439] [2023-12-21 23:38:40,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:40,838 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-21 23:38:40,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:40,839 INFO L229 MonitoredProcess]: Starting monitored process 18 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-21 23:38:40,860 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 (18)] Waiting until timeout for monitored process [2023-12-21 23:38:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:40,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-21 23:38:40,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 30 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:42,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:42,641 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 30 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:42,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:42,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1685273439] [2023-12-21 23:38:42,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1685273439] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:42,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:42,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-21 23:38:42,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728609097] [2023-12-21 23:38:42,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:42,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 23:38:42,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:42,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 23:38:42,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2023-12-21 23:38:42,643 INFO L87 Difference]: Start difference. First operand 2442 states and 3845 transitions. Second operand has 26 states, 26 states have (on average 6.384615384615385) internal successors, (166), 25 states have internal predecessors, (166), 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-21 23:38:44,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:44,254 INFO L93 Difference]: Finished difference Result 3030 states and 4600 transitions. [2023-12-21 23:38:44,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-21 23:38:44,255 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.384615384615385) internal successors, (166), 25 states have internal predecessors, (166), 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 91 [2023-12-21 23:38:44,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:44,261 INFO L225 Difference]: With dead ends: 3030 [2023-12-21 23:38:44,261 INFO L226 Difference]: Without dead ends: 2466 [2023-12-21 23:38:44,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=383, Invalid=1423, Unknown=0, NotChecked=0, Total=1806 [2023-12-21 23:38:44,263 INFO L413 NwaCegarLoop]: 1493 mSDtfsCounter, 16296 mSDsluCounter, 7660 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16296 SdHoareTripleChecker+Valid, 9153 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:44,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16296 Valid, 9153 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-21 23:38:44,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2023-12-21 23:38:44,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 2442. [2023-12-21 23:38:44,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 2440 states have (on average 1.5688524590163935) internal successors, (3828), 2441 states have internal predecessors, (3828), 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-21 23:38:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3828 transitions. [2023-12-21 23:38:44,378 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3828 transitions. Word has length 91 [2023-12-21 23:38:44,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:44,378 INFO L495 AbstractCegarLoop]: Abstraction has 2442 states and 3828 transitions. [2023-12-21 23:38:44,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.384615384615385) internal successors, (166), 25 states have internal predecessors, (166), 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-21 23:38:44,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3828 transitions. [2023-12-21 23:38:44,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-21 23:38:44,379 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:44,379 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:38:44,385 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 (18)] Forceful destruction successful, exit code 0 [2023-12-21 23:38:44,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-21 23:38:44,583 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:44,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:44,584 INFO L85 PathProgramCache]: Analyzing trace with hash -354529050, now seen corresponding path program 1 times [2023-12-21 23:38:44,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:44,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403701184] [2023-12-21 23:38:44,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:44,585 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-21 23:38:44,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:44,585 INFO L229 MonitoredProcess]: Starting monitored process 19 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-21 23:38:44,614 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 (19)] Waiting until timeout for monitored process [2023-12-21 23:38:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:44,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-21 23:38:44,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:45,564 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 22 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:45,564 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:46,073 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 22 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:46,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:46,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403701184] [2023-12-21 23:38:46,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403701184] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:46,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:46,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-12-21 23:38:46,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825841315] [2023-12-21 23:38:46,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:46,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 23:38:46,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:46,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 23:38:46,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2023-12-21 23:38:46,075 INFO L87 Difference]: Start difference. First operand 2442 states and 3828 transitions. Second operand has 26 states, 26 states have (on average 6.615384615384615) internal successors, (172), 25 states have internal predecessors, (172), 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-21 23:38:47,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:47,789 INFO L93 Difference]: Finished difference Result 3138 states and 4708 transitions. [2023-12-21 23:38:47,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-21 23:38:47,789 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.615384615384615) internal successors, (172), 25 states have internal predecessors, (172), 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 92 [2023-12-21 23:38:47,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:47,796 INFO L225 Difference]: With dead ends: 3138 [2023-12-21 23:38:47,796 INFO L226 Difference]: Without dead ends: 2444 [2023-12-21 23:38:47,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=403, Invalid=1489, Unknown=0, NotChecked=0, Total=1892 [2023-12-21 23:38:47,798 INFO L413 NwaCegarLoop]: 1493 mSDtfsCounter, 13271 mSDsluCounter, 9156 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13271 SdHoareTripleChecker+Valid, 10649 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:47,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13271 Valid, 10649 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-21 23:38:47,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2444 states. [2023-12-21 23:38:47,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2444 to 2442. [2023-12-21 23:38:47,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 2440 states have (on average 1.562295081967213) internal successors, (3812), 2441 states have internal predecessors, (3812), 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-21 23:38:47,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3812 transitions. [2023-12-21 23:38:47,878 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3812 transitions. Word has length 92 [2023-12-21 23:38:47,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:47,878 INFO L495 AbstractCegarLoop]: Abstraction has 2442 states and 3812 transitions. [2023-12-21 23:38:47,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.615384615384615) internal successors, (172), 25 states have internal predecessors, (172), 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-21 23:38:47,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3812 transitions. [2023-12-21 23:38:47,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-21 23:38:47,879 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:47,879 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:38:47,892 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 (19)] Ended with exit code 0 [2023-12-21 23:38:48,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-21 23:38:48,083 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:48,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:48,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1749922772, now seen corresponding path program 1 times [2023-12-21 23:38:48,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:48,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [98230553] [2023-12-21 23:38:48,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:48,084 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-21 23:38:48,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:48,085 INFO L229 MonitoredProcess]: Starting monitored process 20 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-21 23:38:48,089 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 (20)] Waiting until timeout for monitored process [2023-12-21 23:38:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:48,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 23:38:48,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:49,451 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:49,451 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:49,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:49,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [98230553] [2023-12-21 23:38:49,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [98230553] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:49,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:49,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-21 23:38:49,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448199326] [2023-12-21 23:38:49,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:49,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 23:38:49,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:49,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 23:38:49,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-21 23:38:49,988 INFO L87 Difference]: Start difference. First operand 2442 states and 3812 transitions. Second operand has 26 states, 26 states have (on average 6.923076923076923) internal successors, (180), 26 states have internal predecessors, (180), 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-21 23:38:52,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:38:52,443 INFO L93 Difference]: Finished difference Result 3202 states and 4759 transitions. [2023-12-21 23:38:52,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-21 23:38:52,449 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.923076923076923) internal successors, (180), 26 states have internal predecessors, (180), 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 93 [2023-12-21 23:38:52,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:38:52,454 INFO L225 Difference]: With dead ends: 3202 [2023-12-21 23:38:52,454 INFO L226 Difference]: Without dead ends: 2824 [2023-12-21 23:38:52,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=306, Invalid=1950, Unknown=0, NotChecked=0, Total=2256 [2023-12-21 23:38:52,456 INFO L413 NwaCegarLoop]: 1518 mSDtfsCounter, 4720 mSDsluCounter, 22556 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4720 SdHoareTripleChecker+Valid, 24074 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-21 23:38:52,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4720 Valid, 24074 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-21 23:38:52,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2023-12-21 23:38:52,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 2326. [2023-12-21 23:38:52,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2326 states, 2324 states have (on average 1.5813253012048192) internal successors, (3675), 2325 states have internal predecessors, (3675), 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-21 23:38:52,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 3675 transitions. [2023-12-21 23:38:52,508 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 3675 transitions. Word has length 93 [2023-12-21 23:38:52,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:38:52,509 INFO L495 AbstractCegarLoop]: Abstraction has 2326 states and 3675 transitions. [2023-12-21 23:38:52,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.923076923076923) internal successors, (180), 26 states have internal predecessors, (180), 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-21 23:38:52,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 3675 transitions. [2023-12-21 23:38:52,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-21 23:38:52,511 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:38:52,511 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:38:52,517 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 (20)] Forceful destruction successful, exit code 0 [2023-12-21 23:38:52,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-21 23:38:52,715 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:38:52,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:38:52,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2104628344, now seen corresponding path program 1 times [2023-12-21 23:38:52,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:38:52,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [79152245] [2023-12-21 23:38:52,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:38:52,716 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-21 23:38:52,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:38:52,717 INFO L229 MonitoredProcess]: Starting monitored process 21 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-21 23:38:52,728 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 (21)] Waiting until timeout for monitored process [2023-12-21 23:38:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:38:52,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 23:38:52,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:38:53,977 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:53,977 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:38:54,458 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:38:54,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:38:54,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [79152245] [2023-12-21 23:38:54,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [79152245] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:38:54,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:38:54,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-21 23:38:54,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569195476] [2023-12-21 23:38:54,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:38:54,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 23:38:54,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:38:54,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 23:38:54,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-21 23:38:54,461 INFO L87 Difference]: Start difference. First operand 2326 states and 3675 transitions. Second operand has 26 states, 26 states have (on average 6.730769230769231) internal successors, (175), 26 states have internal predecessors, (175), 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-21 23:39:00,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:39:00,833 INFO L93 Difference]: Finished difference Result 2976 states and 4474 transitions. [2023-12-21 23:39:00,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-21 23:39:00,833 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.730769230769231) internal successors, (175), 26 states have internal predecessors, (175), 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 93 [2023-12-21 23:39:00,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:39:00,838 INFO L225 Difference]: With dead ends: 2976 [2023-12-21 23:39:00,838 INFO L226 Difference]: Without dead ends: 2694 [2023-12-21 23:39:00,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=863, Invalid=3967, Unknown=0, NotChecked=0, Total=4830 [2023-12-21 23:39:00,840 INFO L413 NwaCegarLoop]: 1578 mSDtfsCounter, 3330 mSDsluCounter, 26272 mSDsCounter, 0 mSdLazyCounter, 2079 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3330 SdHoareTripleChecker+Valid, 27850 SdHoareTripleChecker+Invalid, 2100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-21 23:39:00,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3330 Valid, 27850 Invalid, 2100 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 2079 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-21 23:39:00,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2023-12-21 23:39:00,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2494. [2023-12-21 23:39:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2494 states, 2492 states have (on average 1.5537720706260032) internal successors, (3872), 2493 states have internal predecessors, (3872), 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-21 23:39:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2494 states to 2494 states and 3872 transitions. [2023-12-21 23:39:00,936 INFO L78 Accepts]: Start accepts. Automaton has 2494 states and 3872 transitions. Word has length 93 [2023-12-21 23:39:00,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:39:00,937 INFO L495 AbstractCegarLoop]: Abstraction has 2494 states and 3872 transitions. [2023-12-21 23:39:00,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.730769230769231) internal successors, (175), 26 states have internal predecessors, (175), 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-21 23:39:00,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2494 states and 3872 transitions. [2023-12-21 23:39:00,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-21 23:39:00,938 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:39:00,938 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:39:00,942 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 (21)] Ended with exit code 0 [2023-12-21 23:39:01,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-21 23:39:01,141 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:39:01,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:39:01,142 INFO L85 PathProgramCache]: Analyzing trace with hash -404456876, now seen corresponding path program 1 times [2023-12-21 23:39:01,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:39:01,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [910680103] [2023-12-21 23:39:01,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:39:01,142 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-21 23:39:01,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:39:01,143 INFO L229 MonitoredProcess]: Starting monitored process 22 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-21 23:39:01,144 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 (22)] Waiting until timeout for monitored process [2023-12-21 23:39:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:39:01,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 23:39:01,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:39:02,335 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:39:02,336 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:39:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:39:02,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:39:02,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [910680103] [2023-12-21 23:39:02,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [910680103] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:39:02,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:39:02,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-21 23:39:02,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241917761] [2023-12-21 23:39:02,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:39:02,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 23:39:02,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:39:02,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 23:39:02,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2023-12-21 23:39:02,864 INFO L87 Difference]: Start difference. First operand 2494 states and 3872 transitions. Second operand has 26 states, 26 states have (on average 6.538461538461538) internal successors, (170), 26 states have internal predecessors, (170), 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-21 23:39:08,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:39:08,655 INFO L93 Difference]: Finished difference Result 4138 states and 5849 transitions. [2023-12-21 23:39:08,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-12-21 23:39:08,655 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.538461538461538) internal successors, (170), 26 states have internal predecessors, (170), 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 93 [2023-12-21 23:39:08,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:39:08,677 INFO L225 Difference]: With dead ends: 4138 [2023-12-21 23:39:08,677 INFO L226 Difference]: Without dead ends: 3838 [2023-12-21 23:39:08,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1011, Invalid=4995, Unknown=0, NotChecked=0, Total=6006 [2023-12-21 23:39:08,679 INFO L413 NwaCegarLoop]: 1594 mSDtfsCounter, 3435 mSDsluCounter, 20276 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3435 SdHoareTripleChecker+Valid, 21870 SdHoareTripleChecker+Invalid, 1870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:39:08,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3435 Valid, 21870 Invalid, 1870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1852 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-21 23:39:08,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3838 states. [2023-12-21 23:39:08,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3838 to 3197. [2023-12-21 23:39:08,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3197 states, 3195 states have (on average 1.4751173708920189) internal successors, (4713), 3196 states have internal predecessors, (4713), 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-21 23:39:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3197 states to 3197 states and 4713 transitions. [2023-12-21 23:39:08,785 INFO L78 Accepts]: Start accepts. Automaton has 3197 states and 4713 transitions. Word has length 93 [2023-12-21 23:39:08,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:39:08,787 INFO L495 AbstractCegarLoop]: Abstraction has 3197 states and 4713 transitions. [2023-12-21 23:39:08,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.538461538461538) internal successors, (170), 26 states have internal predecessors, (170), 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-21 23:39:08,787 INFO L276 IsEmpty]: Start isEmpty. Operand 3197 states and 4713 transitions. [2023-12-21 23:39:08,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-21 23:39:08,789 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:39:08,789 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:39:08,792 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 (22)] Ended with exit code 0 [2023-12-21 23:39:08,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-21 23:39:08,993 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:39:08,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:39:08,993 INFO L85 PathProgramCache]: Analyzing trace with hash 167628091, now seen corresponding path program 1 times [2023-12-21 23:39:08,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:39:08,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176071713] [2023-12-21 23:39:08,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:39:08,994 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-21 23:39:08,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:39:08,995 INFO L229 MonitoredProcess]: Starting monitored process 23 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-21 23:39:08,995 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 (23)] Waiting until timeout for monitored process [2023-12-21 23:39:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:39:09,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 23:39:09,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:39:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:39:09,155 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:39:09,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:39:09,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176071713] [2023-12-21 23:39:09,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176071713] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:39:09,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:39:09,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 23:39:09,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954248358] [2023-12-21 23:39:09,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:39:09,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 23:39:09,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:39:09,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 23:39:09,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 23:39:09,156 INFO L87 Difference]: Start difference. First operand 3197 states and 4713 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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-21 23:39:48,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:39:48,717 INFO L93 Difference]: Finished difference Result 6203 states and 10048 transitions. [2023-12-21 23:39:48,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 23:39:48,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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 124 [2023-12-21 23:39:48,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:39:48,736 INFO L225 Difference]: With dead ends: 6203 [2023-12-21 23:39:48,736 INFO L226 Difference]: Without dead ends: 4699 [2023-12-21 23:39:48,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 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-21 23:39:48,739 INFO L413 NwaCegarLoop]: 565 mSDtfsCounter, 796 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2343 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 2934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.3s IncrementalHoareTripleChecker+Time [2023-12-21 23:39:48,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 572 Invalid, 2934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2343 Invalid, 0 Unknown, 0 Unchecked, 39.3s Time] [2023-12-21 23:39:48,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4699 states. [2023-12-21 23:39:48,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4699 to 4699. [2023-12-21 23:39:48,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4699 states, 4697 states have (on average 1.4228230785607834) internal successors, (6683), 4698 states have internal predecessors, (6683), 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-21 23:39:48,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4699 states to 4699 states and 6683 transitions. [2023-12-21 23:39:48,866 INFO L78 Accepts]: Start accepts. Automaton has 4699 states and 6683 transitions. Word has length 124 [2023-12-21 23:39:48,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:39:48,867 INFO L495 AbstractCegarLoop]: Abstraction has 4699 states and 6683 transitions. [2023-12-21 23:39:48,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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-21 23:39:48,867 INFO L276 IsEmpty]: Start isEmpty. Operand 4699 states and 6683 transitions. [2023-12-21 23:39:48,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-21 23:39:48,868 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:39:48,869 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:39:48,888 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 (23)] Ended with exit code 0 [2023-12-21 23:39:49,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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-21 23:39:49,073 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:39:49,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:39:49,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1227951098, now seen corresponding path program 2 times [2023-12-21 23:39:49,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:39:49,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205497328] [2023-12-21 23:39:49,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 23:39:49,074 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-21 23:39:49,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:39:49,074 INFO L229 MonitoredProcess]: Starting monitored process 24 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-21 23:39:49,104 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 (24)] Waiting until timeout for monitored process [2023-12-21 23:39:49,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 23:39:49,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 23:39:49,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 23:39:49,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:39:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2023-12-21 23:39:49,597 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:39:49,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:39:49,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205497328] [2023-12-21 23:39:49,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205497328] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:39:49,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:39:49,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 23:39:49,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346497772] [2023-12-21 23:39:49,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:39:49,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 23:39:49,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:39:49,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 23:39:49,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 23:39:49,598 INFO L87 Difference]: Start difference. First operand 4699 states and 6683 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-21 23:39:49,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:39:49,752 INFO L93 Difference]: Finished difference Result 5481 states and 7672 transitions. [2023-12-21 23:39:49,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 23:39:49,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 130 [2023-12-21 23:39:49,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:39:49,759 INFO L225 Difference]: With dead ends: 5481 [2023-12-21 23:39:49,759 INFO L226 Difference]: Without dead ends: 4827 [2023-12-21 23:39:49,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 23:39:49,761 INFO L413 NwaCegarLoop]: 1531 mSDtfsCounter, 1528 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1528 SdHoareTripleChecker+Valid, 3095 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:39:49,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1528 Valid, 3095 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 23:39:49,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states. [2023-12-21 23:39:49,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 4691. [2023-12-21 23:39:49,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4691 states, 4689 states have (on average 1.4167199829387929) internal successors, (6643), 4690 states have internal predecessors, (6643), 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-21 23:39:49,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4691 states to 4691 states and 6643 transitions. [2023-12-21 23:39:49,893 INFO L78 Accepts]: Start accepts. Automaton has 4691 states and 6643 transitions. Word has length 130 [2023-12-21 23:39:49,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:39:49,893 INFO L495 AbstractCegarLoop]: Abstraction has 4691 states and 6643 transitions. [2023-12-21 23:39:49,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-21 23:39:49,893 INFO L276 IsEmpty]: Start isEmpty. Operand 4691 states and 6643 transitions. [2023-12-21 23:39:49,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-21 23:39:49,895 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:39:49,895 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:39:49,910 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 (24)] Forceful destruction successful, exit code 0 [2023-12-21 23:39:50,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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-21 23:39:50,098 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:39:50,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:39:50,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1582656670, now seen corresponding path program 2 times [2023-12-21 23:39:50,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:39:50,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444458836] [2023-12-21 23:39:50,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 23:39:50,099 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-21 23:39:50,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:39:50,100 INFO L229 MonitoredProcess]: Starting monitored process 25 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-21 23:39:50,101 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 (25)] Waiting until timeout for monitored process [2023-12-21 23:39:50,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 23:39:50,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 23:39:50,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 23:39:50,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:39:50,645 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2023-12-21 23:39:50,646 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:39:50,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:39:50,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444458836] [2023-12-21 23:39:50,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444458836] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:39:50,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:39:50,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 23:39:50,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284664770] [2023-12-21 23:39:50,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:39:50,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 23:39:50,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:39:50,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 23:39:50,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 23:39:50,647 INFO L87 Difference]: Start difference. First operand 4691 states and 6643 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-21 23:39:50,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:39:50,819 INFO L93 Difference]: Finished difference Result 5260 states and 7379 transitions. [2023-12-21 23:39:50,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 23:39:50,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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 130 [2023-12-21 23:39:50,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:39:50,841 INFO L225 Difference]: With dead ends: 5260 [2023-12-21 23:39:50,841 INFO L226 Difference]: Without dead ends: 4931 [2023-12-21 23:39:50,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 23:39:50,843 INFO L413 NwaCegarLoop]: 1534 mSDtfsCounter, 1523 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 3120 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:39:50,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 3120 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 23:39:50,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4931 states. [2023-12-21 23:39:50,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4931 to 4863. [2023-12-21 23:39:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4863 states, 4861 states have (on average 1.4058835630528699) internal successors, (6834), 4862 states have internal predecessors, (6834), 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-21 23:39:50,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4863 states to 4863 states and 6834 transitions. [2023-12-21 23:39:50,985 INFO L78 Accepts]: Start accepts. Automaton has 4863 states and 6834 transitions. Word has length 130 [2023-12-21 23:39:50,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:39:50,985 INFO L495 AbstractCegarLoop]: Abstraction has 4863 states and 6834 transitions. [2023-12-21 23:39:50,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-21 23:39:50,986 INFO L276 IsEmpty]: Start isEmpty. Operand 4863 states and 6834 transitions. [2023-12-21 23:39:50,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-21 23:39:50,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:39:50,987 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:39:50,990 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 (25)] Forceful destruction successful, exit code 0 [2023-12-21 23:39:51,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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-21 23:39:51,190 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:39:51,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:39:51,191 INFO L85 PathProgramCache]: Analyzing trace with hash -926428550, now seen corresponding path program 2 times [2023-12-21 23:39:51,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:39:51,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293472631] [2023-12-21 23:39:51,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 23:39:51,191 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-21 23:39:51,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:39:51,192 INFO L229 MonitoredProcess]: Starting monitored process 26 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-21 23:39:51,194 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 (26)] Waiting until timeout for monitored process [2023-12-21 23:39:51,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 23:39:51,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 23:39:51,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 23:39:51,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:39:51,686 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2023-12-21 23:39:51,686 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:39:51,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:39:51,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293472631] [2023-12-21 23:39:51,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1293472631] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:39:51,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:39:51,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 23:39:51,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483183142] [2023-12-21 23:39:51,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:39:51,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 23:39:51,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:39:51,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 23:39:51,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 23:39:51,688 INFO L87 Difference]: Start difference. First operand 4863 states and 6834 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-21 23:39:51,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:39:51,892 INFO L93 Difference]: Finished difference Result 5387 states and 7510 transitions. [2023-12-21 23:39:51,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 23:39:51,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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 130 [2023-12-21 23:39:51,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:39:51,899 INFO L225 Difference]: With dead ends: 5387 [2023-12-21 23:39:51,899 INFO L226 Difference]: Without dead ends: 5113 [2023-12-21 23:39:51,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-21 23:39:51,905 INFO L413 NwaCegarLoop]: 1534 mSDtfsCounter, 2964 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2964 SdHoareTripleChecker+Valid, 3090 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:39:51,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2964 Valid, 3090 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 23:39:51,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5113 states. [2023-12-21 23:39:52,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5113 to 5045. [2023-12-21 23:39:52,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5045 states, 5043 states have (on average 1.3967876264128496) internal successors, (7044), 5044 states have internal predecessors, (7044), 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-21 23:39:52,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5045 states to 5045 states and 7044 transitions. [2023-12-21 23:39:52,060 INFO L78 Accepts]: Start accepts. Automaton has 5045 states and 7044 transitions. Word has length 130 [2023-12-21 23:39:52,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:39:52,060 INFO L495 AbstractCegarLoop]: Abstraction has 5045 states and 7044 transitions. [2023-12-21 23:39:52,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-21 23:39:52,061 INFO L276 IsEmpty]: Start isEmpty. Operand 5045 states and 7044 transitions. [2023-12-21 23:39:52,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-21 23:39:52,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:39:52,063 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:39:52,076 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 (26)] Ended with exit code 0 [2023-12-21 23:39:52,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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-21 23:39:52,267 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:39:52,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:39:52,267 INFO L85 PathProgramCache]: Analyzing trace with hash -597310102, now seen corresponding path program 1 times [2023-12-21 23:39:52,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:39:52,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745853701] [2023-12-21 23:39:52,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:39:52,268 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-21 23:39:52,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:39:52,270 INFO L229 MonitoredProcess]: Starting monitored process 27 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-21 23:39:52,270 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 (27)] Waiting until timeout for monitored process [2023-12-21 23:39:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:39:52,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 23:39:52,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:39:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:39:52,994 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 23:39:52,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:39:52,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745853701] [2023-12-21 23:39:52,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745853701] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 23:39:52,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 23:39:52,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 23:39:52,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601590993] [2023-12-21 23:39:52,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 23:39:52,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 23:39:52,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:39:52,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 23:39:52,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-21 23:39:52,996 INFO L87 Difference]: Start difference. First operand 5045 states and 7044 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 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-21 23:40:24,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:40:24,453 INFO L93 Difference]: Finished difference Result 8838 states and 12661 transitions. [2023-12-21 23:40:24,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 23:40:24,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 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 130 [2023-12-21 23:40:24,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:40:24,470 INFO L225 Difference]: With dead ends: 8838 [2023-12-21 23:40:24,470 INFO L226 Difference]: Without dead ends: 5796 [2023-12-21 23:40:24,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-21 23:40:24,472 INFO L413 NwaCegarLoop]: 715 mSDtfsCounter, 748 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 3683 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 3837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 3683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.2s IncrementalHoareTripleChecker+Time [2023-12-21 23:40:24,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 794 Invalid, 3837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 3683 Invalid, 0 Unknown, 0 Unchecked, 31.2s Time] [2023-12-21 23:40:24,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5796 states. [2023-12-21 23:40:24,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5796 to 5796. [2023-12-21 23:40:24,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5796 states, 5794 states have (on average 1.3517431826026924) internal successors, (7832), 5795 states have internal predecessors, (7832), 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-21 23:40:24,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5796 states to 5796 states and 7832 transitions. [2023-12-21 23:40:24,590 INFO L78 Accepts]: Start accepts. Automaton has 5796 states and 7832 transitions. Word has length 130 [2023-12-21 23:40:24,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:40:24,590 INFO L495 AbstractCegarLoop]: Abstraction has 5796 states and 7832 transitions. [2023-12-21 23:40:24,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 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-21 23:40:24,591 INFO L276 IsEmpty]: Start isEmpty. Operand 5796 states and 7832 transitions. [2023-12-21 23:40:24,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-21 23:40:24,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:40:24,593 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:40:24,608 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 (27)] Forceful destruction successful, exit code 0 [2023-12-21 23:40:24,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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-21 23:40:24,809 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:40:24,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:40:24,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1193260010, now seen corresponding path program 1 times [2023-12-21 23:40:24,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:40:24,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781964584] [2023-12-21 23:40:24,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:40:24,810 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-21 23:40:24,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:40:24,811 INFO L229 MonitoredProcess]: Starting monitored process 28 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-21 23:40:24,812 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 (28)] Waiting until timeout for monitored process [2023-12-21 23:40:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:40:24,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-21 23:40:24,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:40:26,142 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 54 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:40:26,142 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:40:27,052 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 54 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:40:27,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:40:27,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781964584] [2023-12-21 23:40:27,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781964584] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:40:27,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:40:27,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-21 23:40:27,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881430956] [2023-12-21 23:40:27,052 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:40:27,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-21 23:40:27,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:40:27,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-21 23:40:27,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1006, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 23:40:27,054 INFO L87 Difference]: Start difference. First operand 5796 states and 7832 transitions. Second operand has 34 states, 34 states have (on average 7.176470588235294) internal successors, (244), 34 states have internal predecessors, (244), 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-21 23:41:02,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:41:02,645 INFO L93 Difference]: Finished difference Result 15323 states and 19306 transitions. [2023-12-21 23:41:02,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 262 states. [2023-12-21 23:41:02,645 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 7.176470588235294) internal successors, (244), 34 states have internal predecessors, (244), 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 131 [2023-12-21 23:41:02,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:41:02,657 INFO L225 Difference]: With dead ends: 15323 [2023-12-21 23:41:02,657 INFO L226 Difference]: Without dead ends: 14731 [2023-12-21 23:41:02,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33525 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=8390, Invalid=76000, Unknown=0, NotChecked=0, Total=84390 [2023-12-21 23:41:02,678 INFO L413 NwaCegarLoop]: 1680 mSDtfsCounter, 24706 mSDsluCounter, 15403 mSDsCounter, 0 mSdLazyCounter, 4001 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24706 SdHoareTripleChecker+Valid, 17083 SdHoareTripleChecker+Invalid, 4093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 4001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-12-21 23:41:02,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24706 Valid, 17083 Invalid, 4093 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [92 Valid, 4001 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2023-12-21 23:41:02,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14731 states. [2023-12-21 23:41:03,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14731 to 13927. [2023-12-21 23:41:03,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13927 states, 13925 states have (on average 1.260394973070018) internal successors, (17551), 13926 states have internal predecessors, (17551), 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-21 23:41:03,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13927 states to 13927 states and 17551 transitions. [2023-12-21 23:41:03,225 INFO L78 Accepts]: Start accepts. Automaton has 13927 states and 17551 transitions. Word has length 131 [2023-12-21 23:41:03,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:41:03,226 INFO L495 AbstractCegarLoop]: Abstraction has 13927 states and 17551 transitions. [2023-12-21 23:41:03,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.176470588235294) internal successors, (244), 34 states have internal predecessors, (244), 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-21 23:41:03,226 INFO L276 IsEmpty]: Start isEmpty. Operand 13927 states and 17551 transitions. [2023-12-21 23:41:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-21 23:41:03,243 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:41:03,244 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:41:03,248 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 (28)] Ended with exit code 0 [2023-12-21 23:41:03,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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-21 23:41:03,447 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:41:03,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:41:03,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1665490502, now seen corresponding path program 1 times [2023-12-21 23:41:03,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:41:03,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1382716560] [2023-12-21 23:41:03,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:41:03,448 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-21 23:41:03,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:41:03,449 INFO L229 MonitoredProcess]: Starting monitored process 29 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-21 23:41:03,450 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 (29)] Waiting until timeout for monitored process [2023-12-21 23:41:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:41:03,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-21 23:41:03,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:41:05,842 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 130 proven. 50 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-21 23:41:05,842 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:41:08,963 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 61 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 23:41:08,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:41:08,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1382716560] [2023-12-21 23:41:08,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1382716560] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:41:08,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:41:08,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 39 [2023-12-21 23:41:08,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074234551] [2023-12-21 23:41:08,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:41:08,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-21 23:41:08,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:41:08,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-21 23:41:08,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1318, Unknown=0, NotChecked=0, Total=1482 [2023-12-21 23:41:08,965 INFO L87 Difference]: Start difference. First operand 13927 states and 17551 transitions. Second operand has 39 states, 39 states have (on average 5.82051282051282) internal successors, (227), 39 states have internal predecessors, (227), 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-21 23:41:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:41:54,063 INFO L93 Difference]: Finished difference Result 23742 states and 29283 transitions. [2023-12-21 23:41:54,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2023-12-21 23:41:54,064 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 5.82051282051282) internal successors, (227), 39 states have internal predecessors, (227), 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 131 [2023-12-21 23:41:54,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:41:54,082 INFO L225 Difference]: With dead ends: 23742 [2023-12-21 23:41:54,082 INFO L226 Difference]: Without dead ends: 18477 [2023-12-21 23:41:54,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12543 ImplicationChecksByTransitivity, 40.6s TimeCoverageRelationStatistics Valid=4990, Invalid=30166, Unknown=0, NotChecked=0, Total=35156 [2023-12-21 23:41:54,088 INFO L413 NwaCegarLoop]: 1543 mSDtfsCounter, 23655 mSDsluCounter, 18854 mSDsCounter, 0 mSdLazyCounter, 2110 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23655 SdHoareTripleChecker+Valid, 20397 SdHoareTripleChecker+Invalid, 2262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 2110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:41:54,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23655 Valid, 20397 Invalid, 2262 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [152 Valid, 2110 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2023-12-21 23:41:54,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18477 states. [2023-12-21 23:41:54,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18477 to 16260. [2023-12-21 23:41:54,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16260 states, 16258 states have (on average 1.2472013777832451) internal successors, (20277), 16259 states have internal predecessors, (20277), 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-21 23:41:54,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16260 states to 16260 states and 20277 transitions. [2023-12-21 23:41:54,881 INFO L78 Accepts]: Start accepts. Automaton has 16260 states and 20277 transitions. Word has length 131 [2023-12-21 23:41:54,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:41:54,881 INFO L495 AbstractCegarLoop]: Abstraction has 16260 states and 20277 transitions. [2023-12-21 23:41:54,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 5.82051282051282) internal successors, (227), 39 states have internal predecessors, (227), 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-21 23:41:54,881 INFO L276 IsEmpty]: Start isEmpty. Operand 16260 states and 20277 transitions. [2023-12-21 23:41:54,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-21 23:41:54,893 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:41:54,894 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:41:54,910 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 (29)] Forceful destruction successful, exit code 0 [2023-12-21 23:41:55,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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-21 23:41:55,094 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:41:55,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:41:55,095 INFO L85 PathProgramCache]: Analyzing trace with hash -998141848, now seen corresponding path program 1 times [2023-12-21 23:41:55,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:41:55,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943572463] [2023-12-21 23:41:55,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:41:55,095 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-21 23:41:55,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:41:55,102 INFO L229 MonitoredProcess]: Starting monitored process 30 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-21 23:41:55,145 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 (30)] Waiting until timeout for monitored process [2023-12-21 23:41:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:41:55,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-21 23:41:55,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:41:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 127 proven. 68 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-21 23:41:57,159 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:41:58,517 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 127 proven. 68 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-21 23:41:58,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:41:58,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943572463] [2023-12-21 23:41:58,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943572463] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:41:58,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:41:58,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-21 23:41:58,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505825807] [2023-12-21 23:41:58,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:41:58,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-21 23:41:58,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:41:58,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-21 23:41:58,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 23:41:58,519 INFO L87 Difference]: Start difference. First operand 16260 states and 20277 transitions. Second operand has 34 states, 34 states have (on average 6.029411764705882) internal successors, (205), 34 states have internal predecessors, (205), 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-21 23:42:26,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:42:26,690 INFO L93 Difference]: Finished difference Result 25258 states and 30998 transitions. [2023-12-21 23:42:26,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2023-12-21 23:42:26,692 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 6.029411764705882) internal successors, (205), 34 states have internal predecessors, (205), 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 132 [2023-12-21 23:42:26,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:42:26,705 INFO L225 Difference]: With dead ends: 25258 [2023-12-21 23:42:26,705 INFO L226 Difference]: Without dead ends: 18390 [2023-12-21 23:42:26,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7206 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=3210, Invalid=17382, Unknown=0, NotChecked=0, Total=20592 [2023-12-21 23:42:26,711 INFO L413 NwaCegarLoop]: 1535 mSDtfsCounter, 14116 mSDsluCounter, 14726 mSDsCounter, 0 mSdLazyCounter, 1899 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14116 SdHoareTripleChecker+Valid, 16261 SdHoareTripleChecker+Invalid, 1983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-12-21 23:42:26,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14116 Valid, 16261 Invalid, 1983 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [84 Valid, 1899 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-12-21 23:42:26,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18390 states. [2023-12-21 23:42:27,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18390 to 17165. [2023-12-21 23:42:27,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17165 states, 17163 states have (on average 1.2412165705296276) internal successors, (21303), 17164 states have internal predecessors, (21303), 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-21 23:42:27,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17165 states to 17165 states and 21303 transitions. [2023-12-21 23:42:27,482 INFO L78 Accepts]: Start accepts. Automaton has 17165 states and 21303 transitions. Word has length 132 [2023-12-21 23:42:27,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:42:27,482 INFO L495 AbstractCegarLoop]: Abstraction has 17165 states and 21303 transitions. [2023-12-21 23:42:27,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.029411764705882) internal successors, (205), 34 states have internal predecessors, (205), 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-21 23:42:27,482 INFO L276 IsEmpty]: Start isEmpty. Operand 17165 states and 21303 transitions. [2023-12-21 23:42:27,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-21 23:42:27,485 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:42:27,486 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:42:27,490 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 (30)] Ended with exit code 0 [2023-12-21 23:42:27,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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-21 23:42:27,689 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:42:27,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:42:27,689 INFO L85 PathProgramCache]: Analyzing trace with hash 250812344, now seen corresponding path program 1 times [2023-12-21 23:42:27,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:42:27,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293830980] [2023-12-21 23:42:27,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:42:27,690 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-21 23:42:27,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:42:27,691 INFO L229 MonitoredProcess]: Starting monitored process 31 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-21 23:42:27,718 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 (31)] Waiting until timeout for monitored process [2023-12-21 23:42:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:42:27,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-21 23:42:27,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:42:29,570 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 129 proven. 59 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-21 23:42:29,571 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:42:30,965 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 129 proven. 59 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-21 23:42:30,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:42:30,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293830980] [2023-12-21 23:42:30,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [293830980] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:42:30,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:42:30,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2023-12-21 23:42:30,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053298372] [2023-12-21 23:42:30,966 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:42:30,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-21 23:42:30,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:42:30,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-21 23:42:30,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=989, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 23:42:30,967 INFO L87 Difference]: Start difference. First operand 17165 states and 21303 transitions. Second operand has 34 states, 34 states have (on average 5.764705882352941) internal successors, (196), 34 states have internal predecessors, (196), 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-21 23:43:03,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:43:03,587 INFO L93 Difference]: Finished difference Result 31134 states and 38011 transitions. [2023-12-21 23:43:03,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2023-12-21 23:43:03,588 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.764705882352941) internal successors, (196), 34 states have internal predecessors, (196), 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 132 [2023-12-21 23:43:03,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:43:03,614 INFO L225 Difference]: With dead ends: 31134 [2023-12-21 23:43:03,614 INFO L226 Difference]: Without dead ends: 24745 [2023-12-21 23:43:03,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10750 ImplicationChecksByTransitivity, 28.0s TimeCoverageRelationStatistics Valid=4570, Invalid=24842, Unknown=0, NotChecked=0, Total=29412 [2023-12-21 23:43:03,623 INFO L413 NwaCegarLoop]: 1571 mSDtfsCounter, 17684 mSDsluCounter, 15078 mSDsCounter, 0 mSdLazyCounter, 1898 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17684 SdHoareTripleChecker+Valid, 16649 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-12-21 23:43:03,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17684 Valid, 16649 Invalid, 2016 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [118 Valid, 1898 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-12-21 23:43:03,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24745 states. [2023-12-21 23:43:04,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24745 to 18672. [2023-12-21 23:43:04,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18672 states, 18670 states have (on average 1.2385645420460631) internal successors, (23124), 18671 states have internal predecessors, (23124), 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-21 23:43:04,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18672 states to 18672 states and 23124 transitions. [2023-12-21 23:43:04,544 INFO L78 Accepts]: Start accepts. Automaton has 18672 states and 23124 transitions. Word has length 132 [2023-12-21 23:43:04,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:43:04,545 INFO L495 AbstractCegarLoop]: Abstraction has 18672 states and 23124 transitions. [2023-12-21 23:43:04,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.764705882352941) internal successors, (196), 34 states have internal predecessors, (196), 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-21 23:43:04,545 INFO L276 IsEmpty]: Start isEmpty. Operand 18672 states and 23124 transitions. [2023-12-21 23:43:04,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-21 23:43:04,547 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:43:04,547 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:43:04,558 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 (31)] Forceful destruction successful, exit code 0 [2023-12-21 23:43:04,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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-21 23:43:04,751 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:43:04,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:43:04,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1794314758, now seen corresponding path program 1 times [2023-12-21 23:43:04,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:43:04,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256891632] [2023-12-21 23:43:04,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:43:04,767 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-21 23:43:04,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:43:04,768 INFO L229 MonitoredProcess]: Starting monitored process 32 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-21 23:43:04,770 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 (32)] Waiting until timeout for monitored process [2023-12-21 23:43:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:43:04,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-21 23:43:04,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:43:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 132 proven. 50 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-21 23:43:07,281 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:43:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 128 proven. 68 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-21 23:43:09,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:43:09,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256891632] [2023-12-21 23:43:09,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256891632] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:43:09,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:43:09,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 36 [2023-12-21 23:43:09,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9242343] [2023-12-21 23:43:09,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:43:09,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-21 23:43:09,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:43:09,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-21 23:43:09,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2023-12-21 23:43:09,310 INFO L87 Difference]: Start difference. First operand 18672 states and 23124 transitions. Second operand has 36 states, 36 states have (on average 5.5) internal successors, (198), 36 states have internal predecessors, (198), 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-21 23:43:33,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:43:33,196 INFO L93 Difference]: Finished difference Result 36252 states and 44236 transitions. [2023-12-21 23:43:33,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2023-12-21 23:43:33,198 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.5) internal successors, (198), 36 states have internal predecessors, (198), 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 133 [2023-12-21 23:43:33,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:43:33,216 INFO L225 Difference]: With dead ends: 36252 [2023-12-21 23:43:33,216 INFO L226 Difference]: Without dead ends: 23970 [2023-12-21 23:43:33,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7109 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=4005, Invalid=16875, Unknown=0, NotChecked=0, Total=20880 [2023-12-21 23:43:33,224 INFO L413 NwaCegarLoop]: 1542 mSDtfsCounter, 18232 mSDsluCounter, 15828 mSDsCounter, 0 mSdLazyCounter, 2177 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18232 SdHoareTripleChecker+Valid, 17370 SdHoareTripleChecker+Invalid, 2243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-12-21 23:43:33,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18232 Valid, 17370 Invalid, 2243 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [66 Valid, 2177 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-12-21 23:43:33,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23970 states. [2023-12-21 23:43:34,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23970 to 21747. [2023-12-21 23:43:34,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21747 states, 21745 states have (on average 1.2340308116808463) internal successors, (26834), 21746 states have internal predecessors, (26834), 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-21 23:43:34,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21747 states to 21747 states and 26834 transitions. [2023-12-21 23:43:34,363 INFO L78 Accepts]: Start accepts. Automaton has 21747 states and 26834 transitions. Word has length 133 [2023-12-21 23:43:34,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:43:34,364 INFO L495 AbstractCegarLoop]: Abstraction has 21747 states and 26834 transitions. [2023-12-21 23:43:34,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.5) internal successors, (198), 36 states have internal predecessors, (198), 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-21 23:43:34,364 INFO L276 IsEmpty]: Start isEmpty. Operand 21747 states and 26834 transitions. [2023-12-21 23:43:34,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-21 23:43:34,366 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:43:34,367 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:43:34,370 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 (32)] Forceful destruction successful, exit code 0 [2023-12-21 23:43:34,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /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-21 23:43:34,573 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:43:34,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:43:34,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1010440518, now seen corresponding path program 1 times [2023-12-21 23:43:34,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:43:34,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558661494] [2023-12-21 23:43:34,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:43:34,574 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-21 23:43:34,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:43:34,575 INFO L229 MonitoredProcess]: Starting monitored process 33 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-21 23:43:34,576 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 (33)] Waiting until timeout for monitored process [2023-12-21 23:43:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 23:43:34,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 23:43:34,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 23:43:34,876 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 15 proven. 185 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-21 23:43:34,876 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 23:43:35,135 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 15 proven. 185 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-21 23:43:35,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 23:43:35,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [558661494] [2023-12-21 23:43:35,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [558661494] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 23:43:35,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 23:43:35,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-21 23:43:35,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709198531] [2023-12-21 23:43:35,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 23:43:35,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 23:43:35,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 23:43:35,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 23:43:35,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-21 23:43:35,137 INFO L87 Difference]: Start difference. First operand 21747 states and 26834 transitions. Second operand has 10 states, 10 states have (on average 21.6) internal successors, (216), 10 states have internal predecessors, (216), 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-21 23:43:38,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 23:43:38,799 INFO L93 Difference]: Finished difference Result 79810 states and 97442 transitions. [2023-12-21 23:43:38,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 23:43:38,799 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 21.6) internal successors, (216), 10 states have internal predecessors, (216), 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 134 [2023-12-21 23:43:38,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 23:43:38,876 INFO L225 Difference]: With dead ends: 79810 [2023-12-21 23:43:38,877 INFO L226 Difference]: Without dead ends: 62453 [2023-12-21 23:43:38,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-21 23:43:38,893 INFO L413 NwaCegarLoop]: 1560 mSDtfsCounter, 1713 mSDsluCounter, 6346 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1713 SdHoareTripleChecker+Valid, 7906 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 23:43:38,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1713 Valid, 7906 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 23:43:38,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62453 states. [2023-12-21 23:43:42,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62453 to 61448. [2023-12-21 23:43:42,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61448 states, 61446 states have (on average 1.163672167431566) internal successors, (71503), 61447 states have internal predecessors, (71503), 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-21 23:43:42,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61448 states to 61448 states and 71503 transitions. [2023-12-21 23:43:42,717 INFO L78 Accepts]: Start accepts. Automaton has 61448 states and 71503 transitions. Word has length 134 [2023-12-21 23:43:42,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 23:43:42,717 INFO L495 AbstractCegarLoop]: Abstraction has 61448 states and 71503 transitions. [2023-12-21 23:43:42,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.6) internal successors, (216), 10 states have internal predecessors, (216), 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-21 23:43:42,717 INFO L276 IsEmpty]: Start isEmpty. Operand 61448 states and 71503 transitions. [2023-12-21 23:43:42,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-21 23:43:42,720 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 23:43:42,720 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:43:42,724 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 (33)] Forceful destruction successful, exit code 0 [2023-12-21 23:43:42,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /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-21 23:43:42,924 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 23:43:42,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 23:43:42,987 INFO L85 PathProgramCache]: Analyzing trace with hash 878356736, now seen corresponding path program 1 times [2023-12-21 23:43:42,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 23:43:42,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018439020] [2023-12-21 23:43:42,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 23:43:42,988 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-21 23:43:42,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 23:43:42,989 INFO L229 MonitoredProcess]: Starting monitored process 34 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-21 23:43:42,990 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 (34)] Waiting until timeout for monitored process [2023-12-21 23:43:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 23:43:43,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 23:43:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 23:43:43,231 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-21 23:43:43,232 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 23:43:43,232 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-21 23:43:43,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-21 23:43:43,249 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 (34)] Forceful destruction successful, exit code 0 [2023-12-21 23:43:43,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /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-21 23:43:43,441 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 23:43:43,444 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 23:43:43,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 11:43:43 BoogieIcfgContainer [2023-12-21 23:43:43,584 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 23:43:43,585 INFO L158 Benchmark]: Toolchain (without parser) took 375952.34ms. Allocated memory was 253.8MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 185.8MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 546.2MB. Max. memory is 8.0GB. [2023-12-21 23:43:43,585 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 205.5MB. Free memory is still 152.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 23:43:43,585 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1443.28ms. Allocated memory is still 253.8MB. Free memory was 185.3MB in the beginning and 183.1MB in the end (delta: 2.2MB). Peak memory consumption was 111.2MB. Max. memory is 8.0GB. [2023-12-21 23:43:43,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 143.19ms. Allocated memory is still 253.8MB. Free memory was 183.1MB in the beginning and 147.5MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2023-12-21 23:43:43,585 INFO L158 Benchmark]: Boogie Preprocessor took 220.21ms. Allocated memory is still 253.8MB. Free memory was 147.5MB in the beginning and 108.7MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2023-12-21 23:43:43,586 INFO L158 Benchmark]: RCFGBuilder took 26136.40ms. Allocated memory was 253.8MB in the beginning and 628.1MB in the end (delta: 374.3MB). Free memory was 108.7MB in the beginning and 388.8MB in the end (delta: -280.1MB). Peak memory consumption was 138.8MB. Max. memory is 8.0GB. [2023-12-21 23:43:43,586 INFO L158 Benchmark]: TraceAbstraction took 348002.99ms. Allocated memory was 628.1MB in the beginning and 3.1GB in the end (delta: 2.5GB). Free memory was 387.8MB in the beginning and 2.5GB in the end (delta: -2.1GB). Peak memory consumption was 372.8MB. Max. memory is 8.0GB. [2023-12-21 23:43:43,586 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.16ms. Allocated memory is still 205.5MB. Free memory is still 152.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1443.28ms. Allocated memory is still 253.8MB. Free memory was 185.3MB in the beginning and 183.1MB in the end (delta: 2.2MB). Peak memory consumption was 111.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 143.19ms. Allocated memory is still 253.8MB. Free memory was 183.1MB in the beginning and 147.5MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 220.21ms. Allocated memory is still 253.8MB. Free memory was 147.5MB in the beginning and 108.7MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * RCFGBuilder took 26136.40ms. Allocated memory was 253.8MB in the beginning and 628.1MB in the end (delta: 374.3MB). Free memory was 108.7MB in the beginning and 388.8MB in the end (delta: -280.1MB). Peak memory consumption was 138.8MB. Max. memory is 8.0GB. * TraceAbstraction took 348002.99ms. Allocated memory was 628.1MB in the beginning and 3.1GB in the end (delta: 2.5GB). Free memory was 387.8MB in the beginning and 2.5GB in the end (delta: -2.1GB). Peak memory consumption was 372.8MB. 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 - CounterExampleResult [Line: 292]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L35] msg_t nomsg = (msg_t )-1; [L36] char r1 ; [L37] port_t p1 ; [L38] char p1_old ; [L39] char p1_new ; [L40] char id1 ; [L41] char st1 ; [L42] msg_t send1 ; [L43] _Bool mode1 ; [L44] port_t p2 ; [L45] char p2_old ; [L46] char p2_new ; [L47] char id2 ; [L48] char st2 ; [L49] msg_t send2 ; [L50] _Bool mode2 ; [L51] port_t p3 ; [L52] char p3_old ; [L53] char p3_new ; [L54] char id3 ; [L55] char st3 ; [L56] msg_t send3 ; [L57] _Bool mode3 ; [L308] int inputC = 3; [L309] int inputF = 6; [L310] int inputA = 1; [L311] int inputB = 2; [L312] int inputD = 4; [L313] int inputE = 5; [L316] int a17 = -124; [L317] int a5 = 4; [L318] int a24 = 15; [L319] int a2 = 170; [L320] int a7 = 13; [L5128] COND TRUE __VERIFIER_nondet_int() [L5129] CALL main1() [L239] int c1 ; [L240] int i2 ; [L243] c1 = 0 [L244] r1 = __VERIFIER_nondet_char() [L245] id1 = __VERIFIER_nondet_char() [L246] st1 = __VERIFIER_nondet_char() [L247] send1 = __VERIFIER_nondet_char() [L248] mode1 = __VERIFIER_nondet_bool() [L249] id2 = __VERIFIER_nondet_char() [L250] st2 = __VERIFIER_nondet_char() [L251] send2 = __VERIFIER_nondet_char() [L252] mode2 = __VERIFIER_nondet_bool() [L253] id3 = __VERIFIER_nondet_char() [L254] st3 = __VERIFIER_nondet_char() [L255] send3 = __VERIFIER_nondet_char() [L256] mode3 = __VERIFIER_nondet_bool() [L257] CALL, EXPR init() [L138] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0] [L141] COND TRUE (int )r1 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0] [L142] COND TRUE (int )id1 >= 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0] [L143] COND TRUE (int )st1 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, st1=0] [L144] COND TRUE (int )send1 == (int )id1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, st1=0] [L145] COND TRUE (int )mode1 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, st1=0] [L146] COND TRUE (int )id2 >= 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, st1=0] [L147] COND TRUE (int )st2 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, st1=0, st2=0] [L148] COND TRUE (int )send2 == (int )id2 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, st1=0, st2=0] [L149] COND TRUE (int )mode2 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, st1=0, st2=0] [L150] COND TRUE (int )id3 >= 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, st1=0, st2=0] [L151] COND TRUE (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, st1=0, st2=0, st3=0] [L152] COND TRUE (int )send3 == (int )id3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L153] COND TRUE (int )mode3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L154] COND TRUE (int )id1 != (int )id2 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L155] COND TRUE (int )id1 != (int )id3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L156] COND TRUE (int )id2 != (int )id3 [L157] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0, tmp=1] [L206] return (tmp); [L257] RET, EXPR init() [L257] i2 = init() [L258] COND FALSE !(!(i2)) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=0, i2=1, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L259] p1_old = nomsg [L260] p1_new = nomsg [L261] p2_old = nomsg [L262] p2_new = nomsg [L263] p3_old = nomsg [L264] p3_new = nomsg [L265] i2 = 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=0, i2=0, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L266] COND TRUE i2 < 6 [L268] CALL node1() [L60] msg_t m1 ; [L63] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L64] COND FALSE !(\read(mode1)) [L80] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L81] mode1 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L268] RET node1() [L269] CALL node2() [L88] msg_t m2 ; [L91] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L92] COND FALSE !(\read(mode2)) [L105] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L106] mode2 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=32, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L269] RET node2() [L270] CALL node3() [L113] msg_t m3 ; [L116] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=32, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L117] COND FALSE !(\read(mode3)) [L130] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L131] mode3 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=64, p1_old=-1, p2=0, p2_new=32, p2_old=-1, p3=0, p3_new=0, p3_old=-1, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L270] RET node3() [L271] p1_old = p1_new [L272] p1_new = nomsg [L273] p2_old = p2_new [L274] p2_new = nomsg [L275] p3_old = p3_new [L276] p3_new = nomsg [L277] CALL, EXPR check() [L211] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L215] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L218] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L220] COND TRUE (int )r1 < 3 [L221] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0, tmp=1] [L234] return (tmp); [L277] RET, EXPR check() [L277] c1 = check() [L278] CALL assert(c1) [L290] COND FALSE !(! arg) VAL [\old(arg)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=1, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L278] RET assert(c1) [L279] i2 ++ VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=1, i2=1, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L266] COND TRUE i2 < 6 [L268] CALL node1() [L60] msg_t m1 ; [L63] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=0, r1=0, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L64] COND TRUE \read(mode1) [L65] r1 = (char )((int )r1 + 1) [L66] m1 = p3_old [L67] p3_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L68] COND TRUE (int )m1 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L69] COND FALSE !((int )m1 > (int )id1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=32, send3=0, st1=0, st2=0, st3=0] [L72] COND FALSE !((int )m1 == (int )id1) [L75] send1 = m1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=0, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L78] mode1 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L268] RET node1() [L269] CALL node2() [L88] msg_t m2 ; [L91] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L92] COND TRUE \read(mode2) [L93] m2 = p1_old [L94] p1_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=64, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L95] COND TRUE (int )m2 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=64, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=32, send3=0, st1=0, st2=0, st3=0] [L96] COND TRUE (int )m2 > (int )id2 [L97] send2 = m2 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=64, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L103] mode2 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=64, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L269] RET node2() [L270] CALL node3() [L113] msg_t m3 ; [L116] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=32, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L117] COND TRUE \read(mode3) [L118] m3 = p2_old [L119] p2_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=32, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L120] COND TRUE (int )m3 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=32, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=0, st1=0, st2=0, st3=0] [L121] COND TRUE (int )m3 > (int )id3 [L122] send3 = m3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=32, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L128] mode3 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=32, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L270] RET node3() [L271] p1_old = p1_new [L272] p1_new = nomsg [L273] p2_old = p2_new [L274] p2_new = nomsg [L275] p3_old = p3_new [L276] p3_new = nomsg [L277] CALL, EXPR check() [L211] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L215] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L218] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L220] COND TRUE (int )r1 < 3 [L221] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0, tmp=1] [L234] return (tmp); [L277] RET, EXPR check() [L277] c1 = check() [L278] CALL assert(c1) [L290] COND FALSE !(! arg) VAL [\old(arg)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=1, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L278] RET assert(c1) [L279] i2 ++ VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=1, i2=2, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L266] COND TRUE i2 < 6 [L268] CALL node1() [L60] msg_t m1 ; [L63] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L64] COND FALSE !(\read(mode1)) [L80] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L81] mode1 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L268] RET node1() [L269] CALL node2() [L88] msg_t m2 ; [L91] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L92] COND FALSE !(\read(mode2)) [L105] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L106] mode2 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L269] RET node2() [L270] CALL node3() [L113] msg_t m3 ; [L116] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L117] COND FALSE !(\read(mode3)) [L130] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L131] mode3 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=0, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=32, p3_old=-1, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L270] RET node3() [L271] p1_old = p1_new [L272] p1_new = nomsg [L273] p2_old = p2_new [L274] p2_new = nomsg [L275] p3_old = p3_new [L276] p3_new = nomsg [L277] CALL, EXPR check() [L211] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L215] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L218] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L220] COND TRUE (int )r1 < 3 [L221] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0, tmp=1] [L234] return (tmp); [L277] RET, EXPR check() [L277] c1 = check() [L278] CALL assert(c1) [L290] COND FALSE !(! arg) VAL [\old(arg)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=1, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L278] RET assert(c1) [L279] i2 ++ VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=1, i2=3, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L266] COND TRUE i2 < 6 [L268] CALL node1() [L60] msg_t m1 ; [L63] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=32, r1=1, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L64] COND TRUE \read(mode1) [L65] r1 = (char )((int )r1 + 1) [L66] m1 = p3_old [L67] p3_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L68] COND TRUE (int )m1 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L69] COND FALSE !((int )m1 > (int )id1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=0, send2=64, send3=32, st1=0, st2=0, st3=0] [L72] COND FALSE !((int )m1 == (int )id1) [L75] send1 = m1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=32, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L78] mode1 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=32, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L268] RET node1() [L269] CALL node2() [L88] msg_t m2 ; [L91] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=0, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L92] COND TRUE \read(mode2) [L93] m2 = p1_old [L94] p1_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L95] COND TRUE (int )m2 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L96] COND FALSE !((int )m2 > (int )id2) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L99] COND FALSE !((int )m2 == (int )id2) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=0, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L103] mode2 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=0, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L269] RET node2() [L270] CALL node3() [L113] msg_t m3 ; [L116] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L117] COND TRUE \read(mode3) [L118] m3 = p2_old [L119] p2_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=64, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L120] COND TRUE (int )m3 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=64, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=32, st1=0, st2=0, st3=0] [L121] COND TRUE (int )m3 > (int )id3 [L122] send3 = m3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=64, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L128] mode3 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=64, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L270] RET node3() [L271] p1_old = p1_new [L272] p1_new = nomsg [L273] p2_old = p2_new [L274] p2_new = nomsg [L275] p3_old = p3_new [L276] p3_new = nomsg [L277] CALL, EXPR check() [L211] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L215] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L218] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L220] COND TRUE (int )r1 < 3 [L221] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0, tmp=1] [L234] return (tmp); [L277] RET, EXPR check() [L277] c1 = check() [L278] CALL assert(c1) [L290] COND FALSE !(! arg) VAL [\old(arg)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=1, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L278] RET assert(c1) [L279] i2 ++ VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=1, i2=4, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L266] COND TRUE i2 < 6 [L268] CALL node1() [L60] msg_t m1 ; [L63] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L64] COND FALSE !(\read(mode1)) [L80] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L81] mode1 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L268] RET node1() [L269] CALL node2() [L88] msg_t m2 ; [L91] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L92] COND FALSE !(\read(mode2)) [L105] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L106] mode2 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L269] RET node2() [L270] CALL node3() [L113] msg_t m3 ; [L116] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L117] COND FALSE !(\read(mode3)) [L130] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L131] mode3 = (_Bool)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=32, p1_old=-1, p2=0, p2_new=64, p2_old=-1, p3=0, p3_new=64, p3_old=-1, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L270] RET node3() [L271] p1_old = p1_new [L272] p1_new = nomsg [L273] p2_old = p2_new [L274] p2_new = nomsg [L275] p3_old = p3_new [L276] p3_new = nomsg [L277] CALL, EXPR check() [L211] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L214] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L215] COND FALSE !((int )r1 >= 3) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L218] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L220] COND TRUE (int )r1 < 3 [L221] tmp = 1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0, tmp=1] [L234] return (tmp); [L277] RET, EXPR check() [L277] c1 = check() [L278] CALL assert(c1) [L290] COND FALSE !(! arg) VAL [\old(arg)=1, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=1, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L278] RET assert(c1) [L279] i2 ++ VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, c1=1, i2=5, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L266] COND TRUE i2 < 6 [L268] CALL node1() [L60] msg_t m1 ; [L63] m1 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=-1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=64, r1=2, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L64] COND TRUE \read(mode1) [L65] r1 = (char )((int )r1 + 1) [L66] m1 = p3_old [L67] p3_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L68] COND TRUE (int )m1 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L69] COND FALSE !((int )m1 > (int )id1) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=0, st2=0, st3=0] [L72] COND TRUE (int )m1 == (int )id1 [L73] st1 = (char)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L78] mode1 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m1=64, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L268] RET node1() [L269] CALL node2() [L88] msg_t m2 ; [L91] m2 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=-1, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=32, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L92] COND TRUE \read(mode2) [L93] m2 = p1_old [L94] p1_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=32, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L95] COND TRUE (int )m2 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=32, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L96] COND FALSE !((int )m2 > (int )id2) VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=32, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=0, st3=0] [L99] COND TRUE (int )m2 == (int )id2 [L100] st2 = (char)1 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=32, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L103] mode2 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m2=32, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L269] RET node2() [L270] CALL node3() [L113] msg_t m3 ; [L116] m3 = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=-1, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=64, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L117] COND TRUE \read(mode3) [L118] m3 = p2_old [L119] p2_old = nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=64, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L120] COND TRUE (int )m3 != (int )nomsg VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=64, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L121] COND TRUE (int )m3 > (int )id3 [L122] send3 = m3 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=64, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L128] mode3 = (_Bool)0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, m3=64, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L270] RET node3() [L271] p1_old = p1_new [L272] p1_new = nomsg [L273] p2_old = p2_new [L274] p2_new = nomsg [L275] p3_old = p3_new [L276] p3_new = nomsg [L277] CALL, EXPR check() [L211] int tmp ; VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L214] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L232] tmp = 0 VAL [a17=-124, a24=15, a2=170, a5=4, a7=13, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0, tmp=0] [L234] return (tmp); [L277] RET, EXPR check() [L277] c1 = check() [L278] CALL assert(c1) [L290] COND TRUE ! arg VAL [\old(arg)=0, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=0, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] [L292] reach_error() VAL [\old(arg)=0, a17=-124, a24=15, a2=170, a5=4, a7=13, arg=0, id1=64, id2=32, id3=0, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=32, send2=64, send3=64, st1=1, st2=1, st3=0] - UnprovableResult [Line: 487]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 807 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 347.8s, OverallIterations: 33, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 295.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 174050 SdHoareTripleChecker+Valid, 138.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174050 mSDsluCounter, 271075 SdHoareTripleChecker+Invalid, 119.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 225123 mSDsCounter, 1943 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28853 IncrementalHoareTripleChecker+Invalid, 30796 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1943 mSolverCounterUnsat, 45952 mSDtfsCounter, 28853 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4958 GetRequests, 3636 SyntacticMatches, 1 SemanticMatches, 1321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74950 ImplicationChecksByTransitivity, 157.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61448occurred in iteration=32, InterpolantAutomatonStates: 1095, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.6s AutomataMinimizationTime, 32 MinimizatonAttempts, 15807 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 32.6s InterpolantComputationTime, 2709 NumberOfCodeBlocks, 2445 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4000 ConstructedInterpolants, 807 QuantifiedInterpolants, 48473 SizeOfPredicates, 136 NumberOfNonLiveVariables, 5525 ConjunctsInSsa, 267 ConjunctsInUnsatCore, 47 InterpolantComputations, 17 PerfectInterpolantSequences, 2443/4323 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 proved your program to be incorrect! [2023-12-21 23:43:43,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...