/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/Problem05_label46+token_ring.02.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 07:31:58,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 07:31:58,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 07:31:58,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 07:31:58,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 07:31:59,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 07:31:59,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 07:31:59,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 07:31:59,027 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 07:31:59,030 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 07:31:59,031 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 07:31:59,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 07:31:59,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 07:31:59,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 07:31:59,033 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 07:31:59,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 07:31:59,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 07:31:59,034 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 07:31:59,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 07:31:59,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 07:31:59,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 07:31:59,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 07:31:59,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 07:31:59,036 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 07:31:59,036 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 07:31:59,036 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 07:31:59,036 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 07:31:59,037 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 07:31:59,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 07:31:59,037 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 07:31:59,038 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 07:31:59,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 07:31:59,039 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 07:31:59,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 07:31:59,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 07:31:59,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 07:31:59,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 07:31:59,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 07:31:59,040 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 07:31:59,040 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 07:31:59,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 07:31:59,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 07:31:59,040 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 07:31:59,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 07:31:59,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 07:31:59,041 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 07:31:59,041 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 07:31:59,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 07:31:59,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 07:31:59,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 07:31:59,273 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 07:31:59,274 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 07:31:59,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/Problem05_label46+token_ring.02.cil-2.c [2023-12-16 07:32:00,434 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 07:32:01,009 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 07:32:01,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label46+token_ring.02.cil-2.c [2023-12-16 07:32:01,072 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d549689f1/679ca9d60c6b4bc0a7d345a88476aa88/FLAG13120ad7a [2023-12-16 07:32:01,088 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d549689f1/679ca9d60c6b4bc0a7d345a88476aa88 [2023-12-16 07:32:01,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 07:32:01,092 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 07:32:01,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 07:32:01,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 07:32:01,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 07:32:01,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:32:01" (1/1) ... [2023-12-16 07:32:01,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@182e5850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:32:01, skipping insertion in model container [2023-12-16 07:32:01,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:32:01" (1/1) ... [2023-12-16 07:32:01,295 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 07:32:03,064 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/Problem05_label46+token_ring.02.cil-2.c[382357,382370] [2023-12-16 07:32:03,087 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/Problem05_label46+token_ring.02.cil-2.c[383339,383352] [2023-12-16 07:32:03,212 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 07:32:03,229 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 07:32:04,017 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/Problem05_label46+token_ring.02.cil-2.c[382357,382370] [2023-12-16 07:32:04,021 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/Problem05_label46+token_ring.02.cil-2.c[383339,383352] [2023-12-16 07:32:04,040 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 07:32:04,098 INFO L206 MainTranslator]: Completed translation [2023-12-16 07:32:04,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:32:04 WrapperNode [2023-12-16 07:32:04,099 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 07:32:04,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 07:32:04,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 07:32:04,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 07:32:04,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:32:04" (1/1) ... [2023-12-16 07:32:04,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:32:04" (1/1) ... [2023-12-16 07:32:04,607 INFO L138 Inliner]: procedures = 49, calls = 48, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 12616 [2023-12-16 07:32:04,608 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 07:32:04,609 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 07:32:04,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 07:32:04,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 07:32:04,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:32:04" (1/1) ... [2023-12-16 07:32:04,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:32:04" (1/1) ... [2023-12-16 07:32:04,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:32:04" (1/1) ... [2023-12-16 07:32:04,886 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-16 07:32:04,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:32:04" (1/1) ... [2023-12-16 07:32:04,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:32:04" (1/1) ... [2023-12-16 07:32:05,199 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:32:04" (1/1) ... [2023-12-16 07:32:05,333 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:32:04" (1/1) ... [2023-12-16 07:32:05,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:32:04" (1/1) ... [2023-12-16 07:32:05,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:32:04" (1/1) ... [2023-12-16 07:32:05,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 07:32:05,458 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 07:32:05,458 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 07:32:05,458 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 07:32:05,459 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:32:04" (1/1) ... [2023-12-16 07:32:05,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 07:32:05,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 07:32:05,483 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 07:32:05,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 07:32:05,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 07:32:05,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 07:32:05,543 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-16 07:32:05,544 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-16 07:32:05,544 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-16 07:32:05,544 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-16 07:32:05,544 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-16 07:32:05,544 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-16 07:32:05,544 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-16 07:32:05,544 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-16 07:32:05,544 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-16 07:32:05,544 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-16 07:32:05,544 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-16 07:32:05,544 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-16 07:32:05,545 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-16 07:32:05,545 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-16 07:32:05,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 07:32:05,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 07:32:05,640 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 07:32:05,642 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 07:32:14,708 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 07:32:14,791 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 07:32:14,791 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-16 07:32:14,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:32:14 BoogieIcfgContainer [2023-12-16 07:32:14,793 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 07:32:14,795 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 07:32:14,795 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 07:32:14,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 07:32:14,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:32:01" (1/3) ... [2023-12-16 07:32:14,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac9b3ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:32:14, skipping insertion in model container [2023-12-16 07:32:14,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:32:04" (2/3) ... [2023-12-16 07:32:14,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac9b3ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:32:14, skipping insertion in model container [2023-12-16 07:32:14,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:32:14" (3/3) ... [2023-12-16 07:32:14,800 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.02.cil-2.c [2023-12-16 07:32:14,817 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 07:32:14,820 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-16 07:32:14,900 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 07:32:14,906 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;@5c663cbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 07:32:14,906 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-16 07:32:14,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 2249 states, 2221 states have (on average 1.8860873480414229) internal successors, (4189), 2226 states have internal predecessors, (4189), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 07:32:14,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-16 07:32:14,929 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:14,929 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, 1, 1, 1] [2023-12-16 07:32:14,930 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:14,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:14,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1931990387, now seen corresponding path program 1 times [2023-12-16 07:32:14,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:14,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716269732] [2023-12-16 07:32:14,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:14,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:14,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:14,952 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:32:14,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 07:32:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:32:15,084 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 07:32:15,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:32:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:32:15,200 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:32:15,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:32:15,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716269732] [2023-12-16 07:32:15,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716269732] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:32:15,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:32:15,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 07:32:15,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759998491] [2023-12-16 07:32:15,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:32:15,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 07:32:15,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:32:15,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 07:32:15,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 07:32:15,254 INFO L87 Difference]: Start difference. First operand has 2249 states, 2221 states have (on average 1.8860873480414229) internal successors, (4189), 2226 states have internal predecessors, (4189), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 07:32:15,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:32:15,752 INFO L93 Difference]: Finished difference Result 4615 states and 8643 transitions. [2023-12-16 07:32:15,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 07:32:15,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-12-16 07:32:15,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:32:15,785 INFO L225 Difference]: With dead ends: 4615 [2023-12-16 07:32:15,785 INFO L226 Difference]: Without dead ends: 2368 [2023-12-16 07:32:15,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 07:32:15,801 INFO L413 NwaCegarLoop]: 4096 mSDtfsCounter, 4260 mSDsluCounter, 8246 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4270 SdHoareTripleChecker+Valid, 12342 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 07:32:15,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4270 Valid, 12342 Invalid, 304 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [40 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 07:32:15,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2023-12-16 07:32:15,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2357. [2023-12-16 07:32:15,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 2313 states have (on average 1.8408992650237785) internal successors, (4258), 2317 states have internal predecessors, (4258), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2023-12-16 07:32:15,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 4315 transitions. [2023-12-16 07:32:15,953 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 4315 transitions. Word has length 62 [2023-12-16 07:32:15,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:32:15,954 INFO L495 AbstractCegarLoop]: Abstraction has 2357 states and 4315 transitions. [2023-12-16 07:32:15,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 07:32:15,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 4315 transitions. [2023-12-16 07:32:15,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-16 07:32:15,962 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:15,962 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, 1, 1, 1] [2023-12-16 07:32:15,973 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-16 07:32:16,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:16,174 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:16,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:16,175 INFO L85 PathProgramCache]: Analyzing trace with hash -230609229, now seen corresponding path program 1 times [2023-12-16 07:32:16,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:16,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894170584] [2023-12-16 07:32:16,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:16,176 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:16,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:16,177 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:32:16,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 07:32:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:32:16,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 07:32:16,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:32:16,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-16 07:32:16,317 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:32:16,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:32:16,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894170584] [2023-12-16 07:32:16,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894170584] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:32:16,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:32:16,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 07:32:16,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796947205] [2023-12-16 07:32:16,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:32:16,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 07:32:16,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:32:16,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 07:32:16,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 07:32:16,320 INFO L87 Difference]: Start difference. First operand 2357 states and 4315 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 07:32:16,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:32:16,627 INFO L93 Difference]: Finished difference Result 2585 states and 4666 transitions. [2023-12-16 07:32:16,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 07:32:16,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-12-16 07:32:16,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:32:16,644 INFO L225 Difference]: With dead ends: 2585 [2023-12-16 07:32:16,645 INFO L226 Difference]: Without dead ends: 2357 [2023-12-16 07:32:16,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 07:32:16,650 INFO L413 NwaCegarLoop]: 4072 mSDtfsCounter, 4177 mSDsluCounter, 8088 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4187 SdHoareTripleChecker+Valid, 12160 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 07:32:16,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4187 Valid, 12160 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 07:32:16,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2023-12-16 07:32:16,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 2357. [2023-12-16 07:32:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 2313 states have (on average 1.8378728923476004) internal successors, (4251), 2317 states have internal predecessors, (4251), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2023-12-16 07:32:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 4308 transitions. [2023-12-16 07:32:16,721 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 4308 transitions. Word has length 62 [2023-12-16 07:32:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:32:16,721 INFO L495 AbstractCegarLoop]: Abstraction has 2357 states and 4308 transitions. [2023-12-16 07:32:16,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 07:32:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 4308 transitions. [2023-12-16 07:32:16,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-16 07:32:16,724 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:16,724 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, 1, 1, 1] [2023-12-16 07:32:16,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 07:32:16,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:16,934 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:16,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:16,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1777839475, now seen corresponding path program 1 times [2023-12-16 07:32:16,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:16,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [482853553] [2023-12-16 07:32:16,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:16,936 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:16,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:16,937 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:32:16,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 07:32:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:32:17,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 07:32:17,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:32:17,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:32:17,058 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:32:17,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:32:17,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [482853553] [2023-12-16 07:32:17,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [482853553] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:32:17,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:32:17,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 07:32:17,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746193430] [2023-12-16 07:32:17,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:32:17,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 07:32:17,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:32:17,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 07:32:17,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 07:32:17,061 INFO L87 Difference]: Start difference. First operand 2357 states and 4308 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 07:32:17,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:32:17,401 INFO L93 Difference]: Finished difference Result 2585 states and 4652 transitions. [2023-12-16 07:32:17,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 07:32:17,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-12-16 07:32:17,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:32:17,412 INFO L225 Difference]: With dead ends: 2585 [2023-12-16 07:32:17,413 INFO L226 Difference]: Without dead ends: 2357 [2023-12-16 07:32:17,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 07:32:17,417 INFO L413 NwaCegarLoop]: 4069 mSDtfsCounter, 4171 mSDsluCounter, 8084 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4181 SdHoareTripleChecker+Valid, 12153 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 07:32:17,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4181 Valid, 12153 Invalid, 208 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 07:32:17,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2023-12-16 07:32:17,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 2357. [2023-12-16 07:32:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 2313 states have (on average 1.8348465196714223) internal successors, (4244), 2317 states have internal predecessors, (4244), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2023-12-16 07:32:17,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 4301 transitions. [2023-12-16 07:32:17,483 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 4301 transitions. Word has length 62 [2023-12-16 07:32:17,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:32:17,483 INFO L495 AbstractCegarLoop]: Abstraction has 2357 states and 4301 transitions. [2023-12-16 07:32:17,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 07:32:17,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 4301 transitions. [2023-12-16 07:32:17,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-16 07:32:17,485 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:17,485 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, 1, 1, 1] [2023-12-16 07:32:17,494 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-16 07:32:17,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:17,689 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:17,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:17,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1762320757, now seen corresponding path program 1 times [2023-12-16 07:32:17,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:17,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1755831734] [2023-12-16 07:32:17,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:17,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-16 07:32:17,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:17,692 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:32:17,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 07:32:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:32:17,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 07:32:17,761 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:32:17,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:32:17,818 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:32:17,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:32:17,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1755831734] [2023-12-16 07:32:17,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1755831734] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:32:17,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:32:17,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 07:32:17,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244300149] [2023-12-16 07:32:17,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:32:17,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 07:32:17,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:32:17,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 07:32:17,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 07:32:17,825 INFO L87 Difference]: Start difference. First operand 2357 states and 4301 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 07:32:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:32:18,141 INFO L93 Difference]: Finished difference Result 2631 states and 4710 transitions. [2023-12-16 07:32:18,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 07:32:18,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-12-16 07:32:18,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:32:18,152 INFO L225 Difference]: With dead ends: 2631 [2023-12-16 07:32:18,152 INFO L226 Difference]: Without dead ends: 2403 [2023-12-16 07:32:18,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 07:32:18,155 INFO L413 NwaCegarLoop]: 4067 mSDtfsCounter, 4188 mSDsluCounter, 8080 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4198 SdHoareTripleChecker+Valid, 12147 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 07:32:18,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4198 Valid, 12147 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 07:32:18,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2023-12-16 07:32:18,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 2403. [2023-12-16 07:32:18,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2403 states, 2353 states have (on average 1.8244793880152996) internal successors, (4293), 2357 states have internal predecessors, (4293), 31 states have call successors, (31), 17 states have call predecessors, (31), 17 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2023-12-16 07:32:18,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2403 states and 4354 transitions. [2023-12-16 07:32:18,225 INFO L78 Accepts]: Start accepts. Automaton has 2403 states and 4354 transitions. Word has length 62 [2023-12-16 07:32:18,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:32:18,227 INFO L495 AbstractCegarLoop]: Abstraction has 2403 states and 4354 transitions. [2023-12-16 07:32:18,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 07:32:18,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 4354 transitions. [2023-12-16 07:32:18,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-16 07:32:18,229 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:18,229 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, 1, 1, 1] [2023-12-16 07:32:18,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 07:32:18,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:18,433 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:18,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:18,434 INFO L85 PathProgramCache]: Analyzing trace with hash 591583925, now seen corresponding path program 1 times [2023-12-16 07:32:18,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:18,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1599739841] [2023-12-16 07:32:18,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:18,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:18,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:18,436 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:32:18,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 07:32:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:32:18,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 07:32:18,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:32:18,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:32:18,533 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:32:18,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:32:18,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1599739841] [2023-12-16 07:32:18,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1599739841] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:32:18,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:32:18,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 07:32:18,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659922716] [2023-12-16 07:32:18,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:32:18,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 07:32:18,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:32:18,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 07:32:18,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 07:32:18,536 INFO L87 Difference]: Start difference. First operand 2403 states and 4354 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 07:32:18,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:32:18,832 INFO L93 Difference]: Finished difference Result 2723 states and 4816 transitions. [2023-12-16 07:32:18,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 07:32:18,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2023-12-16 07:32:18,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:32:18,844 INFO L225 Difference]: With dead ends: 2723 [2023-12-16 07:32:18,844 INFO L226 Difference]: Without dead ends: 2449 [2023-12-16 07:32:18,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 07:32:18,846 INFO L413 NwaCegarLoop]: 4064 mSDtfsCounter, 4182 mSDsluCounter, 8076 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4192 SdHoareTripleChecker+Valid, 12140 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 07:32:18,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4192 Valid, 12140 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 07:32:18,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2449 states. [2023-12-16 07:32:18,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2449 to 2449. [2023-12-16 07:32:18,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2449 states, 2393 states have (on average 1.8127872962808191) internal successors, (4338), 2397 states have internal predecessors, (4338), 33 states have call successors, (33), 21 states have call predecessors, (33), 21 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2023-12-16 07:32:18,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2449 states and 4403 transitions. [2023-12-16 07:32:18,941 INFO L78 Accepts]: Start accepts. Automaton has 2449 states and 4403 transitions. Word has length 62 [2023-12-16 07:32:18,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:32:18,941 INFO L495 AbstractCegarLoop]: Abstraction has 2449 states and 4403 transitions. [2023-12-16 07:32:18,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 07:32:18,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 4403 transitions. [2023-12-16 07:32:18,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-16 07:32:18,942 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:18,942 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, 1, 1, 1] [2023-12-16 07:32:18,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 07:32:19,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:19,146 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:19,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:19,147 INFO L85 PathProgramCache]: Analyzing trace with hash -940558090, now seen corresponding path program 1 times [2023-12-16 07:32:19,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:19,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029618765] [2023-12-16 07:32:19,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:19,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:19,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:19,149 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:32:19,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 07:32:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:32:19,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:32:19,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:32:19,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:32:19,291 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:32:19,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:32:19,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029618765] [2023-12-16 07:32:19,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029618765] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:32:19,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:32:19,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 07:32:19,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451950400] [2023-12-16 07:32:19,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:32:19,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:32:19,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:32:19,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:32:19,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:32:19,295 INFO L87 Difference]: Start difference. First operand 2449 states and 4403 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 07:32:19,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:32:19,401 INFO L93 Difference]: Finished difference Result 3060 states and 5232 transitions. [2023-12-16 07:32:19,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:32:19,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2023-12-16 07:32:19,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:32:19,418 INFO L225 Difference]: With dead ends: 3060 [2023-12-16 07:32:19,418 INFO L226 Difference]: Without dead ends: 2741 [2023-12-16 07:32:19,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:32:19,425 INFO L413 NwaCegarLoop]: 4151 mSDtfsCounter, 4054 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4054 SdHoareTripleChecker+Valid, 4289 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:32:19,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4054 Valid, 4289 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:32:19,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2023-12-16 07:32:19,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 2739. [2023-12-16 07:32:19,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2739 states, 2635 states have (on average 1.7669829222011386) internal successors, (4656), 2642 states have internal predecessors, (4656), 60 states have call successors, (60), 41 states have call predecessors, (60), 42 states have return successors, (60), 56 states have call predecessors, (60), 58 states have call successors, (60) [2023-12-16 07:32:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2739 states to 2739 states and 4776 transitions. [2023-12-16 07:32:19,509 INFO L78 Accepts]: Start accepts. Automaton has 2739 states and 4776 transitions. Word has length 62 [2023-12-16 07:32:19,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:32:19,510 INFO L495 AbstractCegarLoop]: Abstraction has 2739 states and 4776 transitions. [2023-12-16 07:32:19,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 07:32:19,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2739 states and 4776 transitions. [2023-12-16 07:32:19,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-16 07:32:19,511 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:19,512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 07:32:19,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 07:32:19,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:19,716 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:19,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:19,717 INFO L85 PathProgramCache]: Analyzing trace with hash 2039621340, now seen corresponding path program 1 times [2023-12-16 07:32:19,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:19,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50804857] [2023-12-16 07:32:19,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:19,717 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:19,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:19,718 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:32:19,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 07:32:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:32:19,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 07:32:19,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:32:19,817 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-16 07:32:19,818 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:32:19,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:32:19,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [50804857] [2023-12-16 07:32:19,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [50804857] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:32:19,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:32:19,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 07:32:19,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67544394] [2023-12-16 07:32:19,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:32:19,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 07:32:19,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:32:19,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 07:32:19,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 07:32:19,820 INFO L87 Difference]: Start difference. First operand 2739 states and 4776 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 07:32:19,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:32:19,942 INFO L93 Difference]: Finished difference Result 3444 states and 5743 transitions. [2023-12-16 07:32:19,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 07:32:19,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 100 [2023-12-16 07:32:19,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:32:19,956 INFO L225 Difference]: With dead ends: 3444 [2023-12-16 07:32:19,956 INFO L226 Difference]: Without dead ends: 2835 [2023-12-16 07:32:19,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 97 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-16 07:32:19,959 INFO L413 NwaCegarLoop]: 4119 mSDtfsCounter, 20 mSDsluCounter, 8233 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 12352 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:32:19,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 12352 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:32:19,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2023-12-16 07:32:20,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2751. [2023-12-16 07:32:20,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2751 states, 2647 states have (on average 1.7612391386475255) internal successors, (4662), 2654 states have internal predecessors, (4662), 60 states have call successors, (60), 41 states have call predecessors, (60), 42 states have return successors, (60), 56 states have call predecessors, (60), 58 states have call successors, (60) [2023-12-16 07:32:20,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2751 states and 4782 transitions. [2023-12-16 07:32:20,073 INFO L78 Accepts]: Start accepts. Automaton has 2751 states and 4782 transitions. Word has length 100 [2023-12-16 07:32:20,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:32:20,074 INFO L495 AbstractCegarLoop]: Abstraction has 2751 states and 4782 transitions. [2023-12-16 07:32:20,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 07:32:20,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2751 states and 4782 transitions. [2023-12-16 07:32:20,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-16 07:32:20,076 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:20,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 07:32:20,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 07:32:20,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:20,281 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:20,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:20,282 INFO L85 PathProgramCache]: Analyzing trace with hash -881721060, now seen corresponding path program 1 times [2023-12-16 07:32:20,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:20,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [620219243] [2023-12-16 07:32:20,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:20,283 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:20,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:20,284 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:32:20,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 07:32:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:32:20,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 07:32:20,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:32:20,376 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-16 07:32:20,376 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:32:20,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:32:20,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [620219243] [2023-12-16 07:32:20,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [620219243] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:32:20,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:32:20,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 07:32:20,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502234960] [2023-12-16 07:32:20,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:32:20,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 07:32:20,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:32:20,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 07:32:20,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 07:32:20,379 INFO L87 Difference]: Start difference. First operand 2751 states and 4782 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 07:32:20,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:32:20,486 INFO L93 Difference]: Finished difference Result 3412 states and 5674 transitions. [2023-12-16 07:32:20,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 07:32:20,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 100 [2023-12-16 07:32:20,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:32:20,500 INFO L225 Difference]: With dead ends: 3412 [2023-12-16 07:32:20,501 INFO L226 Difference]: Without dead ends: 2791 [2023-12-16 07:32:20,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 97 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-16 07:32:20,505 INFO L413 NwaCegarLoop]: 4117 mSDtfsCounter, 11 mSDsluCounter, 8228 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12345 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:32:20,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 12345 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:32:20,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2791 states. [2023-12-16 07:32:20,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2791 to 2759. [2023-12-16 07:32:20,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2759 states, 2655 states have (on average 1.7559322033898306) internal successors, (4662), 2662 states have internal predecessors, (4662), 60 states have call successors, (60), 41 states have call predecessors, (60), 42 states have return successors, (60), 56 states have call predecessors, (60), 58 states have call successors, (60) [2023-12-16 07:32:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2759 states to 2759 states and 4782 transitions. [2023-12-16 07:32:20,584 INFO L78 Accepts]: Start accepts. Automaton has 2759 states and 4782 transitions. Word has length 100 [2023-12-16 07:32:20,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:32:20,585 INFO L495 AbstractCegarLoop]: Abstraction has 2759 states and 4782 transitions. [2023-12-16 07:32:20,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 07:32:20,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2759 states and 4782 transitions. [2023-12-16 07:32:20,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-16 07:32:20,586 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:20,586 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 07:32:20,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 07:32:20,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:20,792 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:20,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:20,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1826439460, now seen corresponding path program 1 times [2023-12-16 07:32:20,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:20,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576716557] [2023-12-16 07:32:20,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:20,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:20,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:20,795 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:32:20,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 07:32:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:32:20,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 07:32:20,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:32:20,880 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-16 07:32:20,881 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:32:20,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:32:20,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576716557] [2023-12-16 07:32:20,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576716557] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:32:20,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:32:20,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 07:32:20,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163648551] [2023-12-16 07:32:20,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:32:20,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 07:32:20,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:32:20,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 07:32:20,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 07:32:20,883 INFO L87 Difference]: Start difference. First operand 2759 states and 4782 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 07:32:21,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:32:21,087 INFO L93 Difference]: Finished difference Result 3404 states and 5642 transitions. [2023-12-16 07:32:21,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 07:32:21,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 100 [2023-12-16 07:32:21,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:32:21,115 INFO L225 Difference]: With dead ends: 3404 [2023-12-16 07:32:21,115 INFO L226 Difference]: Without dead ends: 2775 [2023-12-16 07:32:21,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 97 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-16 07:32:21,120 INFO L413 NwaCegarLoop]: 4117 mSDtfsCounter, 2 mSDsluCounter, 8229 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 12346 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:32:21,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 12346 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:32:21,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2775 states. [2023-12-16 07:32:21,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2775 to 2767. [2023-12-16 07:32:21,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2767 states, 2663 states have (on average 1.750657153586181) internal successors, (4662), 2670 states have internal predecessors, (4662), 60 states have call successors, (60), 41 states have call predecessors, (60), 42 states have return successors, (60), 56 states have call predecessors, (60), 58 states have call successors, (60) [2023-12-16 07:32:21,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2767 states to 2767 states and 4782 transitions. [2023-12-16 07:32:21,210 INFO L78 Accepts]: Start accepts. Automaton has 2767 states and 4782 transitions. Word has length 100 [2023-12-16 07:32:21,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:32:21,211 INFO L495 AbstractCegarLoop]: Abstraction has 2767 states and 4782 transitions. [2023-12-16 07:32:21,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 07:32:21,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2767 states and 4782 transitions. [2023-12-16 07:32:21,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-16 07:32:21,212 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:21,213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 07:32:21,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 07:32:21,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:21,419 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:21,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:21,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1877109020, now seen corresponding path program 1 times [2023-12-16 07:32:21,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:21,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736649953] [2023-12-16 07:32:21,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:21,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:21,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:21,422 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-16 07:32:21,426 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-16 07:32:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:32:21,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 07:32:21,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:32:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-16 07:32:21,604 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:32:21,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:32:21,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736649953] [2023-12-16 07:32:21,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736649953] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:32:21,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:32:21,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 07:32:21,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693567206] [2023-12-16 07:32:21,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:32:21,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 07:32:21,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:32:21,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 07:32:21,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 07:32:21,606 INFO L87 Difference]: Start difference. First operand 2767 states and 4782 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 07:32:21,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:32:21,948 INFO L93 Difference]: Finished difference Result 3507 states and 5726 transitions. [2023-12-16 07:32:21,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 07:32:21,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 100 [2023-12-16 07:32:21,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:32:21,956 INFO L225 Difference]: With dead ends: 3507 [2023-12-16 07:32:21,957 INFO L226 Difference]: Without dead ends: 2869 [2023-12-16 07:32:21,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 07:32:21,960 INFO L413 NwaCegarLoop]: 4062 mSDtfsCounter, 4169 mSDsluCounter, 8072 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4178 SdHoareTripleChecker+Valid, 12134 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 07:32:21,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4178 Valid, 12134 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 07:32:21,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2869 states. [2023-12-16 07:32:22,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2869 to 2837. [2023-12-16 07:32:22,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2837 states, 2729 states have (on average 1.7281055331623305) internal successors, (4716), 2736 states have internal predecessors, (4716), 60 states have call successors, (60), 45 states have call predecessors, (60), 46 states have return successors, (60), 56 states have call predecessors, (60), 58 states have call successors, (60) [2023-12-16 07:32:22,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2837 states to 2837 states and 4836 transitions. [2023-12-16 07:32:22,055 INFO L78 Accepts]: Start accepts. Automaton has 2837 states and 4836 transitions. Word has length 100 [2023-12-16 07:32:22,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:32:22,055 INFO L495 AbstractCegarLoop]: Abstraction has 2837 states and 4836 transitions. [2023-12-16 07:32:22,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 07:32:22,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2837 states and 4836 transitions. [2023-12-16 07:32:22,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-16 07:32:22,057 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:22,057 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 07:32:22,064 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-16 07:32:22,261 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-16 07:32:22,262 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:22,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:22,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1857158498, now seen corresponding path program 1 times [2023-12-16 07:32:22,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:22,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614953583] [2023-12-16 07:32:22,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:22,263 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:22,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:22,264 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-16 07:32:22,265 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-16 07:32:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:32:22,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 07:32:22,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:32:22,478 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-16 07:32:22,478 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:32:22,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:32:22,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614953583] [2023-12-16 07:32:22,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1614953583] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:32:22,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:32:22,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 07:32:22,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777576454] [2023-12-16 07:32:22,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:32:22,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 07:32:22,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:32:22,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 07:32:22,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 07:32:22,480 INFO L87 Difference]: Start difference. First operand 2837 states and 4836 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-16 07:32:22,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:32:22,783 INFO L93 Difference]: Finished difference Result 4164 states and 6471 transitions. [2023-12-16 07:32:22,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 07:32:22,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 100 [2023-12-16 07:32:22,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:32:22,792 INFO L225 Difference]: With dead ends: 4164 [2023-12-16 07:32:22,792 INFO L226 Difference]: Without dead ends: 3458 [2023-12-16 07:32:22,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 07:32:22,795 INFO L413 NwaCegarLoop]: 4139 mSDtfsCounter, 4135 mSDsluCounter, 4180 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4139 SdHoareTripleChecker+Valid, 8319 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 07:32:22,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4139 Valid, 8319 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 07:32:22,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3458 states. [2023-12-16 07:32:22,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3458 to 3454. [2023-12-16 07:32:22,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3454 states, 3251 states have (on average 1.6447247000922793) internal successors, (5347), 3267 states have internal predecessors, (5347), 109 states have call successors, (109), 81 states have call predecessors, (109), 92 states have return successors, (131), 107 states have call predecessors, (131), 107 states have call successors, (131) [2023-12-16 07:32:22,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 5587 transitions. [2023-12-16 07:32:22,933 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 5587 transitions. Word has length 100 [2023-12-16 07:32:22,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:32:22,934 INFO L495 AbstractCegarLoop]: Abstraction has 3454 states and 5587 transitions. [2023-12-16 07:32:22,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-16 07:32:22,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 5587 transitions. [2023-12-16 07:32:22,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-16 07:32:22,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:22,936 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 07:32:22,944 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-16 07:32:23,144 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-16 07:32:23,145 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:23,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:23,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1554299808, now seen corresponding path program 1 times [2023-12-16 07:32:23,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:23,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254880316] [2023-12-16 07:32:23,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:23,146 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:23,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:23,147 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-16 07:32:23,148 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-16 07:32:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:32:23,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:32:23,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:32:23,249 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 07:32:23,249 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:32:23,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:32:23,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254880316] [2023-12-16 07:32:23,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1254880316] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:32:23,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:32:23,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:32:23,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989241956] [2023-12-16 07:32:23,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:32:23,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:32:23,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:32:23,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:32:23,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:32:23,251 INFO L87 Difference]: Start difference. First operand 3454 states and 5587 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 07:32:23,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:32:23,387 INFO L93 Difference]: Finished difference Result 4772 states and 7190 transitions. [2023-12-16 07:32:23,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:32:23,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 100 [2023-12-16 07:32:23,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:32:23,395 INFO L225 Difference]: With dead ends: 4772 [2023-12-16 07:32:23,395 INFO L226 Difference]: Without dead ends: 3449 [2023-12-16 07:32:23,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:32:23,399 INFO L413 NwaCegarLoop]: 4113 mSDtfsCounter, 164 mSDsluCounter, 3957 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 8070 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:32:23,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 8070 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:32:23,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3449 states. [2023-12-16 07:32:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3449 to 3449. [2023-12-16 07:32:23,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3449 states, 3249 states have (on average 1.6445060018467221) internal successors, (5343), 3264 states have internal predecessors, (5343), 106 states have call successors, (106), 81 states have call predecessors, (106), 92 states have return successors, (128), 104 states have call predecessors, (128), 104 states have call successors, (128) [2023-12-16 07:32:23,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 5577 transitions. [2023-12-16 07:32:23,542 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 5577 transitions. Word has length 100 [2023-12-16 07:32:23,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:32:23,543 INFO L495 AbstractCegarLoop]: Abstraction has 3449 states and 5577 transitions. [2023-12-16 07:32:23,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 07:32:23,543 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 5577 transitions. [2023-12-16 07:32:23,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-16 07:32:23,545 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:23,546 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 07:32:23,552 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-16 07:32:23,749 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-16 07:32:23,750 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:23,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:23,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1830740551, now seen corresponding path program 1 times [2023-12-16 07:32:23,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:23,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642808652] [2023-12-16 07:32:23,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:23,751 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:23,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:23,753 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-16 07:32:23,755 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-16 07:32:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:32:23,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 07:32:23,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:32:23,935 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-16 07:32:23,935 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:32:23,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:32:23,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642808652] [2023-12-16 07:32:23,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642808652] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:32:23,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:32:23,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 07:32:23,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798041764] [2023-12-16 07:32:23,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:32:23,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 07:32:23,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:32:23,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 07:32:23,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 07:32:23,937 INFO L87 Difference]: Start difference. First operand 3449 states and 5577 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-16 07:32:24,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:32:24,259 INFO L93 Difference]: Finished difference Result 5861 states and 8534 transitions. [2023-12-16 07:32:24,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 07:32:24,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 102 [2023-12-16 07:32:24,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:32:24,271 INFO L225 Difference]: With dead ends: 5861 [2023-12-16 07:32:24,271 INFO L226 Difference]: Without dead ends: 4543 [2023-12-16 07:32:24,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 07:32:24,277 INFO L413 NwaCegarLoop]: 4122 mSDtfsCounter, 4130 mSDsluCounter, 4162 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4135 SdHoareTripleChecker+Valid, 8284 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 07:32:24,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4135 Valid, 8284 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 07:32:24,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4543 states. [2023-12-16 07:32:24,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4543 to 4539. [2023-12-16 07:32:24,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4539 states, 4168 states have (on average 1.5479846449136276) internal successors, (6452), 4200 states have internal predecessors, (6452), 193 states have call successors, (193), 145 states have call predecessors, (193), 176 states have return successors, (259), 195 states have call predecessors, (259), 191 states have call successors, (259) [2023-12-16 07:32:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4539 states to 4539 states and 6904 transitions. [2023-12-16 07:32:24,443 INFO L78 Accepts]: Start accepts. Automaton has 4539 states and 6904 transitions. Word has length 102 [2023-12-16 07:32:24,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:32:24,443 INFO L495 AbstractCegarLoop]: Abstraction has 4539 states and 6904 transitions. [2023-12-16 07:32:24,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-16 07:32:24,443 INFO L276 IsEmpty]: Start isEmpty. Operand 4539 states and 6904 transitions. [2023-12-16 07:32:24,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-16 07:32:24,445 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:24,445 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 07:32:24,455 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-16 07:32:24,650 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-16 07:32:24,650 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:24,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:24,650 INFO L85 PathProgramCache]: Analyzing trace with hash 845251831, now seen corresponding path program 1 times [2023-12-16 07:32:24,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:24,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533825322] [2023-12-16 07:32:24,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:24,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:24,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:24,653 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-16 07:32:24,653 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-16 07:32:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:32:24,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:32:24,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:32:24,729 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 07:32:24,729 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:32:24,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:32:24,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533825322] [2023-12-16 07:32:24,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1533825322] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:32:24,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:32:24,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:32:24,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401511952] [2023-12-16 07:32:24,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:32:24,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:32:24,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:32:24,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:32:24,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:32:24,731 INFO L87 Difference]: Start difference. First operand 4539 states and 6904 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 07:32:24,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:32:24,932 INFO L93 Difference]: Finished difference Result 6943 states and 9827 transitions. [2023-12-16 07:32:24,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:32:24,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 102 [2023-12-16 07:32:24,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:32:24,944 INFO L225 Difference]: With dead ends: 6943 [2023-12-16 07:32:24,944 INFO L226 Difference]: Without dead ends: 4535 [2023-12-16 07:32:24,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:32:24,951 INFO L413 NwaCegarLoop]: 4112 mSDtfsCounter, 162 mSDsluCounter, 3957 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 8069 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:32:24,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 8069 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:32:24,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4535 states. [2023-12-16 07:32:25,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4535 to 4535. [2023-12-16 07:32:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4535 states, 4167 states have (on average 1.5478761699064074) internal successors, (6450), 4198 states have internal predecessors, (6450), 190 states have call successors, (190), 145 states have call predecessors, (190), 176 states have return successors, (256), 192 states have call predecessors, (256), 188 states have call successors, (256) [2023-12-16 07:32:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4535 states to 4535 states and 6896 transitions. [2023-12-16 07:32:25,124 INFO L78 Accepts]: Start accepts. Automaton has 4535 states and 6896 transitions. Word has length 102 [2023-12-16 07:32:25,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:32:25,124 INFO L495 AbstractCegarLoop]: Abstraction has 4535 states and 6896 transitions. [2023-12-16 07:32:25,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 07:32:25,124 INFO L276 IsEmpty]: Start isEmpty. Operand 4535 states and 6896 transitions. [2023-12-16 07:32:25,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-16 07:32:25,127 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:25,127 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 07:32:25,135 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-16 07:32:25,332 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-16 07:32:25,332 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:25,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:25,333 INFO L85 PathProgramCache]: Analyzing trace with hash 497984990, now seen corresponding path program 1 times [2023-12-16 07:32:25,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:25,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639970739] [2023-12-16 07:32:25,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:25,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-16 07:32:25,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:25,334 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-16 07:32:25,366 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-16 07:32:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:32:25,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:32:25,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:32:25,441 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-16 07:32:25,442 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:32:25,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:32:25,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639970739] [2023-12-16 07:32:25,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639970739] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:32:25,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:32:25,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:32:25,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262326894] [2023-12-16 07:32:25,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:32:25,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:32:25,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:32:25,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:32:25,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:32:25,443 INFO L87 Difference]: Start difference. First operand 4535 states and 6896 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 07:32:25,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:32:25,665 INFO L93 Difference]: Finished difference Result 8729 states and 12028 transitions. [2023-12-16 07:32:25,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:32:25,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 104 [2023-12-16 07:32:25,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:32:25,678 INFO L225 Difference]: With dead ends: 8729 [2023-12-16 07:32:25,679 INFO L226 Difference]: Without dead ends: 5443 [2023-12-16 07:32:25,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:32:25,686 INFO L413 NwaCegarLoop]: 4226 mSDtfsCounter, 122 mSDsluCounter, 4105 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 8331 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:32:25,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 8331 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:32:25,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5443 states. [2023-12-16 07:32:25,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5443 to 5443. [2023-12-16 07:32:25,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5443 states, 4935 states have (on average 1.4903748733535969) internal successors, (7355), 4972 states have internal predecessors, (7355), 266 states have call successors, (266), 201 states have call predecessors, (266), 240 states have return successors, (366), 270 states have call predecessors, (366), 264 states have call successors, (366) [2023-12-16 07:32:25,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5443 states to 5443 states and 7987 transitions. [2023-12-16 07:32:25,898 INFO L78 Accepts]: Start accepts. Automaton has 5443 states and 7987 transitions. Word has length 104 [2023-12-16 07:32:25,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:32:25,898 INFO L495 AbstractCegarLoop]: Abstraction has 5443 states and 7987 transitions. [2023-12-16 07:32:25,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 07:32:25,898 INFO L276 IsEmpty]: Start isEmpty. Operand 5443 states and 7987 transitions. [2023-12-16 07:32:25,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-16 07:32:25,901 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:25,902 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 07:32:25,912 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 (16)] Forceful destruction successful, exit code 0 [2023-12-16 07:32:26,112 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-16 07:32:26,113 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:26,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:26,113 INFO L85 PathProgramCache]: Analyzing trace with hash -490348704, now seen corresponding path program 1 times [2023-12-16 07:32:26,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:26,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126802151] [2023-12-16 07:32:26,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:26,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:26,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:26,115 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-16 07:32:26,146 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-16 07:32:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:32:26,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:32:26,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:32:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-16 07:32:26,316 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:32:26,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:32:26,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126802151] [2023-12-16 07:32:26,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [126802151] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:32:26,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:32:26,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 07:32:26,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473843443] [2023-12-16 07:32:26,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:32:26,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:32:26,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:32:26,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:32:26,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:32:26,318 INFO L87 Difference]: Start difference. First operand 5443 states and 7987 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-16 07:32:26,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:32:26,589 INFO L93 Difference]: Finished difference Result 9664 states and 13109 transitions. [2023-12-16 07:32:26,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:32:26,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 130 [2023-12-16 07:32:26,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:32:26,607 INFO L225 Difference]: With dead ends: 9664 [2023-12-16 07:32:26,607 INFO L226 Difference]: Without dead ends: 6351 [2023-12-16 07:32:26,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:32:26,615 INFO L413 NwaCegarLoop]: 4112 mSDtfsCounter, 4020 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4020 SdHoareTripleChecker+Valid, 4249 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:32:26,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4020 Valid, 4249 Invalid, 34 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:32:26,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6351 states. [2023-12-16 07:32:26,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6351 to 6339. [2023-12-16 07:32:26,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6339 states, 5691 states have (on average 1.4438587243015288) internal successors, (8217), 5734 states have internal predecessors, (8217), 342 states have call successors, (342), 257 states have call predecessors, (342), 304 states have return successors, (462), 348 states have call predecessors, (462), 340 states have call successors, (462) [2023-12-16 07:32:26,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6339 states to 6339 states and 9021 transitions. [2023-12-16 07:32:26,886 INFO L78 Accepts]: Start accepts. Automaton has 6339 states and 9021 transitions. Word has length 130 [2023-12-16 07:32:26,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:32:26,886 INFO L495 AbstractCegarLoop]: Abstraction has 6339 states and 9021 transitions. [2023-12-16 07:32:26,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-16 07:32:26,887 INFO L276 IsEmpty]: Start isEmpty. Operand 6339 states and 9021 transitions. [2023-12-16 07:32:26,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-16 07:32:26,893 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:26,893 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 07:32:26,901 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-16 07:32:27,098 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-16 07:32:27,099 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:27,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:27,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1106268115, now seen corresponding path program 1 times [2023-12-16 07:32:27,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:27,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715082598] [2023-12-16 07:32:27,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:27,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:27,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:27,101 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-16 07:32:27,103 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-16 07:32:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:32:27,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 07:32:27,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:32:27,267 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-16 07:32:27,267 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:32:27,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:32:27,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715082598] [2023-12-16 07:32:27,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715082598] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:32:27,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:32:27,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 07:32:27,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217825297] [2023-12-16 07:32:27,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:32:27,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 07:32:27,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:32:27,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 07:32:27,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 07:32:27,269 INFO L87 Difference]: Start difference. First operand 6339 states and 9021 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-16 07:32:27,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:32:27,684 INFO L93 Difference]: Finished difference Result 10581 states and 14150 transitions. [2023-12-16 07:32:27,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 07:32:27,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 148 [2023-12-16 07:32:27,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:32:27,706 INFO L225 Difference]: With dead ends: 10581 [2023-12-16 07:32:27,706 INFO L226 Difference]: Without dead ends: 6373 [2023-12-16 07:32:27,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 07:32:27,717 INFO L413 NwaCegarLoop]: 4079 mSDtfsCounter, 4126 mSDsluCounter, 4134 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4132 SdHoareTripleChecker+Valid, 8213 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 07:32:27,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4132 Valid, 8213 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 07:32:27,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6373 states. [2023-12-16 07:32:28,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6373 to 6373. [2023-12-16 07:32:28,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6373 states, 5717 states have (on average 1.4337939478747594) internal successors, (8197), 5764 states have internal predecessors, (8197), 342 states have call successors, (342), 257 states have call predecessors, (342), 312 states have return successors, (420), 352 states have call predecessors, (420), 340 states have call successors, (420) [2023-12-16 07:32:28,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6373 states to 6373 states and 8959 transitions. [2023-12-16 07:32:28,110 INFO L78 Accepts]: Start accepts. Automaton has 6373 states and 8959 transitions. Word has length 148 [2023-12-16 07:32:28,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:32:28,111 INFO L495 AbstractCegarLoop]: Abstraction has 6373 states and 8959 transitions. [2023-12-16 07:32:28,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-16 07:32:28,111 INFO L276 IsEmpty]: Start isEmpty. Operand 6373 states and 8959 transitions. [2023-12-16 07:32:28,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-16 07:32:28,115 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:28,115 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 07:32:28,119 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-16 07:32:28,319 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-16 07:32:28,320 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:28,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:28,321 INFO L85 PathProgramCache]: Analyzing trace with hash -465172165, now seen corresponding path program 1 times [2023-12-16 07:32:28,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:28,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129772235] [2023-12-16 07:32:28,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:28,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:28,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:28,322 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-16 07:32:28,353 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-16 07:32:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:32:28,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:32:28,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:32:28,444 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-16 07:32:28,444 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:32:28,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:32:28,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129772235] [2023-12-16 07:32:28,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129772235] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:32:28,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:32:28,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:32:28,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384904405] [2023-12-16 07:32:28,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:32:28,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:32:28,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:32:28,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:32:28,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:32:28,448 INFO L87 Difference]: Start difference. First operand 6373 states and 8959 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-16 07:32:28,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:32:28,708 INFO L93 Difference]: Finished difference Result 9729 states and 12937 transitions. [2023-12-16 07:32:28,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:32:28,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 149 [2023-12-16 07:32:28,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:32:28,725 INFO L225 Difference]: With dead ends: 9729 [2023-12-16 07:32:28,725 INFO L226 Difference]: Without dead ends: 6377 [2023-12-16 07:32:28,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:32:28,732 INFO L413 NwaCegarLoop]: 4216 mSDtfsCounter, 124 mSDsluCounter, 4106 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 8322 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:32:28,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 8322 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:32:28,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6377 states. [2023-12-16 07:32:28,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6377 to 6373. [2023-12-16 07:32:28,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6373 states, 5717 states have (on average 1.4313451110722406) internal successors, (8183), 5764 states have internal predecessors, (8183), 342 states have call successors, (342), 257 states have call predecessors, (342), 312 states have return successors, (414), 352 states have call predecessors, (414), 340 states have call successors, (414) [2023-12-16 07:32:29,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6373 states to 6373 states and 8939 transitions. [2023-12-16 07:32:29,011 INFO L78 Accepts]: Start accepts. Automaton has 6373 states and 8939 transitions. Word has length 149 [2023-12-16 07:32:29,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:32:29,011 INFO L495 AbstractCegarLoop]: Abstraction has 6373 states and 8939 transitions. [2023-12-16 07:32:29,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-16 07:32:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 6373 states and 8939 transitions. [2023-12-16 07:32:29,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-16 07:32:29,017 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:29,017 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 07:32:29,023 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 (19)] Forceful destruction successful, exit code 0 [2023-12-16 07:32:29,221 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-16 07:32:29,222 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:29,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:29,222 INFO L85 PathProgramCache]: Analyzing trace with hash -66105207, now seen corresponding path program 1 times [2023-12-16 07:32:29,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:29,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203773556] [2023-12-16 07:32:29,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:29,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:29,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:29,224 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-16 07:32:29,254 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-16 07:32:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:32:29,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:32:29,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:32:29,464 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-16 07:32:29,464 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:32:29,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:32:29,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203773556] [2023-12-16 07:32:29,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203773556] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:32:29,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:32:29,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 07:32:29,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36891680] [2023-12-16 07:32:29,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:32:29,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:32:29,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:32:29,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:32:29,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:32:29,466 INFO L87 Difference]: Start difference. First operand 6373 states and 8939 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 07:32:29,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:32:29,813 INFO L93 Difference]: Finished difference Result 11390 states and 14805 transitions. [2023-12-16 07:32:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:32:29,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 175 [2023-12-16 07:32:29,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:32:29,830 INFO L225 Difference]: With dead ends: 11390 [2023-12-16 07:32:29,830 INFO L226 Difference]: Without dead ends: 7147 [2023-12-16 07:32:29,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:32:29,838 INFO L413 NwaCegarLoop]: 4144 mSDtfsCounter, 4002 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4002 SdHoareTripleChecker+Valid, 4281 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:32:29,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4002 Valid, 4281 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:32:29,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7147 states. [2023-12-16 07:32:30,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7147 to 7131. [2023-12-16 07:32:30,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7131 states, 6355 states have (on average 1.3977970102281667) internal successors, (8883), 6406 states have internal predecessors, (8883), 410 states have call successors, (410), 305 states have call predecessors, (410), 364 states have return successors, (486), 420 states have call predecessors, (486), 408 states have call successors, (486) [2023-12-16 07:32:30,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7131 states to 7131 states and 9779 transitions. [2023-12-16 07:32:30,105 INFO L78 Accepts]: Start accepts. Automaton has 7131 states and 9779 transitions. Word has length 175 [2023-12-16 07:32:30,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:32:30,106 INFO L495 AbstractCegarLoop]: Abstraction has 7131 states and 9779 transitions. [2023-12-16 07:32:30,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 07:32:30,106 INFO L276 IsEmpty]: Start isEmpty. Operand 7131 states and 9779 transitions. [2023-12-16 07:32:30,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-12-16 07:32:30,112 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:30,112 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 07:32:30,117 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-16 07:32:30,316 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-16 07:32:30,317 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:30,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:30,317 INFO L85 PathProgramCache]: Analyzing trace with hash -2075135184, now seen corresponding path program 1 times [2023-12-16 07:32:30,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:30,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601161921] [2023-12-16 07:32:30,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:30,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:30,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:30,319 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-16 07:32:30,352 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-16 07:32:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:32:30,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:32:30,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:32:30,456 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-16 07:32:30,456 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:32:30,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:32:30,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601161921] [2023-12-16 07:32:30,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601161921] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:32:30,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:32:30,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:32:30,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369637803] [2023-12-16 07:32:30,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:32:30,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:32:30,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:32:30,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:32:30,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:32:30,458 INFO L87 Difference]: Start difference. First operand 7131 states and 9779 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 07:32:30,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:32:30,658 INFO L93 Difference]: Finished difference Result 8923 states and 11858 transitions. [2023-12-16 07:32:30,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:32:30,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 178 [2023-12-16 07:32:30,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:32:30,667 INFO L225 Difference]: With dead ends: 8923 [2023-12-16 07:32:30,667 INFO L226 Difference]: Without dead ends: 3719 [2023-12-16 07:32:30,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:32:30,678 INFO L413 NwaCegarLoop]: 4174 mSDtfsCounter, 127 mSDsluCounter, 4078 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 8252 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:32:30,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 8252 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:32:30,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2023-12-16 07:32:30,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3719. [2023-12-16 07:32:30,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3719 states, 3463 states have (on average 1.5746462604678024) internal successors, (5453), 3476 states have internal predecessors, (5453), 146 states have call successors, (146), 101 states have call predecessors, (146), 108 states have return successors, (152), 142 states have call predecessors, (152), 144 states have call successors, (152) [2023-12-16 07:32:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3719 states to 3719 states and 5751 transitions. [2023-12-16 07:32:30,814 INFO L78 Accepts]: Start accepts. Automaton has 3719 states and 5751 transitions. Word has length 178 [2023-12-16 07:32:30,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:32:30,814 INFO L495 AbstractCegarLoop]: Abstraction has 3719 states and 5751 transitions. [2023-12-16 07:32:30,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 07:32:30,814 INFO L276 IsEmpty]: Start isEmpty. Operand 3719 states and 5751 transitions. [2023-12-16 07:32:30,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-16 07:32:30,819 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:30,820 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 07:32:30,827 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 (21)] Forceful destruction successful, exit code 0 [2023-12-16 07:32:31,024 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-16 07:32:31,024 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:31,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:31,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1642256134, now seen corresponding path program 1 times [2023-12-16 07:32:31,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:31,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821677692] [2023-12-16 07:32:31,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:31,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:31,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:31,027 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-16 07:32:31,054 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-16 07:32:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:32:31,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:32:31,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:32:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-16 07:32:31,159 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:32:31,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:32:31,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821677692] [2023-12-16 07:32:31,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821677692] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:32:31,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:32:31,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:32:31,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811948261] [2023-12-16 07:32:31,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:32:31,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:32:31,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:32:31,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:32:31,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:32:31,161 INFO L87 Difference]: Start difference. First operand 3719 states and 5751 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-16 07:32:31,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:32:31,455 INFO L93 Difference]: Finished difference Result 4749 states and 6941 transitions. [2023-12-16 07:32:31,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:32:31,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 179 [2023-12-16 07:32:31,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:32:31,464 INFO L225 Difference]: With dead ends: 4749 [2023-12-16 07:32:31,464 INFO L226 Difference]: Without dead ends: 3719 [2023-12-16 07:32:31,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:32:31,468 INFO L413 NwaCegarLoop]: 4206 mSDtfsCounter, 134 mSDsluCounter, 4071 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 8277 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:32:31,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 8277 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:32:31,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2023-12-16 07:32:31,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3719. [2023-12-16 07:32:31,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3719 states, 3463 states have (on average 1.5700259890268553) internal successors, (5437), 3476 states have internal predecessors, (5437), 146 states have call successors, (146), 101 states have call predecessors, (146), 108 states have return successors, (152), 142 states have call predecessors, (152), 144 states have call successors, (152) [2023-12-16 07:32:31,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3719 states to 3719 states and 5735 transitions. [2023-12-16 07:32:31,659 INFO L78 Accepts]: Start accepts. Automaton has 3719 states and 5735 transitions. Word has length 179 [2023-12-16 07:32:31,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:32:31,660 INFO L495 AbstractCegarLoop]: Abstraction has 3719 states and 5735 transitions. [2023-12-16 07:32:31,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-16 07:32:31,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3719 states and 5735 transitions. [2023-12-16 07:32:31,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-12-16 07:32:31,664 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:31,664 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 07:32:31,672 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 (22)] Forceful destruction successful, exit code 0 [2023-12-16 07:32:31,870 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-16 07:32:31,871 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:31,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:31,871 INFO L85 PathProgramCache]: Analyzing trace with hash -2057275776, now seen corresponding path program 1 times [2023-12-16 07:32:31,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:31,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348466317] [2023-12-16 07:32:31,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:31,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:31,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:31,873 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-16 07:32:31,900 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-16 07:32:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:32:31,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:32:31,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:32:32,030 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-16 07:32:32,031 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:32:32,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:32:32,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348466317] [2023-12-16 07:32:32,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348466317] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:32:32,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:32:32,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:32:32,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096810943] [2023-12-16 07:32:32,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:32:32,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:32:32,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:32:32,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:32:32,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:32:32,033 INFO L87 Difference]: Start difference. First operand 3719 states and 5735 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 07:32:32,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:32:32,255 INFO L93 Difference]: Finished difference Result 5351 states and 7604 transitions. [2023-12-16 07:32:32,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:32:32,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 181 [2023-12-16 07:32:32,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:32:32,267 INFO L225 Difference]: With dead ends: 5351 [2023-12-16 07:32:32,267 INFO L226 Difference]: Without dead ends: 3925 [2023-12-16 07:32:32,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:32:32,273 INFO L413 NwaCegarLoop]: 4114 mSDtfsCounter, 4071 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4071 SdHoareTripleChecker+Valid, 4245 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:32:32,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4071 Valid, 4245 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:32:32,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2023-12-16 07:32:32,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 3923. [2023-12-16 07:32:32,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3923 states, 3633 states have (on average 1.5452793834296725) internal successors, (5614), 3649 states have internal predecessors, (5614), 165 states have call successors, (165), 115 states have call predecessors, (165), 123 states have return successors, (179), 159 states have call predecessors, (179), 163 states have call successors, (179) [2023-12-16 07:32:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 5958 transitions. [2023-12-16 07:32:32,435 INFO L78 Accepts]: Start accepts. Automaton has 3923 states and 5958 transitions. Word has length 181 [2023-12-16 07:32:32,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:32:32,436 INFO L495 AbstractCegarLoop]: Abstraction has 3923 states and 5958 transitions. [2023-12-16 07:32:32,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 07:32:32,436 INFO L276 IsEmpty]: Start isEmpty. Operand 3923 states and 5958 transitions. [2023-12-16 07:32:32,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-12-16 07:32:32,440 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:32,440 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 07:32:32,447 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 (23)] Forceful destruction successful, exit code 0 [2023-12-16 07:32:32,644 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-16 07:32:32,645 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:32,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:32,645 INFO L85 PathProgramCache]: Analyzing trace with hash -579716545, now seen corresponding path program 1 times [2023-12-16 07:32:32,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:32,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369958031] [2023-12-16 07:32:32,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:32,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:32,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:32,647 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-16 07:32:32,647 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-16 07:32:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:32:32,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:32:32,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:32:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-12-16 07:32:32,762 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:32:32,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:32:32,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369958031] [2023-12-16 07:32:32,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369958031] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:32:32,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:32:32,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:32:32,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107520157] [2023-12-16 07:32:32,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:32:32,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:32:32,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:32:32,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:32:32,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:32:32,764 INFO L87 Difference]: Start difference. First operand 3923 states and 5958 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 07:32:32,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:32:32,941 INFO L93 Difference]: Finished difference Result 5377 states and 7604 transitions. [2023-12-16 07:32:32,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:32:32,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 182 [2023-12-16 07:32:32,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:32:32,951 INFO L225 Difference]: With dead ends: 5377 [2023-12-16 07:32:32,952 INFO L226 Difference]: Without dead ends: 3923 [2023-12-16 07:32:32,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:32:32,957 INFO L413 NwaCegarLoop]: 4158 mSDtfsCounter, 138 mSDsluCounter, 4055 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 8213 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:32:32,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 8213 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:32:32,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3923 states. [2023-12-16 07:32:33,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3923 to 3923. [2023-12-16 07:32:33,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3923 states, 3633 states have (on average 1.5403248004404073) internal successors, (5596), 3649 states have internal predecessors, (5596), 165 states have call successors, (165), 115 states have call predecessors, (165), 123 states have return successors, (179), 159 states have call predecessors, (179), 163 states have call successors, (179) [2023-12-16 07:32:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 5940 transitions. [2023-12-16 07:32:33,125 INFO L78 Accepts]: Start accepts. Automaton has 3923 states and 5940 transitions. Word has length 182 [2023-12-16 07:32:33,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:32:33,126 INFO L495 AbstractCegarLoop]: Abstraction has 3923 states and 5940 transitions. [2023-12-16 07:32:33,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 07:32:33,126 INFO L276 IsEmpty]: Start isEmpty. Operand 3923 states and 5940 transitions. [2023-12-16 07:32:33,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2023-12-16 07:32:33,130 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:33,130 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 07:32:33,137 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-16 07:32:33,334 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-16 07:32:33,335 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:33,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:33,335 INFO L85 PathProgramCache]: Analyzing trace with hash -633536807, now seen corresponding path program 1 times [2023-12-16 07:32:33,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:33,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976306765] [2023-12-16 07:32:33,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:33,336 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:33,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:33,337 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-16 07:32:33,340 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-16 07:32:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:32:33,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 07:32:33,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:32:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 82 proven. 61 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 07:32:33,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:32:33,935 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-12-16 07:32:33,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:32:33,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976306765] [2023-12-16 07:32:33,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976306765] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 07:32:33,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 07:32:33,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2023-12-16 07:32:33,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017264286] [2023-12-16 07:32:33,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:32:33,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 07:32:33,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:32:33,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 07:32:33,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 07:32:33,937 INFO L87 Difference]: Start difference. First operand 3923 states and 5940 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 5 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-16 07:32:34,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:32:34,392 INFO L93 Difference]: Finished difference Result 3927 states and 5943 transitions. [2023-12-16 07:32:34,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 07:32:34,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 5 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 184 [2023-12-16 07:32:34,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:32:34,401 INFO L225 Difference]: With dead ends: 3927 [2023-12-16 07:32:34,402 INFO L226 Difference]: Without dead ends: 3924 [2023-12-16 07:32:34,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 07:32:34,403 INFO L413 NwaCegarLoop]: 4276 mSDtfsCounter, 4275 mSDsluCounter, 8414 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4275 SdHoareTripleChecker+Valid, 12690 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 07:32:34,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4275 Valid, 12690 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 07:32:34,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3924 states. [2023-12-16 07:32:34,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3924 to 3922. [2023-12-16 07:32:34,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3922 states, 3633 states have (on average 1.539774291219378) internal successors, (5594), 3648 states have internal predecessors, (5594), 164 states have call successors, (164), 115 states have call predecessors, (164), 123 states have return successors, (179), 159 states have call predecessors, (179), 163 states have call successors, (179) [2023-12-16 07:32:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3922 states to 3922 states and 5937 transitions. [2023-12-16 07:32:34,577 INFO L78 Accepts]: Start accepts. Automaton has 3922 states and 5937 transitions. Word has length 184 [2023-12-16 07:32:34,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:32:34,577 INFO L495 AbstractCegarLoop]: Abstraction has 3922 states and 5937 transitions. [2023-12-16 07:32:34,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 5 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-16 07:32:34,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3922 states and 5937 transitions. [2023-12-16 07:32:34,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2023-12-16 07:32:34,581 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:34,581 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 07:32:34,586 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-16 07:32:34,785 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-16 07:32:34,786 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:34,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:34,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1918634495, now seen corresponding path program 1 times [2023-12-16 07:32:34,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:34,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967943716] [2023-12-16 07:32:34,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:34,787 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:32:34,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:34,788 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-16 07:32:34,790 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-16 07:32:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:32:34,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:32:34,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:32:34,917 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-12-16 07:32:34,917 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:32:34,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:32:34,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967943716] [2023-12-16 07:32:34,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [967943716] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:32:34,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:32:34,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:32:34,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831364557] [2023-12-16 07:32:34,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:32:34,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:32:34,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:32:34,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:32:34,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:32:34,919 INFO L87 Difference]: Start difference. First operand 3922 states and 5937 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 07:32:35,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:32:35,149 INFO L93 Difference]: Finished difference Result 4845 states and 6956 transitions. [2023-12-16 07:32:35,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:32:35,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 188 [2023-12-16 07:32:35,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:32:35,158 INFO L225 Difference]: With dead ends: 4845 [2023-12-16 07:32:35,158 INFO L226 Difference]: Without dead ends: 3932 [2023-12-16 07:32:35,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:32:35,161 INFO L413 NwaCegarLoop]: 4110 mSDtfsCounter, 3 mSDsluCounter, 4096 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8206 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:32:35,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8206 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:32:35,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3932 states. [2023-12-16 07:32:35,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3932 to 3924. [2023-12-16 07:32:35,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3924 states, 3635 states have (on average 1.539477303988996) internal successors, (5596), 3650 states have internal predecessors, (5596), 164 states have call successors, (164), 115 states have call predecessors, (164), 123 states have return successors, (179), 159 states have call predecessors, (179), 163 states have call successors, (179) [2023-12-16 07:32:35,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3924 states to 3924 states and 5939 transitions. [2023-12-16 07:32:35,351 INFO L78 Accepts]: Start accepts. Automaton has 3924 states and 5939 transitions. Word has length 188 [2023-12-16 07:32:35,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:32:35,353 INFO L495 AbstractCegarLoop]: Abstraction has 3924 states and 5939 transitions. [2023-12-16 07:32:35,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 07:32:35,353 INFO L276 IsEmpty]: Start isEmpty. Operand 3924 states and 5939 transitions. [2023-12-16 07:32:35,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2023-12-16 07:32:35,358 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:32:35,358 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 07:32:35,363 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-16 07:32:35,563 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-16 07:32:35,563 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:32:35,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:32:35,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1881060228, now seen corresponding path program 1 times [2023-12-16 07:32:35,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:32:35,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498050985] [2023-12-16 07:32:35,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:32:35,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-16 07:32:35,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:32:35,566 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-16 07:32:35,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 (27)] Waiting until timeout for monitored process [2023-12-16 07:32:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 07:32:35,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 07:32:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 07:32:35,867 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-16 07:32:35,867 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 07:32:35,868 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-16 07:32:35,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-16 07:32:35,879 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-16 07:32:36,077 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-16 07:32:36,080 INFO L445 BasicCegarLoop]: Path program 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] [2023-12-16 07:32:36,083 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 07:32:36,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:32:36 BoogieIcfgContainer [2023-12-16 07:32:36,230 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 07:32:36,231 INFO L158 Benchmark]: Toolchain (without parser) took 35139.36ms. Allocated memory was 198.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 126.1MB in the beginning and 885.1MB in the end (delta: -758.9MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2023-12-16 07:32:36,231 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 198.2MB. Free memory is still 154.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 07:32:36,231 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3005.29ms. Allocated memory was 198.2MB in the beginning and 252.7MB in the end (delta: 54.5MB). Free memory was 125.7MB in the beginning and 92.1MB in the end (delta: 33.7MB). Peak memory consumption was 122.7MB. Max. memory is 8.0GB. [2023-12-16 07:32:36,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 508.23ms. Allocated memory is still 252.7MB. Free memory was 92.1MB in the beginning and 122.5MB in the end (delta: -30.4MB). Peak memory consumption was 80.2MB. Max. memory is 8.0GB. [2023-12-16 07:32:36,232 INFO L158 Benchmark]: Boogie Preprocessor took 847.64ms. Allocated memory was 252.7MB in the beginning and 457.2MB in the end (delta: 204.5MB). Free memory was 122.5MB in the beginning and 306.5MB in the end (delta: -184.0MB). Peak memory consumption was 58.7MB. Max. memory is 8.0GB. [2023-12-16 07:32:36,232 INFO L158 Benchmark]: RCFGBuilder took 9335.20ms. Allocated memory was 457.2MB in the beginning and 1.1GB in the end (delta: 658.5MB). Free memory was 306.5MB in the beginning and 649.5MB in the end (delta: -343.1MB). Peak memory consumption was 420.8MB. Max. memory is 8.0GB. [2023-12-16 07:32:36,232 INFO L158 Benchmark]: TraceAbstraction took 21435.68ms. Allocated memory was 1.1GB in the beginning and 2.0GB in the end (delta: 931.1MB). Free memory was 649.0MB in the beginning and 885.1MB in the end (delta: -236.0MB). Peak memory consumption was 694.6MB. Max. memory is 8.0GB. [2023-12-16 07:32:36,233 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.19ms. Allocated memory is still 198.2MB. Free memory is still 154.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 3005.29ms. Allocated memory was 198.2MB in the beginning and 252.7MB in the end (delta: 54.5MB). Free memory was 125.7MB in the beginning and 92.1MB in the end (delta: 33.7MB). Peak memory consumption was 122.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 508.23ms. Allocated memory is still 252.7MB. Free memory was 92.1MB in the beginning and 122.5MB in the end (delta: -30.4MB). Peak memory consumption was 80.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 847.64ms. Allocated memory was 252.7MB in the beginning and 457.2MB in the end (delta: 204.5MB). Free memory was 122.5MB in the beginning and 306.5MB in the end (delta: -184.0MB). Peak memory consumption was 58.7MB. Max. memory is 8.0GB. * RCFGBuilder took 9335.20ms. Allocated memory was 457.2MB in the beginning and 1.1GB in the end (delta: 658.5MB). Free memory was 306.5MB in the beginning and 649.5MB in the end (delta: -343.1MB). Peak memory consumption was 420.8MB. Max. memory is 8.0GB. * TraceAbstraction took 21435.68ms. Allocated memory was 1.1GB in the beginning and 2.0GB in the end (delta: 931.1MB). Free memory was 649.0MB in the beginning and 885.1MB in the end (delta: -236.0MB). Peak memory consumption was 694.6MB. 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: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int t2_pc = 0; [L11180] int m_st ; [L11181] int t1_st ; [L11182] int t2_st ; [L11183] int m_i ; [L11184] int t1_i ; [L11185] int t2_i ; [L11186] int M_E = 2; [L11187] int T1_E = 2; [L11188] int T2_E = 2; [L11189] int E_M = 2; [L11190] int E_1 = 2; [L11191] int E_2 = 2; [L11196] int token ; [L11198] int local ; [L11776] COND FALSE !(__VERIFIER_nondet_int()) [L11779] CALL main2() [L11763] int __retres1 ; [L11767] CALL init_model() [L11677] m_i = 1 [L11678] t1_i = 1 [L11679] t2_i = 1 [L11767] RET init_model() [L11768] CALL start_simulation() [L11704] int kernel_st ; [L11705] int tmp ; [L11706] int tmp___0 ; [L11710] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11711] FCALL update_channels() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11712] CALL init_threads() [L11396] COND TRUE m_i == 1 [L11397] m_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11401] COND TRUE t1_i == 1 [L11402] t1_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11406] COND TRUE t2_i == 1 [L11407] t2_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11712] RET init_threads() [L11713] CALL fire_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11509] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11514] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11519] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11524] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11529] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11534] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11713] RET fire_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11714] CALL activate_threads() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11331] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11341] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11343] return (__retres1); [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11350] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11360] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11362] return (__retres1); [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11369] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11379] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11381] return (__retres1); [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L11714] RET activate_threads() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11715] CALL reset_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11547] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11552] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11557] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11562] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11567] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11572] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11715] RET reset_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11718] COND TRUE 1 [L11721] kernel_st = 1 [L11722] CALL eval() [L11442] int tmp ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11446] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11449] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11416] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11419] COND TRUE m_st == 0 [L11420] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11437] return (__retres1); [L11449] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11449] tmp = exists_runnable_thread() [L11451] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L11456-L11467] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L11470] COND TRUE t1_st == 0 [L11471] int tmp_ndt_2; [L11472] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L11473] COND TRUE, EXPR \read(tmp_ndt_2) [L11475] EXPR t1_st = 1 [L11476] CALL, EXPR transmit1() [L11259] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11270] COND TRUE 1 [L11272] t1_pc = 1 [L11273] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11476] RET, EXPR transmit1() [L11470-L11481] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L11484] COND TRUE t2_st == 0 [L11485] int tmp_ndt_3; [L11486] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L11487] COND TRUE, EXPR \read(tmp_ndt_3) [L11489] EXPR t2_st = 1 [L11490] CALL, EXPR transmit2() [L11295] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L11306] COND TRUE 1 [L11308] t2_pc = 1 [L11309] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11490] RET, EXPR transmit2() [L11484-L11495] { int tmp_ndt_3; tmp_ndt_3 = __VERIFIER_nondet_int(); if (tmp_ndt_3) { { t2_st = 1; transmit2(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L11446] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L11449] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11416] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11419] COND TRUE m_st == 0 [L11420] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11437] return (__retres1); [L11449] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L11449] tmp = exists_runnable_thread() [L11451] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND TRUE, EXPR \read(tmp_ndt_1) [L11461] EXPR m_st = 1 [L11462] CALL, EXPR master() [L11201] int tmp_var = __VERIFIER_nondet_int(); [L11203] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11214] COND TRUE 1 [L11217] token = __VERIFIER_nondet_int() [L11218] local = token [L11219] E_1 = 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11220] CALL immediate_notify() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11620] CALL activate_threads() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11331] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11341] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11343] return (__retres1); [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11350] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11351] COND TRUE E_1 == 1 [L11352] __retres1 = 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11362] return (__retres1); [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND TRUE \read(tmp___0) [L11599] t1_st = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11369] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11370] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11379] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11381] return (__retres1); [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L11620] RET activate_threads() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11220] RET immediate_notify() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11221] E_1 = 2 [L11222] m_pc = 1 [L11223] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11462] RET, EXPR master() [L11456-L11467] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L11470] COND TRUE t1_st == 0 [L11471] int tmp_ndt_2; [L11472] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L11473] COND TRUE, EXPR \read(tmp_ndt_2) [L11475] EXPR t1_st = 1 [L11476] CALL, EXPR transmit1() [L11259] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11262] COND TRUE t1_pc == 1 [L11278] token += 1 [L11279] E_2 = 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11280] CALL immediate_notify() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11620] CALL activate_threads() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11331] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11332] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11341] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11343] return (__retres1); [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11350] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11351] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11360] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11362] return (__retres1); [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11369] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11370] COND TRUE E_2 == 1 [L11371] __retres1 = 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11381] return (__retres1); [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND TRUE \read(tmp___1) [L11607] t2_st = 0 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=1] [L11620] RET activate_threads() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11280] RET immediate_notify() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11281] E_2 = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11270] COND TRUE 1 [L11272] t1_pc = 1 [L11273] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11476] RET, EXPR transmit1() [L11470-L11481] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, token=1] [L11484] COND TRUE t2_st == 0 [L11485] int tmp_ndt_3; [L11486] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L11487] COND TRUE, EXPR \read(tmp_ndt_3) [L11489] EXPR t2_st = 1 [L11490] CALL, EXPR transmit2() [L11295] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L11298] COND TRUE t2_pc == 1 [L11314] token += 1 [L11315] E_M = 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11316] CALL immediate_notify() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11620] CALL activate_threads() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11331] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11332] COND TRUE E_M == 1 [L11333] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11343] return (__retres1); [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND TRUE \read(tmp) [L11591] m_st = 0 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11350] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11351] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11360] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11362] return (__retres1); [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11369] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11370] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11379] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11381] return (__retres1); [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L11620] RET activate_threads() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11316] RET immediate_notify() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11317] E_M = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11306] COND TRUE 1 [L11308] t2_pc = 1 [L11309] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11490] RET, EXPR transmit2() [L11484-L11495] { int tmp_ndt_3; tmp_ndt_3 = __VERIFIER_nondet_int(); if (tmp_ndt_3) { { t2_st = 1; transmit2(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=2] [L11446] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=2] [L11449] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11416] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11419] COND TRUE m_st == 0 [L11420] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11437] return (__retres1); [L11449] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=2] [L11449] tmp = exists_runnable_thread() [L11451] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=2] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND TRUE \read(tmp_ndt_1) [L11461] m_st = 1 [L11462] CALL master() [L11201] int tmp_var = __VERIFIER_nondet_int(); [L11203] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11206] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11228] COND FALSE !(token != local + 2) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11233] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11234] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11239] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11240] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11241] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11242] CALL error() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11173] reach_error() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - UnprovableResult [Line: 11133]: 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 8 procedures, 2249 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 21.2s, OverallIterations: 26, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59042 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58967 mSDsluCounter, 230429 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 127194 mSDsCounter, 312 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2563 IncrementalHoareTripleChecker+Invalid, 2875 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 312 mSolverCounterUnsat, 103235 mSDtfsCounter, 2563 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3145 GetRequests, 3090 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7131occurred in iteration=19, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 25 MinimizatonAttempts, 221 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 3163 NumberOfCodeBlocks, 3163 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3132 ConstructedInterpolants, 0 QuantifiedInterpolants, 5016 SizeOfPredicates, 3 NumberOfNonLiveVariables, 6169 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 26 InterpolantComputations, 25 PerfectInterpolantSequences, 1627/1688 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-16 07:32:36,252 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...