/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_label49+token_ring.03.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 22:14:26,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 22:14:26,318 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-21 22:14:26,321 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 22:14:26,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 22:14:26,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 22:14:26,344 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 22:14:26,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 22:14:26,345 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 22:14:26,348 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 22:14:26,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 22:14:26,348 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 22:14:26,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 22:14:26,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 22:14:26,349 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 22:14:26,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 22:14:26,350 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 22:14:26,350 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 22:14:26,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 22:14:26,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 22:14:26,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 22:14:26,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 22:14:26,351 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 22:14:26,351 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 22:14:26,351 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 22:14:26,352 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 22:14:26,352 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 22:14:26,352 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 22:14:26,352 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 22:14:26,352 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 22:14:26,353 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 22:14:26,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 22:14:26,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 22:14:26,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 22:14:26,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 22:14:26,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 22:14:26,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 22:14:26,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 22:14:26,354 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 22:14:26,354 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 22:14:26,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 22:14:26,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 22:14:26,355 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 22:14:26,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 22:14:26,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 22:14:26,355 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 22:14:26,355 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-21 22:14:26,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 22:14:26,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 22:14:26,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 22:14:26,565 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 22:14:26,565 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 22:14:26,566 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/Problem05_label49+token_ring.03.cil-1.c [2023-12-21 22:14:27,480 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 22:14:27,901 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 22:14:27,902 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label49+token_ring.03.cil-1.c [2023-12-21 22:14:27,944 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b58f5b141/e91a3c20290d417da871f2845df61ad6/FLAG91dde31c1 [2023-12-21 22:14:27,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b58f5b141/e91a3c20290d417da871f2845df61ad6 [2023-12-21 22:14:27,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 22:14:27,964 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 22:14:27,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 22:14:27,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 22:14:27,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 22:14:27,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:14:27" (1/1) ... [2023-12-21 22:14:27,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac970cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:27, skipping insertion in model container [2023-12-21 22:14:27,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:14:27" (1/1) ... [2023-12-21 22:14:28,143 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 22:14:29,357 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_label49+token_ring.03.cil-1.c[380593,380606] [2023-12-21 22:14:29,378 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_label49+token_ring.03.cil-1.c[383339,383352] [2023-12-21 22:14:29,494 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 22:14:29,505 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 22:14:30,068 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_label49+token_ring.03.cil-1.c[380593,380606] [2023-12-21 22:14:30,073 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_label49+token_ring.03.cil-1.c[383339,383352] [2023-12-21 22:14:30,089 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 22:14:30,130 INFO L206 MainTranslator]: Completed translation [2023-12-21 22:14:30,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:30 WrapperNode [2023-12-21 22:14:30,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 22:14:30,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 22:14:30,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 22:14:30,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 22:14:30,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:30" (1/1) ... [2023-12-21 22:14:30,202 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:30" (1/1) ... [2023-12-21 22:14:30,514 INFO L138 Inliner]: procedures = 51, calls = 51, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 12674 [2023-12-21 22:14:30,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 22:14:30,515 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 22:14:30,515 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 22:14:30,515 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 22:14:30,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:30" (1/1) ... [2023-12-21 22:14:30,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:30" (1/1) ... [2023-12-21 22:14:30,567 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:30" (1/1) ... [2023-12-21 22:14:30,623 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-21 22:14:30,624 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:30" (1/1) ... [2023-12-21 22:14:30,624 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:30" (1/1) ... [2023-12-21 22:14:30,767 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:30" (1/1) ... [2023-12-21 22:14:30,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:30" (1/1) ... [2023-12-21 22:14:30,821 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:30" (1/1) ... [2023-12-21 22:14:30,839 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:30" (1/1) ... [2023-12-21 22:14:30,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 22:14:30,879 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 22:14:30,879 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 22:14:30,880 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 22:14:30,880 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:30" (1/1) ... [2023-12-21 22:14:30,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 22:14:30,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 22:14:30,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 22:14:30,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 22:14:30,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 22:14:30,922 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-21 22:14:30,922 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-21 22:14:30,922 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-21 22:14:30,923 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-21 22:14:30,923 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-21 22:14:30,923 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-21 22:14:30,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 22:14:30,923 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-21 22:14:30,923 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-21 22:14:30,923 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-21 22:14:30,923 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-21 22:14:30,923 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-21 22:14:30,923 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-21 22:14:30,923 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-21 22:14:30,923 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-21 22:14:30,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 22:14:30,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 22:14:31,067 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 22:14:31,069 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 22:14:38,230 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 22:14:38,321 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 22:14:38,322 INFO L309 CfgBuilder]: Removed 7 assume(true) statements. [2023-12-21 22:14:38,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:14:38 BoogieIcfgContainer [2023-12-21 22:14:38,324 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 22:14:38,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 22:14:38,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 22:14:38,328 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 22:14:38,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 10:14:27" (1/3) ... [2023-12-21 22:14:38,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b22087b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:14:38, skipping insertion in model container [2023-12-21 22:14:38,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:30" (2/3) ... [2023-12-21 22:14:38,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b22087b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:14:38, skipping insertion in model container [2023-12-21 22:14:38,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:14:38" (3/3) ... [2023-12-21 22:14:38,330 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.03.cil-1.c [2023-12-21 22:14:38,343 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 22:14:38,343 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-21 22:14:38,411 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 22:14:38,415 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;@2f7bb186, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 22:14:38,415 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-21 22:14:38,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 2272 states, 2243 states have (on average 1.8849754792688365) internal successors, (4228), 2248 states have internal predecessors, (4228), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-21 22:14:38,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:14:38,441 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:38,442 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:14:38,442 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:38,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:38,447 INFO L85 PathProgramCache]: Analyzing trace with hash 910636931, now seen corresponding path program 1 times [2023-12-21 22:14:38,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:38,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048890262] [2023-12-21 22:14:38,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:38,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:38,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:38,462 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:14:38,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-21 22:14:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:38,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:14:38,612 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:38,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 22:14:38,703 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:38,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:38,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048890262] [2023-12-21 22:14:38,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048890262] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:38,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:38,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:14:38,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196197616] [2023-12-21 22:14:38,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:38,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 22:14:38,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:38,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 22:14:38,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 22:14:38,731 INFO L87 Difference]: Start difference. First operand has 2272 states, 2243 states have (on average 1.8849754792688365) internal successors, (4228), 2248 states have internal predecessors, (4228), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 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-21 22:14:39,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:39,201 INFO L93 Difference]: Finished difference Result 4686 states and 8770 transitions. [2023-12-21 22:14:39,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 22:14:39,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 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 72 [2023-12-21 22:14:39,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:39,226 INFO L225 Difference]: With dead ends: 4686 [2023-12-21 22:14:39,226 INFO L226 Difference]: Without dead ends: 2417 [2023-12-21 22:14:39,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 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-21 22:14:39,238 INFO L413 NwaCegarLoop]: 4125 mSDtfsCounter, 4341 mSDsluCounter, 8321 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4352 SdHoareTripleChecker+Valid, 12446 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:39,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4352 Valid, 12446 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 22:14:39,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2023-12-21 22:14:39,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2404. [2023-12-21 22:14:39,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2404 states, 2358 states have (on average 1.8379983036471585) internal successors, (4334), 2362 states have internal predecessors, (4334), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2023-12-21 22:14:39,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2404 states to 2404 states and 4395 transitions. [2023-12-21 22:14:39,354 INFO L78 Accepts]: Start accepts. Automaton has 2404 states and 4395 transitions. Word has length 72 [2023-12-21 22:14:39,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:39,354 INFO L495 AbstractCegarLoop]: Abstraction has 2404 states and 4395 transitions. [2023-12-21 22:14:39,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 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-21 22:14:39,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2404 states and 4395 transitions. [2023-12-21 22:14:39,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:14:39,361 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:39,361 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:14:39,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-21 22:14:39,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:39,565 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:39,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:39,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1174500479, now seen corresponding path program 1 times [2023-12-21 22:14:39,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:39,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17340815] [2023-12-21 22:14:39,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:39,567 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:39,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:39,601 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:14:39,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-21 22:14:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:39,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:14:39,688 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 22:14:39,735 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:39,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:39,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17340815] [2023-12-21 22:14:39,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17340815] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:39,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:39,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:14:39,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518018999] [2023-12-21 22:14:39,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:39,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 22:14:39,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:39,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 22:14:39,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 22:14:39,741 INFO L87 Difference]: Start difference. First operand 2404 states and 4395 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-21 22:14:40,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:40,007 INFO L93 Difference]: Finished difference Result 2678 states and 4824 transitions. [2023-12-21 22:14:40,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 22:14:40,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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 72 [2023-12-21 22:14:40,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:40,019 INFO L225 Difference]: With dead ends: 2678 [2023-12-21 22:14:40,020 INFO L226 Difference]: Without dead ends: 2404 [2023-12-21 22:14:40,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 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-21 22:14:40,023 INFO L413 NwaCegarLoop]: 4097 mSDtfsCounter, 4233 mSDsluCounter, 8128 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4244 SdHoareTripleChecker+Valid, 12225 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:40,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4244 Valid, 12225 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 22:14:40,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2023-12-21 22:14:40,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2404. [2023-12-21 22:14:40,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2404 states, 2358 states have (on average 1.8350296861747244) internal successors, (4327), 2362 states have internal predecessors, (4327), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2023-12-21 22:14:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2404 states to 2404 states and 4388 transitions. [2023-12-21 22:14:40,081 INFO L78 Accepts]: Start accepts. Automaton has 2404 states and 4388 transitions. Word has length 72 [2023-12-21 22:14:40,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:40,082 INFO L495 AbstractCegarLoop]: Abstraction has 2404 states and 4388 transitions. [2023-12-21 22:14:40,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-21 22:14:40,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2404 states and 4388 transitions. [2023-12-21 22:14:40,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:14:40,082 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:40,083 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:14:40,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-21 22:14:40,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:40,286 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:40,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:40,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1875748867, now seen corresponding path program 1 times [2023-12-21 22:14:40,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:40,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150045925] [2023-12-21 22:14:40,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:40,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:40,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:40,288 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:14:40,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-21 22:14:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:40,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:14:40,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 22:14:40,406 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:40,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:40,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150045925] [2023-12-21 22:14:40,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150045925] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:40,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:40,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:14:40,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394929786] [2023-12-21 22:14:40,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:40,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 22:14:40,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:40,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 22:14:40,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 22:14:40,408 INFO L87 Difference]: Start difference. First operand 2404 states and 4388 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-21 22:14:40,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:40,603 INFO L93 Difference]: Finished difference Result 2678 states and 4810 transitions. [2023-12-21 22:14:40,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 22:14:40,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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 72 [2023-12-21 22:14:40,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:40,610 INFO L225 Difference]: With dead ends: 2678 [2023-12-21 22:14:40,611 INFO L226 Difference]: Without dead ends: 2404 [2023-12-21 22:14:40,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 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-21 22:14:40,612 INFO L413 NwaCegarLoop]: 4094 mSDtfsCounter, 4227 mSDsluCounter, 8124 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4238 SdHoareTripleChecker+Valid, 12218 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:40,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4238 Valid, 12218 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 22:14:40,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2023-12-21 22:14:40,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2404. [2023-12-21 22:14:40,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2404 states, 2358 states have (on average 1.83206106870229) internal successors, (4320), 2362 states have internal predecessors, (4320), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2023-12-21 22:14:40,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2404 states to 2404 states and 4381 transitions. [2023-12-21 22:14:40,733 INFO L78 Accepts]: Start accepts. Automaton has 2404 states and 4381 transitions. Word has length 72 [2023-12-21 22:14:40,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:40,734 INFO L495 AbstractCegarLoop]: Abstraction has 2404 states and 4381 transitions. [2023-12-21 22:14:40,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-21 22:14:40,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2404 states and 4381 transitions. [2023-12-21 22:14:40,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:14:40,736 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:40,736 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:14:40,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-21 22:14:40,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:40,941 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:40,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:40,944 INFO L85 PathProgramCache]: Analyzing trace with hash -2119502849, now seen corresponding path program 1 times [2023-12-21 22:14:40,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:40,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1265214991] [2023-12-21 22:14:40,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:40,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:40,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:40,947 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:14:40,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-21 22:14:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:41,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:14:41,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:41,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 22:14:41,070 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:41,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:41,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1265214991] [2023-12-21 22:14:41,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1265214991] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:41,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:41,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:14:41,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037530063] [2023-12-21 22:14:41,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:41,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 22:14:41,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:41,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 22:14:41,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 22:14:41,077 INFO L87 Difference]: Start difference. First operand 2404 states and 4381 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-21 22:14:41,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:41,297 INFO L93 Difference]: Finished difference Result 2678 states and 4796 transitions. [2023-12-21 22:14:41,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 22:14:41,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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 72 [2023-12-21 22:14:41,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:41,306 INFO L225 Difference]: With dead ends: 2678 [2023-12-21 22:14:41,306 INFO L226 Difference]: Without dead ends: 2404 [2023-12-21 22:14:41,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 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-21 22:14:41,310 INFO L413 NwaCegarLoop]: 4091 mSDtfsCounter, 4221 mSDsluCounter, 8120 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4232 SdHoareTripleChecker+Valid, 12211 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:41,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4232 Valid, 12211 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 22:14:41,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2023-12-21 22:14:41,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2404. [2023-12-21 22:14:41,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2404 states, 2358 states have (on average 1.8290924512298559) internal successors, (4313), 2362 states have internal predecessors, (4313), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2023-12-21 22:14:41,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2404 states to 2404 states and 4374 transitions. [2023-12-21 22:14:41,366 INFO L78 Accepts]: Start accepts. Automaton has 2404 states and 4374 transitions. Word has length 72 [2023-12-21 22:14:41,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:41,366 INFO L495 AbstractCegarLoop]: Abstraction has 2404 states and 4374 transitions. [2023-12-21 22:14:41,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-21 22:14:41,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2404 states and 4374 transitions. [2023-12-21 22:14:41,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:14:41,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:41,367 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:14:41,375 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-21 22:14:41,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:41,576 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:41,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:41,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1630943363, now seen corresponding path program 1 times [2023-12-21 22:14:41,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:41,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [774009315] [2023-12-21 22:14:41,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:41,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:41,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:41,578 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:14:41,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-21 22:14:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:41,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:14:41,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:41,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 22:14:41,684 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:41,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:41,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [774009315] [2023-12-21 22:14:41,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [774009315] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:41,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:41,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:14:41,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143892303] [2023-12-21 22:14:41,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:41,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 22:14:41,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:41,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 22:14:41,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 22:14:41,686 INFO L87 Difference]: Start difference. First operand 2404 states and 4374 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-21 22:14:41,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:41,928 INFO L93 Difference]: Finished difference Result 2736 states and 4874 transitions. [2023-12-21 22:14:41,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 22:14:41,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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 72 [2023-12-21 22:14:41,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:41,942 INFO L225 Difference]: With dead ends: 2736 [2023-12-21 22:14:41,942 INFO L226 Difference]: Without dead ends: 2462 [2023-12-21 22:14:41,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 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-21 22:14:41,944 INFO L413 NwaCegarLoop]: 4089 mSDtfsCounter, 4248 mSDsluCounter, 8116 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4259 SdHoareTripleChecker+Valid, 12205 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:41,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4259 Valid, 12205 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 22:14:41,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2023-12-21 22:14:41,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2462. [2023-12-21 22:14:41,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2462 states, 2410 states have (on average 1.8174273858921162) internal successors, (4380), 2414 states have internal predecessors, (4380), 33 states have call successors, (33), 17 states have call predecessors, (33), 17 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2023-12-21 22:14:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 4445 transitions. [2023-12-21 22:14:41,986 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 4445 transitions. Word has length 72 [2023-12-21 22:14:41,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:41,986 INFO L495 AbstractCegarLoop]: Abstraction has 2462 states and 4445 transitions. [2023-12-21 22:14:41,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-21 22:14:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 4445 transitions. [2023-12-21 22:14:41,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:14:41,988 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:41,988 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:14:41,993 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-21 22:14:42,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:42,192 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:42,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:42,192 INFO L85 PathProgramCache]: Analyzing trace with hash -971659746, now seen corresponding path program 1 times [2023-12-21 22:14:42,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:42,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261991300] [2023-12-21 22:14:42,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:42,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:42,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:42,193 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:14:42,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-21 22:14:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:42,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:14:42,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:42,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 22:14:42,296 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:42,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:42,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261991300] [2023-12-21 22:14:42,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261991300] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:42,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:42,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:14:42,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579642619] [2023-12-21 22:14:42,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:42,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 22:14:42,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:42,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 22:14:42,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 22:14:42,299 INFO L87 Difference]: Start difference. First operand 2462 states and 4445 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-21 22:14:42,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:42,547 INFO L93 Difference]: Finished difference Result 2852 states and 5016 transitions. [2023-12-21 22:14:42,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 22:14:42,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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 72 [2023-12-21 22:14:42,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:42,555 INFO L225 Difference]: With dead ends: 2852 [2023-12-21 22:14:42,555 INFO L226 Difference]: Without dead ends: 2520 [2023-12-21 22:14:42,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 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-21 22:14:42,556 INFO L413 NwaCegarLoop]: 4086 mSDtfsCounter, 4241 mSDsluCounter, 8112 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4252 SdHoareTripleChecker+Valid, 12198 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:42,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4252 Valid, 12198 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 22:14:42,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2023-12-21 22:14:42,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 2520. [2023-12-21 22:14:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2520 states, 2462 states have (on average 1.804630381803412) internal successors, (4443), 2466 states have internal predecessors, (4443), 35 states have call successors, (35), 21 states have call predecessors, (35), 21 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2023-12-21 22:14:42,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2520 states and 4512 transitions. [2023-12-21 22:14:42,598 INFO L78 Accepts]: Start accepts. Automaton has 2520 states and 4512 transitions. Word has length 72 [2023-12-21 22:14:42,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:42,598 INFO L495 AbstractCegarLoop]: Abstraction has 2520 states and 4512 transitions. [2023-12-21 22:14:42,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-21 22:14:42,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2520 states and 4512 transitions. [2023-12-21 22:14:42,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:14:42,599 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:42,599 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:14:42,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-21 22:14:42,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:42,804 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:42,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:42,804 INFO L85 PathProgramCache]: Analyzing trace with hash 837827490, now seen corresponding path program 1 times [2023-12-21 22:14:42,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:42,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484462143] [2023-12-21 22:14:42,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:42,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:42,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:42,806 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:14:42,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-21 22:14:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:42,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:14:42,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:42,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 22:14:42,910 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:42,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:42,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484462143] [2023-12-21 22:14:42,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484462143] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:42,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:42,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:14:42,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981560466] [2023-12-21 22:14:42,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:42,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 22:14:42,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:42,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 22:14:42,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 22:14:42,912 INFO L87 Difference]: Start difference. First operand 2520 states and 4512 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-21 22:14:43,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:43,163 INFO L93 Difference]: Finished difference Result 2968 states and 5150 transitions. [2023-12-21 22:14:43,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 22:14:43,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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 72 [2023-12-21 22:14:43,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:43,172 INFO L225 Difference]: With dead ends: 2968 [2023-12-21 22:14:43,172 INFO L226 Difference]: Without dead ends: 2578 [2023-12-21 22:14:43,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 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-21 22:14:43,174 INFO L413 NwaCegarLoop]: 4083 mSDtfsCounter, 4234 mSDsluCounter, 8108 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4245 SdHoareTripleChecker+Valid, 12191 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:43,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4245 Valid, 12191 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 22:14:43,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2023-12-21 22:14:43,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2578. [2023-12-21 22:14:43,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2578 states, 2514 states have (on average 1.7907716785998409) internal successors, (4502), 2518 states have internal predecessors, (4502), 37 states have call successors, (37), 25 states have call predecessors, (37), 25 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2023-12-21 22:14:43,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 4575 transitions. [2023-12-21 22:14:43,240 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 4575 transitions. Word has length 72 [2023-12-21 22:14:43,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:43,240 INFO L495 AbstractCegarLoop]: Abstraction has 2578 states and 4575 transitions. [2023-12-21 22:14:43,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 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-21 22:14:43,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 4575 transitions. [2023-12-21 22:14:43,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:14:43,242 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:43,242 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:14:43,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-21 22:14:43,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:43,445 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:43,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:43,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1983773337, now seen corresponding path program 1 times [2023-12-21 22:14:43,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:43,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1685380512] [2023-12-21 22:14:43,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:43,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:43,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:43,450 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:14:43,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-21 22:14:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:43,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:14:43,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:43,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 22:14:43,550 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:43,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:43,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1685380512] [2023-12-21 22:14:43,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1685380512] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:43,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:43,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:14:43,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626946922] [2023-12-21 22:14:43,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:43,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 22:14:43,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:43,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 22:14:43,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:14:43,552 INFO L87 Difference]: Start difference. First operand 2578 states and 4575 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:14:43,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:43,646 INFO L93 Difference]: Finished difference Result 3069 states and 5255 transitions. [2023-12-21 22:14:43,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 22:14:43,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2023-12-21 22:14:43,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:43,655 INFO L225 Difference]: With dead ends: 3069 [2023-12-21 22:14:43,655 INFO L226 Difference]: Without dead ends: 2622 [2023-12-21 22:14:43,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:14:43,657 INFO L413 NwaCegarLoop]: 4147 mSDtfsCounter, 29 mSDsluCounter, 8287 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 12434 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:43,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 12434 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:14:43,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2622 states. [2023-12-21 22:14:43,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2622 to 2582. [2023-12-21 22:14:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2582 states, 2518 states have (on average 1.7871326449563145) internal successors, (4500), 2522 states have internal predecessors, (4500), 37 states have call successors, (37), 25 states have call predecessors, (37), 25 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2023-12-21 22:14:43,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 4573 transitions. [2023-12-21 22:14:43,758 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 4573 transitions. Word has length 72 [2023-12-21 22:14:43,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:43,759 INFO L495 AbstractCegarLoop]: Abstraction has 2582 states and 4573 transitions. [2023-12-21 22:14:43,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:14:43,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 4573 transitions. [2023-12-21 22:14:43,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:14:43,760 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:43,760 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:14:43,763 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-21 22:14:43,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:43,964 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:43,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:43,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1090286999, now seen corresponding path program 1 times [2023-12-21 22:14:43,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:43,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349866100] [2023-12-21 22:14:43,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:43,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:43,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:43,968 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:14:43,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-21 22:14:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:44,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:14:44,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:44,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 22:14:44,056 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:44,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:44,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349866100] [2023-12-21 22:14:44,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349866100] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:44,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:44,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:14:44,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516490107] [2023-12-21 22:14:44,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:44,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 22:14:44,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:44,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 22:14:44,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:14:44,057 INFO L87 Difference]: Start difference. First operand 2582 states and 4573 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:14:44,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:44,141 INFO L93 Difference]: Finished difference Result 3065 states and 5235 transitions. [2023-12-21 22:14:44,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 22:14:44,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2023-12-21 22:14:44,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:44,162 INFO L225 Difference]: With dead ends: 3065 [2023-12-21 22:14:44,162 INFO L226 Difference]: Without dead ends: 2614 [2023-12-21 22:14:44,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:14:44,165 INFO L413 NwaCegarLoop]: 4147 mSDtfsCounter, 20 mSDsluCounter, 8288 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 12435 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:44,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 12435 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:14:44,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2614 states. [2023-12-21 22:14:44,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2614 to 2586. [2023-12-21 22:14:44,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2586 states, 2522 states have (on average 1.7835051546391754) internal successors, (4498), 2526 states have internal predecessors, (4498), 37 states have call successors, (37), 25 states have call predecessors, (37), 25 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2023-12-21 22:14:44,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 4571 transitions. [2023-12-21 22:14:44,215 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 4571 transitions. Word has length 72 [2023-12-21 22:14:44,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:44,216 INFO L495 AbstractCegarLoop]: Abstraction has 2586 states and 4571 transitions. [2023-12-21 22:14:44,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:14:44,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 4571 transitions. [2023-12-21 22:14:44,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:14:44,217 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:44,217 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:14:44,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-21 22:14:44,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:44,424 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:44,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:44,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1832872999, now seen corresponding path program 1 times [2023-12-21 22:14:44,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:44,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469758612] [2023-12-21 22:14:44,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:44,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:44,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:44,426 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:14:44,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-21 22:14:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:44,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:14:44,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:44,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 22:14:44,529 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:44,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:44,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469758612] [2023-12-21 22:14:44,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469758612] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:44,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:44,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 22:14:44,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968026184] [2023-12-21 22:14:44,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:44,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:14:44,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:44,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:14:44,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:14:44,530 INFO L87 Difference]: Start difference. First operand 2586 states and 4571 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:14:44,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:44,610 INFO L93 Difference]: Finished difference Result 3423 states and 5681 transitions. [2023-12-21 22:14:44,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:14:44,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2023-12-21 22:14:44,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:44,616 INFO L225 Difference]: With dead ends: 3423 [2023-12-21 22:14:44,616 INFO L226 Difference]: Without dead ends: 2968 [2023-12-21 22:14:44,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:14:44,618 INFO L413 NwaCegarLoop]: 4183 mSDtfsCounter, 4119 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4119 SdHoareTripleChecker+Valid, 4351 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:44,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4119 Valid, 4351 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:14:44,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2023-12-21 22:14:44,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 2962. [2023-12-21 22:14:44,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2962 states, 2850 states have (on average 1.729122807017544) internal successors, (4928), 2855 states have internal predecessors, (4928), 64 states have call successors, (64), 45 states have call predecessors, (64), 46 states have return successors, (64), 62 states have call predecessors, (64), 62 states have call successors, (64) [2023-12-21 22:14:44,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2962 states to 2962 states and 5056 transitions. [2023-12-21 22:14:44,680 INFO L78 Accepts]: Start accepts. Automaton has 2962 states and 5056 transitions. Word has length 72 [2023-12-21 22:14:44,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:44,681 INFO L495 AbstractCegarLoop]: Abstraction has 2962 states and 5056 transitions. [2023-12-21 22:14:44,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:14:44,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2962 states and 5056 transitions. [2023-12-21 22:14:44,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:14:44,682 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:44,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:14:44,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-21 22:14:44,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:44,893 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:44,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:44,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1938773626, now seen corresponding path program 1 times [2023-12-21 22:14:44,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:44,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716448513] [2023-12-21 22:14:44,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:44,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:44,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:44,895 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:14:44,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-21 22:14:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:44,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:14:44,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:44,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 22:14:44,973 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:44,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:44,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716448513] [2023-12-21 22:14:44,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716448513] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:44,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:44,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:14:44,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211987438] [2023-12-21 22:14:44,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:44,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 22:14:44,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:44,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 22:14:44,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:14:44,974 INFO L87 Difference]: Start difference. First operand 2962 states and 5056 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:14:45,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:45,068 INFO L93 Difference]: Finished difference Result 3873 states and 6281 transitions. [2023-12-21 22:14:45,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 22:14:45,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2023-12-21 22:14:45,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:45,075 INFO L225 Difference]: With dead ends: 3873 [2023-12-21 22:14:45,075 INFO L226 Difference]: Without dead ends: 3042 [2023-12-21 22:14:45,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:14:45,077 INFO L413 NwaCegarLoop]: 4150 mSDtfsCounter, 11 mSDsluCounter, 8294 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12444 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:45,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 12444 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:14:45,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2023-12-21 22:14:45,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 2978. [2023-12-21 22:14:45,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2978 states, 2866 states have (on average 1.7229588276343335) internal successors, (4938), 2871 states have internal predecessors, (4938), 64 states have call successors, (64), 45 states have call predecessors, (64), 46 states have return successors, (64), 62 states have call predecessors, (64), 62 states have call successors, (64) [2023-12-21 22:14:45,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2978 states to 2978 states and 5066 transitions. [2023-12-21 22:14:45,139 INFO L78 Accepts]: Start accepts. Automaton has 2978 states and 5066 transitions. Word has length 72 [2023-12-21 22:14:45,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:45,139 INFO L495 AbstractCegarLoop]: Abstraction has 2978 states and 5066 transitions. [2023-12-21 22:14:45,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:14:45,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2978 states and 5066 transitions. [2023-12-21 22:14:45,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:14:45,140 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:45,140 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:14:45,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-21 22:14:45,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:45,343 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:45,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:45,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1512188168, now seen corresponding path program 1 times [2023-12-21 22:14:45,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:45,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779461089] [2023-12-21 22:14:45,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:45,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:45,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:45,345 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:14:45,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-21 22:14:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:45,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:14:45,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:45,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 22:14:45,420 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:45,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:45,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779461089] [2023-12-21 22:14:45,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779461089] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:45,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:45,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:14:45,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692349941] [2023-12-21 22:14:45,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:45,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 22:14:45,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:45,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 22:14:45,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:14:45,421 INFO L87 Difference]: Start difference. First operand 2978 states and 5066 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:14:45,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:45,505 INFO L93 Difference]: Finished difference Result 3833 states and 6202 transitions. [2023-12-21 22:14:45,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 22:14:45,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2023-12-21 22:14:45,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:45,512 INFO L225 Difference]: With dead ends: 3833 [2023-12-21 22:14:45,512 INFO L226 Difference]: Without dead ends: 2986 [2023-12-21 22:14:45,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:14:45,514 INFO L413 NwaCegarLoop]: 4147 mSDtfsCounter, 2 mSDsluCounter, 8289 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 12436 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:45,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 12436 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:14:45,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2023-12-21 22:14:45,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2982. [2023-12-21 22:14:45,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2982 states, 2870 states have (on average 1.7177700348432057) internal successors, (4930), 2875 states have internal predecessors, (4930), 64 states have call successors, (64), 45 states have call predecessors, (64), 46 states have return successors, (64), 62 states have call predecessors, (64), 62 states have call successors, (64) [2023-12-21 22:14:45,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2982 states and 5058 transitions. [2023-12-21 22:14:45,575 INFO L78 Accepts]: Start accepts. Automaton has 2982 states and 5058 transitions. Word has length 72 [2023-12-21 22:14:45,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:45,577 INFO L495 AbstractCegarLoop]: Abstraction has 2982 states and 5058 transitions. [2023-12-21 22:14:45,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:14:45,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 5058 transitions. [2023-12-21 22:14:45,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:14:45,579 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:45,579 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:14:45,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-21 22:14:45,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:45,782 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:45,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:45,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1534820422, now seen corresponding path program 1 times [2023-12-21 22:14:45,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:45,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455895713] [2023-12-21 22:14:45,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:45,783 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:45,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:45,784 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:14:45,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-21 22:14:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:45,851 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:14:45,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:45,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 22:14:45,933 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:45,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:45,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455895713] [2023-12-21 22:14:45,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455895713] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:45,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:45,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 22:14:45,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911695836] [2023-12-21 22:14:45,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:45,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:14:45,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:45,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:14:45,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:14:45,934 INFO L87 Difference]: Start difference. First operand 2982 states and 5058 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 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-21 22:14:46,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:46,090 INFO L93 Difference]: Finished difference Result 4625 states and 7164 transitions. [2023-12-21 22:14:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:14:46,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 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 72 [2023-12-21 22:14:46,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:46,096 INFO L225 Difference]: With dead ends: 4625 [2023-12-21 22:14:46,096 INFO L226 Difference]: Without dead ends: 3774 [2023-12-21 22:14:46,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:14:46,098 INFO L413 NwaCegarLoop]: 4146 mSDtfsCounter, 4074 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4074 SdHoareTripleChecker+Valid, 4312 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:46,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4074 Valid, 4312 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:14:46,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3774 states. [2023-12-21 22:14:46,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3774 to 3770. [2023-12-21 22:14:46,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3770 states, 3554 states have (on average 1.625773776027012) internal successors, (5778), 3565 states have internal predecessors, (5778), 122 states have call successors, (122), 89 states have call predecessors, (122), 92 states have return successors, (124), 116 states have call predecessors, (124), 120 states have call successors, (124) [2023-12-21 22:14:46,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3770 states to 3770 states and 6024 transitions. [2023-12-21 22:14:46,170 INFO L78 Accepts]: Start accepts. Automaton has 3770 states and 6024 transitions. Word has length 72 [2023-12-21 22:14:46,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:46,170 INFO L495 AbstractCegarLoop]: Abstraction has 3770 states and 6024 transitions. [2023-12-21 22:14:46,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 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-21 22:14:46,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3770 states and 6024 transitions. [2023-12-21 22:14:46,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-21 22:14:46,171 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:46,172 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:14:46,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-21 22:14:46,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:46,375 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:46,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:46,375 INFO L85 PathProgramCache]: Analyzing trace with hash -185956495, now seen corresponding path program 1 times [2023-12-21 22:14:46,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:46,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293374067] [2023-12-21 22:14:46,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:46,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:46,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:46,377 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:14:46,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-21 22:14:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:46,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 22:14:46,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-21 22:14:46,553 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:46,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:46,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293374067] [2023-12-21 22:14:46,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1293374067] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:46,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:46,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:14:46,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723858125] [2023-12-21 22:14:46,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:46,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 22:14:46,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:46,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 22:14:46,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:14:46,554 INFO L87 Difference]: Start difference. First operand 3770 states and 6024 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-21 22:14:46,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:46,860 INFO L93 Difference]: Finished difference Result 7088 states and 10185 transitions. [2023-12-21 22:14:46,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 22:14:46,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 116 [2023-12-21 22:14:46,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:46,873 INFO L225 Difference]: With dead ends: 7088 [2023-12-21 22:14:46,873 INFO L226 Difference]: Without dead ends: 5450 [2023-12-21 22:14:46,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 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-21 22:14:46,879 INFO L413 NwaCegarLoop]: 4154 mSDtfsCounter, 4192 mSDsluCounter, 4221 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4198 SdHoareTripleChecker+Valid, 8375 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:46,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4198 Valid, 8375 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 22:14:46,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5450 states. [2023-12-21 22:14:46,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5450 to 5446. [2023-12-21 22:14:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5446 states, 5027 states have (on average 1.5116371593395663) internal successors, (7599), 5055 states have internal predecessors, (7599), 225 states have call successors, (225), 169 states have call predecessors, (225), 192 states have return successors, (271), 223 states have call predecessors, (271), 223 states have call successors, (271) [2023-12-21 22:14:47,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5446 states to 5446 states and 8095 transitions. [2023-12-21 22:14:47,008 INFO L78 Accepts]: Start accepts. Automaton has 5446 states and 8095 transitions. Word has length 116 [2023-12-21 22:14:47,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:47,008 INFO L495 AbstractCegarLoop]: Abstraction has 5446 states and 8095 transitions. [2023-12-21 22:14:47,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-21 22:14:47,008 INFO L276 IsEmpty]: Start isEmpty. Operand 5446 states and 8095 transitions. [2023-12-21 22:14:47,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-21 22:14:47,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:47,011 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:14:47,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-21 22:14:47,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:47,215 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:47,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:47,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1224541069, now seen corresponding path program 1 times [2023-12-21 22:14:47,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:47,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865924533] [2023-12-21 22:14:47,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:47,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:47,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:47,217 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:14:47,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-21 22:14:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:47,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:14:47,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:47,294 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-21 22:14:47,294 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:47,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:47,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865924533] [2023-12-21 22:14:47,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865924533] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:47,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:47,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:14:47,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518633480] [2023-12-21 22:14:47,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:47,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:14:47,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:47,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:14:47,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:14:47,295 INFO L87 Difference]: Start difference. First operand 5446 states and 8095 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-21 22:14:47,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:47,501 INFO L93 Difference]: Finished difference Result 8754 states and 12202 transitions. [2023-12-21 22:14:47,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:14:47,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 116 [2023-12-21 22:14:47,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:47,511 INFO L225 Difference]: With dead ends: 8754 [2023-12-21 22:14:47,511 INFO L226 Difference]: Without dead ends: 5440 [2023-12-21 22:14:47,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:14:47,518 INFO L413 NwaCegarLoop]: 4146 mSDtfsCounter, 200 mSDsluCounter, 3957 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 8103 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:47,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 8103 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:14:47,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2023-12-21 22:14:47,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5440. [2023-12-21 22:14:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5440 states, 5024 states have (on average 1.511345541401274) internal successors, (7593), 5051 states have internal predecessors, (7593), 222 states have call successors, (222), 169 states have call predecessors, (222), 192 states have return successors, (268), 220 states have call predecessors, (268), 220 states have call successors, (268) [2023-12-21 22:14:47,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5440 states to 5440 states and 8083 transitions. [2023-12-21 22:14:47,708 INFO L78 Accepts]: Start accepts. Automaton has 5440 states and 8083 transitions. Word has length 116 [2023-12-21 22:14:47,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:47,709 INFO L495 AbstractCegarLoop]: Abstraction has 5440 states and 8083 transitions. [2023-12-21 22:14:47,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-21 22:14:47,709 INFO L276 IsEmpty]: Start isEmpty. Operand 5440 states and 8083 transitions. [2023-12-21 22:14:47,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-21 22:14:47,711 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:47,711 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:14:47,717 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-21 22:14:47,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:47,914 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:47,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:47,915 INFO L85 PathProgramCache]: Analyzing trace with hash 2022072630, now seen corresponding path program 1 times [2023-12-21 22:14:47,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:47,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146764028] [2023-12-21 22:14:47,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:47,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:47,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:47,916 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:14:47,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-21 22:14:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:48,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 22:14:48,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:48,129 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-21 22:14:48,129 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:48,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:48,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146764028] [2023-12-21 22:14:48,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146764028] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:48,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:48,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:14:48,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116969583] [2023-12-21 22:14:48,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:48,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 22:14:48,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:48,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 22:14:48,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:14:48,131 INFO L87 Difference]: Start difference. First operand 5440 states and 8083 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-21 22:14:48,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:48,581 INFO L93 Difference]: Finished difference Result 12097 states and 16350 transitions. [2023-12-21 22:14:48,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 22:14:48,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 118 [2023-12-21 22:14:48,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:48,596 INFO L225 Difference]: With dead ends: 12097 [2023-12-21 22:14:48,596 INFO L226 Difference]: Without dead ends: 8789 [2023-12-21 22:14:48,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 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-21 22:14:48,601 INFO L413 NwaCegarLoop]: 4143 mSDtfsCounter, 4190 mSDsluCounter, 4203 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4196 SdHoareTripleChecker+Valid, 8346 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:48,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4196 Valid, 8346 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 22:14:48,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8789 states. [2023-12-21 22:14:48,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8789 to 8673. [2023-12-21 22:14:48,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8673 states, 7826 states have (on average 1.4091489905443393) internal successors, (11028), 7906 states have internal predecessors, (11028), 425 states have call successors, (425), 321 states have call predecessors, (425), 420 states have return successors, (603), 447 states have call predecessors, (603), 423 states have call successors, (603) [2023-12-21 22:14:48,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8673 states to 8673 states and 12056 transitions. [2023-12-21 22:14:48,847 INFO L78 Accepts]: Start accepts. Automaton has 8673 states and 12056 transitions. Word has length 118 [2023-12-21 22:14:48,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:48,848 INFO L495 AbstractCegarLoop]: Abstraction has 8673 states and 12056 transitions. [2023-12-21 22:14:48,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-21 22:14:48,848 INFO L276 IsEmpty]: Start isEmpty. Operand 8673 states and 12056 transitions. [2023-12-21 22:14:48,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-21 22:14:48,851 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:48,852 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:14:48,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-21 22:14:49,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:49,055 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:49,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:49,055 INFO L85 PathProgramCache]: Analyzing trace with hash -109278092, now seen corresponding path program 1 times [2023-12-21 22:14:49,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:49,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202161958] [2023-12-21 22:14:49,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:49,056 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:49,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:49,057 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:14:49,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-21 22:14:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:49,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:14:49,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-21 22:14:49,154 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:49,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:49,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202161958] [2023-12-21 22:14:49,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202161958] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:49,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:49,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:14:49,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204337673] [2023-12-21 22:14:49,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:49,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:14:49,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:49,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:14:49,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:14:49,155 INFO L87 Difference]: Start difference. First operand 8673 states and 12056 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-21 22:14:49,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:49,332 INFO L93 Difference]: Finished difference Result 13773 states and 18367 transitions. [2023-12-21 22:14:49,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:14:49,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 118 [2023-12-21 22:14:49,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:49,345 INFO L225 Difference]: With dead ends: 13773 [2023-12-21 22:14:49,345 INFO L226 Difference]: Without dead ends: 7232 [2023-12-21 22:14:49,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:14:49,358 INFO L413 NwaCegarLoop]: 4145 mSDtfsCounter, 198 mSDsluCounter, 3957 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 8102 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:49,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 8102 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:14:49,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7232 states. [2023-12-21 22:14:49,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7232 to 7232. [2023-12-21 22:14:49,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7232 states, 6576 states have (on average 1.444647201946472) internal successors, (9500), 6643 states have internal predecessors, (9500), 322 states have call successors, (322), 245 states have call predecessors, (322), 332 states have return successors, (464), 344 states have call predecessors, (464), 320 states have call successors, (464) [2023-12-21 22:14:49,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7232 states to 7232 states and 10286 transitions. [2023-12-21 22:14:49,668 INFO L78 Accepts]: Start accepts. Automaton has 7232 states and 10286 transitions. Word has length 118 [2023-12-21 22:14:49,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:49,668 INFO L495 AbstractCegarLoop]: Abstraction has 7232 states and 10286 transitions. [2023-12-21 22:14:49,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-21 22:14:49,669 INFO L276 IsEmpty]: Start isEmpty. Operand 7232 states and 10286 transitions. [2023-12-21 22:14:49,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-21 22:14:49,672 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:49,672 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:14:49,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-21 22:14:49,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:49,876 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:49,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:49,877 INFO L85 PathProgramCache]: Analyzing trace with hash 362221361, now seen corresponding path program 1 times [2023-12-21 22:14:49,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:49,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649465277] [2023-12-21 22:14:49,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:49,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:49,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:49,879 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:14:49,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-21 22:14:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:49,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 22:14:49,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:50,060 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-21 22:14:50,060 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:50,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:50,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649465277] [2023-12-21 22:14:50,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1649465277] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:50,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:50,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:14:50,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833211009] [2023-12-21 22:14:50,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:50,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 22:14:50,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:50,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 22:14:50,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:14:50,062 INFO L87 Difference]: Start difference. First operand 7232 states and 10286 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-21 22:14:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:50,536 INFO L93 Difference]: Finished difference Result 16488 states and 21779 transitions. [2023-12-21 22:14:50,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 22:14:50,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 120 [2023-12-21 22:14:50,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:50,556 INFO L225 Difference]: With dead ends: 16488 [2023-12-21 22:14:50,557 INFO L226 Difference]: Without dead ends: 11388 [2023-12-21 22:14:50,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 118 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-21 22:14:50,570 INFO L413 NwaCegarLoop]: 4159 mSDtfsCounter, 4172 mSDsluCounter, 4204 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4178 SdHoareTripleChecker+Valid, 8363 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:50,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4178 Valid, 8363 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 22:14:50,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11388 states. [2023-12-21 22:14:50,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11388 to 11384. [2023-12-21 22:14:50,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11384 states, 10173 states have (on average 1.3703922146859333) internal successors, (13941), 10305 states have internal predecessors, (13941), 593 states have call successors, (593), 441 states have call predecessors, (593), 616 states have return successors, (891), 639 states have call predecessors, (891), 591 states have call successors, (891) [2023-12-21 22:14:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11384 states to 11384 states and 15425 transitions. [2023-12-21 22:14:51,009 INFO L78 Accepts]: Start accepts. Automaton has 11384 states and 15425 transitions. Word has length 120 [2023-12-21 22:14:51,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:51,010 INFO L495 AbstractCegarLoop]: Abstraction has 11384 states and 15425 transitions. [2023-12-21 22:14:51,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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-21 22:14:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 11384 states and 15425 transitions. [2023-12-21 22:14:51,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-21 22:14:51,015 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:51,015 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:14:51,020 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-21 22:14:51,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:51,218 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:51,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:51,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1285141581, now seen corresponding path program 1 times [2023-12-21 22:14:51,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:51,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760473587] [2023-12-21 22:14:51,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:51,219 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:51,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:51,220 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:14:51,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-21 22:14:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:51,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:14:51,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:51,307 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-21 22:14:51,307 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:51,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:51,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760473587] [2023-12-21 22:14:51,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760473587] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:51,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:51,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:14:51,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595914662] [2023-12-21 22:14:51,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:51,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:14:51,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:51,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:14:51,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:14:51,310 INFO L87 Difference]: Start difference. First operand 11384 states and 15425 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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-21 22:14:51,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:51,702 INFO L93 Difference]: Finished difference Result 20632 states and 26868 transitions. [2023-12-21 22:14:51,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:14:51,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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 120 [2023-12-21 22:14:51,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:51,716 INFO L225 Difference]: With dead ends: 20632 [2023-12-21 22:14:51,717 INFO L226 Difference]: Without dead ends: 11380 [2023-12-21 22:14:51,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:14:51,726 INFO L413 NwaCegarLoop]: 4144 mSDtfsCounter, 196 mSDsluCounter, 3957 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 8101 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:51,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 8101 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:14:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11380 states. [2023-12-21 22:14:52,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11380 to 11380. [2023-12-21 22:14:52,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11380 states, 10172 states have (on average 1.3703303185214313) internal successors, (13939), 10303 states have internal predecessors, (13939), 590 states have call successors, (590), 441 states have call predecessors, (590), 616 states have return successors, (888), 636 states have call predecessors, (888), 588 states have call successors, (888) [2023-12-21 22:14:52,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11380 states to 11380 states and 15417 transitions. [2023-12-21 22:14:52,099 INFO L78 Accepts]: Start accepts. Automaton has 11380 states and 15417 transitions. Word has length 120 [2023-12-21 22:14:52,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:52,100 INFO L495 AbstractCegarLoop]: Abstraction has 11380 states and 15417 transitions. [2023-12-21 22:14:52,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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-21 22:14:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 11380 states and 15417 transitions. [2023-12-21 22:14:52,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-21 22:14:52,105 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:52,105 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:14:52,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-21 22:14:52,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:52,312 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:52,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:52,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1388900918, now seen corresponding path program 1 times [2023-12-21 22:14:52,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:52,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666340834] [2023-12-21 22:14:52,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:52,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:52,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:52,313 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:14:52,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-21 22:14:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:52,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:14:52,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:52,414 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-21 22:14:52,414 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:52,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:52,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666340834] [2023-12-21 22:14:52,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666340834] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:52,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:52,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:14:52,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231978135] [2023-12-21 22:14:52,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:52,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:14:52,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:52,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:14:52,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:14:52,416 INFO L87 Difference]: Start difference. First operand 11380 states and 15417 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-21 22:14:53,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:53,123 INFO L93 Difference]: Finished difference Result 27287 states and 35246 transitions. [2023-12-21 22:14:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:14:53,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 122 [2023-12-21 22:14:53,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:53,153 INFO L225 Difference]: With dead ends: 27287 [2023-12-21 22:14:53,153 INFO L226 Difference]: Without dead ends: 14752 [2023-12-21 22:14:53,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:14:53,170 INFO L413 NwaCegarLoop]: 4290 mSDtfsCounter, 150 mSDsluCounter, 4137 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 8427 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:53,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 8427 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:14:53,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14752 states. [2023-12-21 22:14:53,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14752 to 14752. [2023-12-21 22:14:53,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14752 states, 13088 states have (on average 1.3355745721271393) internal successors, (17480), 13247 states have internal predecessors, (17480), 834 states have call successors, (834), 613 states have call predecessors, (834), 828 states have return successors, (1266), 892 states have call predecessors, (1266), 832 states have call successors, (1266) [2023-12-21 22:14:53,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14752 states to 14752 states and 19580 transitions. [2023-12-21 22:14:53,751 INFO L78 Accepts]: Start accepts. Automaton has 14752 states and 19580 transitions. Word has length 122 [2023-12-21 22:14:53,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:53,752 INFO L495 AbstractCegarLoop]: Abstraction has 14752 states and 19580 transitions. [2023-12-21 22:14:53,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-21 22:14:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 14752 states and 19580 transitions. [2023-12-21 22:14:53,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-21 22:14:53,760 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:53,761 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-21 22:14:53,772 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-21 22:14:53,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:53,964 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:53,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:53,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1718016550, now seen corresponding path program 1 times [2023-12-21 22:14:53,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:53,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124180295] [2023-12-21 22:14:53,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:53,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:53,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:53,966 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:14:53,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-21 22:14:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:54,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:14:54,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:54,154 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-21 22:14:54,155 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:54,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:54,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124180295] [2023-12-21 22:14:54,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124180295] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:54,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:54,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 22:14:54,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031292933] [2023-12-21 22:14:54,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:54,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:14:54,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:54,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:14:54,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:14:54,156 INFO L87 Difference]: Start difference. First operand 14752 states and 19580 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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-21 22:14:54,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:54,845 INFO L93 Difference]: Finished difference Result 30815 states and 39540 transitions. [2023-12-21 22:14:54,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:14:54,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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 153 [2023-12-21 22:14:54,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:54,883 INFO L225 Difference]: With dead ends: 30815 [2023-12-21 22:14:54,883 INFO L226 Difference]: Without dead ends: 18194 [2023-12-21 22:14:54,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:14:54,906 INFO L413 NwaCegarLoop]: 4142 mSDtfsCounter, 4042 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4042 SdHoareTripleChecker+Valid, 4310 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:54,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4042 Valid, 4310 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:14:54,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18194 states. [2023-12-21 22:14:55,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18194 to 18158. [2023-12-21 22:14:55,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18158 states, 16030 states have (on average 1.3081721771678103) internal successors, (20970), 16221 states have internal predecessors, (20970), 1078 states have call successors, (1078), 785 states have call predecessors, (1078), 1048 states have return successors, (1614), 1152 states have call predecessors, (1614), 1076 states have call successors, (1614) [2023-12-21 22:14:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18158 states to 18158 states and 23662 transitions. [2023-12-21 22:14:55,731 INFO L78 Accepts]: Start accepts. Automaton has 18158 states and 23662 transitions. Word has length 153 [2023-12-21 22:14:55,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:55,731 INFO L495 AbstractCegarLoop]: Abstraction has 18158 states and 23662 transitions. [2023-12-21 22:14:55,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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-21 22:14:55,731 INFO L276 IsEmpty]: Start isEmpty. Operand 18158 states and 23662 transitions. [2023-12-21 22:14:55,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-12-21 22:14:55,744 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:55,744 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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2023-12-21 22:14:55,751 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-21 22:14:55,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:55,949 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:55,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:55,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1139819381, now seen corresponding path program 1 times [2023-12-21 22:14:55,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:55,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569667254] [2023-12-21 22:14:55,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:55,950 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:55,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:55,951 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:14:55,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-21 22:14:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:56,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:14:56,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-21 22:14:56,130 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:56,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:56,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569667254] [2023-12-21 22:14:56,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569667254] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:56,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:56,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:14:56,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448051267] [2023-12-21 22:14:56,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:56,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 22:14:56,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:56,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 22:14:56,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:14:56,132 INFO L87 Difference]: Start difference. First operand 18158 states and 23662 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-21 22:14:57,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:57,018 INFO L93 Difference]: Finished difference Result 34400 states and 43723 transitions. [2023-12-21 22:14:57,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 22:14:57,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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 174 [2023-12-21 22:14:57,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:57,054 INFO L225 Difference]: With dead ends: 34400 [2023-12-21 22:14:57,054 INFO L226 Difference]: Without dead ends: 18374 [2023-12-21 22:14:57,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 172 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-21 22:14:57,071 INFO L413 NwaCegarLoop]: 4106 mSDtfsCounter, 4180 mSDsluCounter, 4178 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4186 SdHoareTripleChecker+Valid, 8284 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:57,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4186 Valid, 8284 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 22:14:57,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18374 states. [2023-12-21 22:14:57,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18374 to 18374. [2023-12-21 22:14:57,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18374 states, 16214 states have (on average 1.2977673615394103) internal successors, (21042), 16421 states have internal predecessors, (21042), 1078 states have call successors, (1078), 785 states have call predecessors, (1078), 1080 states have return successors, (1482), 1168 states have call predecessors, (1482), 1076 states have call successors, (1482) [2023-12-21 22:14:57,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18374 states to 18374 states and 23602 transitions. [2023-12-21 22:14:57,867 INFO L78 Accepts]: Start accepts. Automaton has 18374 states and 23602 transitions. Word has length 174 [2023-12-21 22:14:57,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:57,867 INFO L495 AbstractCegarLoop]: Abstraction has 18374 states and 23602 transitions. [2023-12-21 22:14:57,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-21 22:14:57,867 INFO L276 IsEmpty]: Start isEmpty. Operand 18374 states and 23602 transitions. [2023-12-21 22:14:57,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-21 22:14:57,877 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:57,877 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:14:57,884 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-21 22:14:58,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:58,082 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:58,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:58,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1449842360, now seen corresponding path program 1 times [2023-12-21 22:14:58,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:58,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031774132] [2023-12-21 22:14:58,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:58,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:58,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:58,084 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:14:58,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-21 22:14:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:58,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:14:58,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:58,197 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-21 22:14:58,197 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:58,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:58,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031774132] [2023-12-21 22:14:58,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031774132] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:58,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:58,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:14:58,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192621913] [2023-12-21 22:14:58,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:58,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:14:58,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:58,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:14:58,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:14:58,199 INFO L87 Difference]: Start difference. First operand 18374 states and 23602 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, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-21 22:14:58,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:58,731 INFO L93 Difference]: Finished difference Result 28574 states and 36058 transitions. [2023-12-21 22:14:58,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:14:58,731 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, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 175 [2023-12-21 22:14:58,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:58,761 INFO L225 Difference]: With dead ends: 28574 [2023-12-21 22:14:58,761 INFO L226 Difference]: Without dead ends: 15718 [2023-12-21 22:14:58,781 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-21 22:14:58,782 INFO L413 NwaCegarLoop]: 4279 mSDtfsCounter, 155 mSDsluCounter, 4138 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 8417 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:58,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 8417 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:14:58,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15718 states. [2023-12-21 22:14:59,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15718 to 15714. [2023-12-21 22:14:59,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15714 states, 13902 states have (on average 1.3120414328873544) internal successors, (18240), 14083 states have internal predecessors, (18240), 894 states have call successors, (894), 649 states have call predecessors, (894), 916 states have return successors, (1258), 982 states have call predecessors, (1258), 892 states have call successors, (1258) [2023-12-21 22:14:59,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15714 states to 15714 states and 20392 transitions. [2023-12-21 22:14:59,440 INFO L78 Accepts]: Start accepts. Automaton has 15714 states and 20392 transitions. Word has length 175 [2023-12-21 22:14:59,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:59,440 INFO L495 AbstractCegarLoop]: Abstraction has 15714 states and 20392 transitions. [2023-12-21 22:14:59,440 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, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-21 22:14:59,440 INFO L276 IsEmpty]: Start isEmpty. Operand 15714 states and 20392 transitions. [2023-12-21 22:14:59,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-12-21 22:14:59,452 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:59,452 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 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-21 22:14:59,456 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 (24)] Ended with exit code 0 [2023-12-21 22:14:59,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:59,656 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:59,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:59,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1186432032, now seen corresponding path program 1 times [2023-12-21 22:14:59,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:59,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783492785] [2023-12-21 22:14:59,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:59,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:59,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:59,658 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:14:59,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-21 22:14:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:59,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:14:59,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:59,787 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-21 22:14:59,787 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:59,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:59,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783492785] [2023-12-21 22:14:59,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783492785] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:59,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:59,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:14:59,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858882643] [2023-12-21 22:14:59,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:59,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:14:59,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:59,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:14:59,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:14:59,789 INFO L87 Difference]: Start difference. First operand 15714 states and 20392 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-21 22:15:00,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:15:00,356 INFO L93 Difference]: Finished difference Result 27338 states and 34534 transitions. [2023-12-21 22:15:00,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:15:00,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 209 [2023-12-21 22:15:00,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:15:00,380 INFO L225 Difference]: With dead ends: 27338 [2023-12-21 22:15:00,380 INFO L226 Difference]: Without dead ends: 15718 [2023-12-21 22:15:00,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:15:00,394 INFO L413 NwaCegarLoop]: 4293 mSDtfsCounter, 152 mSDsluCounter, 4138 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 8431 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:15:00,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 8431 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:15:00,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15718 states. [2023-12-21 22:15:01,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15718 to 15714. [2023-12-21 22:15:01,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15714 states, 13902 states have (on average 1.3093080132355057) internal successors, (18202), 14083 states have internal predecessors, (18202), 894 states have call successors, (894), 649 states have call predecessors, (894), 916 states have return successors, (1240), 982 states have call predecessors, (1240), 892 states have call successors, (1240) [2023-12-21 22:15:01,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15714 states to 15714 states and 20336 transitions. [2023-12-21 22:15:01,047 INFO L78 Accepts]: Start accepts. Automaton has 15714 states and 20336 transitions. Word has length 209 [2023-12-21 22:15:01,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:15:01,047 INFO L495 AbstractCegarLoop]: Abstraction has 15714 states and 20336 transitions. [2023-12-21 22:15:01,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-21 22:15:01,047 INFO L276 IsEmpty]: Start isEmpty. Operand 15714 states and 20336 transitions. [2023-12-21 22:15:01,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2023-12-21 22:15:01,057 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:15:01,057 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 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, 1, 1, 1, 1, 1] [2023-12-21 22:15:01,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-12-21 22:15:01,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:15:01,266 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:15:01,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:15:01,266 INFO L85 PathProgramCache]: Analyzing trace with hash 820968673, now seen corresponding path program 1 times [2023-12-21 22:15:01,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:15:01,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341845182] [2023-12-21 22:15:01,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:15:01,267 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:15:01,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:15:01,268 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:15:01,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-12-21 22:15:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:15:01,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 22:15:01,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:15:01,539 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-12-21 22:15:01,539 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:15:01,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:15:01,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341845182] [2023-12-21 22:15:01,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341845182] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:15:01,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:15:01,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:15:01,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956777184] [2023-12-21 22:15:01,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:15:01,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 22:15:01,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:15:01,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 22:15:01,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:15:01,541 INFO L87 Difference]: Start difference. First operand 15714 states and 20336 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 22:15:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:15:02,319 INFO L93 Difference]: Finished difference Result 29412 states and 37403 transitions. [2023-12-21 22:15:02,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 22:15:02,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 210 [2023-12-21 22:15:02,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:15:02,343 INFO L225 Difference]: With dead ends: 29412 [2023-12-21 22:15:02,343 INFO L226 Difference]: Without dead ends: 15828 [2023-12-21 22:15:02,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 207 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-21 22:15:02,362 INFO L413 NwaCegarLoop]: 4076 mSDtfsCounter, 4147 mSDsluCounter, 4039 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4155 SdHoareTripleChecker+Valid, 8115 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 22:15:02,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4155 Valid, 8115 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 22:15:02,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15828 states. [2023-12-21 22:15:03,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15828 to 15828. [2023-12-21 22:15:03,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15828 states, 14084 states have (on average 1.268389662027833) internal successors, (17864), 14203 states have internal predecessors, (17864), 894 states have call successors, (894), 689 states have call predecessors, (894), 848 states have return successors, (1100), 936 states have call predecessors, (1100), 892 states have call successors, (1100) [2023-12-21 22:15:03,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15828 states to 15828 states and 19858 transitions. [2023-12-21 22:15:03,041 INFO L78 Accepts]: Start accepts. Automaton has 15828 states and 19858 transitions. Word has length 210 [2023-12-21 22:15:03,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:15:03,041 INFO L495 AbstractCegarLoop]: Abstraction has 15828 states and 19858 transitions. [2023-12-21 22:15:03,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 22:15:03,041 INFO L276 IsEmpty]: Start isEmpty. Operand 15828 states and 19858 transitions. [2023-12-21 22:15:03,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2023-12-21 22:15:03,050 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:15:03,050 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:15:03,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2023-12-21 22:15:03,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:15:03,251 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:15:03,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:15:03,251 INFO L85 PathProgramCache]: Analyzing trace with hash 115991386, now seen corresponding path program 1 times [2023-12-21 22:15:03,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:15:03,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054939922] [2023-12-21 22:15:03,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:15:03,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:15:03,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:15:03,253 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:15:03,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-21 22:15:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:15:03,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:15:03,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:15:03,468 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2023-12-21 22:15:03,469 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:15:03,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:15:03,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054939922] [2023-12-21 22:15:03,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1054939922] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:15:03,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:15:03,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 22:15:03,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888725282] [2023-12-21 22:15:03,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:15:03,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:15:03,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:15:03,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:15:03,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:15:03,470 INFO L87 Difference]: Start difference. First operand 15828 states and 19858 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 22:15:04,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:15:04,146 INFO L93 Difference]: Finished difference Result 31389 states and 37874 transitions. [2023-12-21 22:15:04,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:15:04,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 240 [2023-12-21 22:15:04,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:15:04,169 INFO L225 Difference]: With dead ends: 31389 [2023-12-21 22:15:04,169 INFO L226 Difference]: Without dead ends: 17692 [2023-12-21 22:15:04,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:15:04,182 INFO L413 NwaCegarLoop]: 4175 mSDtfsCounter, 4008 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4008 SdHoareTripleChecker+Valid, 4340 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:15:04,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4008 Valid, 4340 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:15:04,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17692 states. [2023-12-21 22:15:04,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17692 to 17652. [2023-12-21 22:15:04,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17652 states, 15668 states have (on average 1.250446770487618) internal successors, (19592), 15795 states have internal predecessors, (19592), 1030 states have call successors, (1030), 785 states have call predecessors, (1030), 952 states have return successors, (1244), 1072 states have call predecessors, (1244), 1028 states have call successors, (1244) [2023-12-21 22:15:04,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17652 states to 17652 states and 21866 transitions. [2023-12-21 22:15:04,917 INFO L78 Accepts]: Start accepts. Automaton has 17652 states and 21866 transitions. Word has length 240 [2023-12-21 22:15:04,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:15:04,918 INFO L495 AbstractCegarLoop]: Abstraction has 17652 states and 21866 transitions. [2023-12-21 22:15:04,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 22:15:04,918 INFO L276 IsEmpty]: Start isEmpty. Operand 17652 states and 21866 transitions. [2023-12-21 22:15:04,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2023-12-21 22:15:04,929 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:15:04,930 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:15:04,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-12-21 22:15:05,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:15:05,130 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:15:05,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:15:05,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1463976884, now seen corresponding path program 1 times [2023-12-21 22:15:05,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:15:05,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822253727] [2023-12-21 22:15:05,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:15:05,131 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:15:05,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:15:05,132 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:15:05,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-21 22:15:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:15:05,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:15:05,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:15:05,275 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-21 22:15:05,275 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:15:05,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:15:05,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822253727] [2023-12-21 22:15:05,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822253727] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:15:05,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:15:05,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:15:05,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570154375] [2023-12-21 22:15:05,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:15:05,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:15:05,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:15:05,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:15:05,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:15:05,278 INFO L87 Difference]: Start difference. First operand 17652 states and 21866 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-21 22:15:05,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:15:05,621 INFO L93 Difference]: Finished difference Result 21924 states and 26755 transitions. [2023-12-21 22:15:05,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:15:05,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 243 [2023-12-21 22:15:05,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:15:05,629 INFO L225 Difference]: With dead ends: 21924 [2023-12-21 22:15:05,629 INFO L226 Difference]: Without dead ends: 5866 [2023-12-21 22:15:05,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:15:05,643 INFO L413 NwaCegarLoop]: 4220 mSDtfsCounter, 147 mSDsluCounter, 4098 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 8318 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:15:05,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 8318 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:15:05,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5866 states. [2023-12-21 22:15:05,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5866 to 5866. [2023-12-21 22:15:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5866 states, 5370 states have (on average 1.4029795158286777) internal successors, (7534), 5391 states have internal predecessors, (7534), 282 states have call successors, (282), 197 states have call predecessors, (282), 212 states have return successors, (296), 278 states have call predecessors, (296), 280 states have call successors, (296) [2023-12-21 22:15:05,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5866 states to 5866 states and 8112 transitions. [2023-12-21 22:15:05,852 INFO L78 Accepts]: Start accepts. Automaton has 5866 states and 8112 transitions. Word has length 243 [2023-12-21 22:15:05,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:15:05,852 INFO L495 AbstractCegarLoop]: Abstraction has 5866 states and 8112 transitions. [2023-12-21 22:15:05,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-21 22:15:05,853 INFO L276 IsEmpty]: Start isEmpty. Operand 5866 states and 8112 transitions. [2023-12-21 22:15:05,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-21 22:15:05,856 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:15:05,857 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:15:05,862 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 (28)] Forceful destruction successful, exit code 0 [2023-12-21 22:15:06,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:15:06,059 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:15:06,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:15:06,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1980288167, now seen corresponding path program 1 times [2023-12-21 22:15:06,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:15:06,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683603001] [2023-12-21 22:15:06,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:15:06,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:15:06,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:15:06,060 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:15:06,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-12-21 22:15:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:15:06,164 INFO L262 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:15:06,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:15:06,219 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-21 22:15:06,219 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:15:06,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:15:06,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683603001] [2023-12-21 22:15:06,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [683603001] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:15:06,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:15:06,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:15:06,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186584264] [2023-12-21 22:15:06,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:15:06,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:15:06,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:15:06,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:15:06,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:15:06,221 INFO L87 Difference]: Start difference. First operand 5866 states and 8112 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-21 22:15:06,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:15:06,641 INFO L93 Difference]: Finished difference Result 10530 states and 13418 transitions. [2023-12-21 22:15:06,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:15:06,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 244 [2023-12-21 22:15:06,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:15:06,649 INFO L225 Difference]: With dead ends: 10530 [2023-12-21 22:15:06,649 INFO L226 Difference]: Without dead ends: 6352 [2023-12-21 22:15:06,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:15:06,654 INFO L413 NwaCegarLoop]: 4145 mSDtfsCounter, 4106 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4106 SdHoareTripleChecker+Valid, 4307 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:15:06,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4106 Valid, 4307 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:15:06,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6352 states. [2023-12-21 22:15:06,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6352 to 6312. [2023-12-21 22:15:06,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6312 states, 5756 states have (on average 1.379256428075052) internal successors, (7939), 5779 states have internal predecessors, (7939), 316 states have call successors, (316), 221 states have call predecessors, (316), 238 states have return successors, (342), 312 states have call predecessors, (342), 314 states have call successors, (342) [2023-12-21 22:15:06,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6312 states to 6312 states and 8597 transitions. [2023-12-21 22:15:06,886 INFO L78 Accepts]: Start accepts. Automaton has 6312 states and 8597 transitions. Word has length 244 [2023-12-21 22:15:06,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:15:06,886 INFO L495 AbstractCegarLoop]: Abstraction has 6312 states and 8597 transitions. [2023-12-21 22:15:06,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-21 22:15:06,886 INFO L276 IsEmpty]: Start isEmpty. Operand 6312 states and 8597 transitions. [2023-12-21 22:15:06,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-12-21 22:15:06,890 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:15:06,890 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:15:06,894 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 (29)] Ended with exit code 0 [2023-12-21 22:15:07,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:15:07,092 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:15:07,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:15:07,093 INFO L85 PathProgramCache]: Analyzing trace with hash -931771448, now seen corresponding path program 1 times [2023-12-21 22:15:07,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:15:07,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015725878] [2023-12-21 22:15:07,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:15:07,093 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:15:07,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:15:07,094 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:15:07,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-12-21 22:15:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:15:07,199 INFO L262 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:15:07,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:15:07,278 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-21 22:15:07,279 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:15:07,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:15:07,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2015725878] [2023-12-21 22:15:07,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2015725878] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:15:07,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:15:07,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:15:07,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952868256] [2023-12-21 22:15:07,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:15:07,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:15:07,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:15:07,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:15:07,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:15:07,281 INFO L87 Difference]: Start difference. First operand 6312 states and 8597 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-21 22:15:07,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:15:07,637 INFO L93 Difference]: Finished difference Result 11322 states and 14303 transitions. [2023-12-21 22:15:07,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:15:07,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 245 [2023-12-21 22:15:07,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:15:07,646 INFO L225 Difference]: With dead ends: 11322 [2023-12-21 22:15:07,646 INFO L226 Difference]: Without dead ends: 6738 [2023-12-21 22:15:07,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:15:07,651 INFO L413 NwaCegarLoop]: 4156 mSDtfsCounter, 4092 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4092 SdHoareTripleChecker+Valid, 4318 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:15:07,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4092 Valid, 4318 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:15:07,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6738 states. [2023-12-21 22:15:07,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6738 to 6674. [2023-12-21 22:15:07,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6674 states, 6066 states have (on average 1.3608638311902408) internal successors, (8255), 6091 states have internal predecessors, (8255), 346 states have call successors, (346), 241 states have call predecessors, (346), 260 states have return successors, (386), 342 states have call predecessors, (386), 344 states have call successors, (386) [2023-12-21 22:15:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6674 states to 6674 states and 8987 transitions. [2023-12-21 22:15:07,934 INFO L78 Accepts]: Start accepts. Automaton has 6674 states and 8987 transitions. Word has length 245 [2023-12-21 22:15:07,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:15:07,935 INFO L495 AbstractCegarLoop]: Abstraction has 6674 states and 8987 transitions. [2023-12-21 22:15:07,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-21 22:15:07,935 INFO L276 IsEmpty]: Start isEmpty. Operand 6674 states and 8987 transitions. [2023-12-21 22:15:07,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2023-12-21 22:15:07,939 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:15:07,939 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:15:07,943 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 (30)] Forceful destruction successful, exit code 0 [2023-12-21 22:15:08,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:15:08,143 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:15:08,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:15:08,144 INFO L85 PathProgramCache]: Analyzing trace with hash 567988646, now seen corresponding path program 1 times [2023-12-21 22:15:08,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:15:08,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749451383] [2023-12-21 22:15:08,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:15:08,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:15:08,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:15:08,145 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:15:08,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 (31)] Waiting until timeout for monitored process [2023-12-21 22:15:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:15:08,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:15:08,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:15:08,300 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-21 22:15:08,301 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:15:08,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:15:08,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749451383] [2023-12-21 22:15:08,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749451383] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:15:08,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:15:08,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:15:08,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783928752] [2023-12-21 22:15:08,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:15:08,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:15:08,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:15:08,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:15:08,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:15:08,302 INFO L87 Difference]: Start difference. First operand 6674 states and 8987 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-21 22:15:08,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:15:08,578 INFO L93 Difference]: Finished difference Result 9450 states and 12153 transitions. [2023-12-21 22:15:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:15:08,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 247 [2023-12-21 22:15:08,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:15:08,587 INFO L225 Difference]: With dead ends: 9450 [2023-12-21 22:15:08,587 INFO L226 Difference]: Without dead ends: 6676 [2023-12-21 22:15:08,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:15:08,592 INFO L413 NwaCegarLoop]: 4225 mSDtfsCounter, 135 mSDsluCounter, 4088 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 8313 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:15:08,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 8313 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:15:08,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6676 states. [2023-12-21 22:15:08,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6676 to 6674. [2023-12-21 22:15:08,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6674 states, 6066 states have (on average 1.3549291130893504) internal successors, (8219), 6091 states have internal predecessors, (8219), 346 states have call successors, (346), 241 states have call predecessors, (346), 260 states have return successors, (386), 342 states have call predecessors, (386), 344 states have call successors, (386) [2023-12-21 22:15:08,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6674 states to 6674 states and 8951 transitions. [2023-12-21 22:15:08,850 INFO L78 Accepts]: Start accepts. Automaton has 6674 states and 8951 transitions. Word has length 247 [2023-12-21 22:15:08,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:15:08,850 INFO L495 AbstractCegarLoop]: Abstraction has 6674 states and 8951 transitions. [2023-12-21 22:15:08,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-21 22:15:08,850 INFO L276 IsEmpty]: Start isEmpty. Operand 6674 states and 8951 transitions. [2023-12-21 22:15:08,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2023-12-21 22:15:08,854 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:15:08,854 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:15:08,858 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 (31)] Ended with exit code 0 [2023-12-21 22:15:09,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:15:09,056 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:15:09,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:15:09,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1802105414, now seen corresponding path program 1 times [2023-12-21 22:15:09,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:15:09,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675739077] [2023-12-21 22:15:09,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:15:09,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:15:09,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:15:09,058 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:15:09,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-12-21 22:15:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:15:09,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:15:09,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:15:09,233 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-12-21 22:15:09,233 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:15:09,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:15:09,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675739077] [2023-12-21 22:15:09,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [675739077] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:15:09,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:15:09,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:15:09,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480538022] [2023-12-21 22:15:09,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:15:09,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:15:09,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:15:09,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:15:09,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:15:09,235 INFO L87 Difference]: Start difference. First operand 6674 states and 8951 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-21 22:15:09,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:15:09,545 INFO L93 Difference]: Finished difference Result 10408 states and 13139 transitions. [2023-12-21 22:15:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:15:09,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 249 [2023-12-21 22:15:09,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:15:09,554 INFO L225 Difference]: With dead ends: 10408 [2023-12-21 22:15:09,554 INFO L226 Difference]: Without dead ends: 6674 [2023-12-21 22:15:09,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:15:09,560 INFO L413 NwaCegarLoop]: 4200 mSDtfsCounter, 141 mSDsluCounter, 4075 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 8275 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:15:09,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 8275 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:15:09,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6674 states. [2023-12-21 22:15:09,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6674 to 6674. [2023-12-21 22:15:09,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6674 states, 6066 states have (on average 1.3480052753049785) internal successors, (8177), 6091 states have internal predecessors, (8177), 346 states have call successors, (346), 241 states have call predecessors, (346), 260 states have return successors, (386), 342 states have call predecessors, (386), 344 states have call successors, (386) [2023-12-21 22:15:09,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6674 states to 6674 states and 8909 transitions. [2023-12-21 22:15:09,825 INFO L78 Accepts]: Start accepts. Automaton has 6674 states and 8909 transitions. Word has length 249 [2023-12-21 22:15:09,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:15:09,825 INFO L495 AbstractCegarLoop]: Abstraction has 6674 states and 8909 transitions. [2023-12-21 22:15:09,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-21 22:15:09,825 INFO L276 IsEmpty]: Start isEmpty. Operand 6674 states and 8909 transitions. [2023-12-21 22:15:09,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2023-12-21 22:15:09,829 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:15:09,829 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:15:09,833 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 (32)] Ended with exit code 0 [2023-12-21 22:15:10,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:15:10,032 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:15:10,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:15:10,033 INFO L85 PathProgramCache]: Analyzing trace with hash 404287636, now seen corresponding path program 1 times [2023-12-21 22:15:10,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:15:10,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784494858] [2023-12-21 22:15:10,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:15:10,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:15:10,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:15:10,034 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:15:10,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-12-21 22:15:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:15:10,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:15:10,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:15:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-12-21 22:15:10,181 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:15:10,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:15:10,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784494858] [2023-12-21 22:15:10,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1784494858] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:15:10,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:15:10,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:15:10,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261405083] [2023-12-21 22:15:10,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:15:10,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:15:10,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:15:10,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:15:10,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:15:10,183 INFO L87 Difference]: Start difference. First operand 6674 states and 8909 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-21 22:15:10,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:15:10,442 INFO L93 Difference]: Finished difference Result 7908 states and 10274 transitions. [2023-12-21 22:15:10,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:15:10,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 252 [2023-12-21 22:15:10,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:15:10,450 INFO L225 Difference]: With dead ends: 7908 [2023-12-21 22:15:10,451 INFO L226 Difference]: Without dead ends: 6056 [2023-12-21 22:15:10,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:15:10,454 INFO L413 NwaCegarLoop]: 4227 mSDtfsCounter, 161 mSDsluCounter, 4091 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 8318 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-21 22:15:10,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 8318 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:15:10,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2023-12-21 22:15:10,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 6056. [2023-12-21 22:15:10,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6056 states, 5534 states have (on average 1.372967112396097) internal successors, (7598), 5556 states have internal predecessors, (7598), 297 states have call successors, (297), 207 states have call predecessors, (297), 223 states have return successors, (315), 293 states have call predecessors, (315), 295 states have call successors, (315) [2023-12-21 22:15:10,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 8210 transitions. [2023-12-21 22:15:10,723 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 8210 transitions. Word has length 252 [2023-12-21 22:15:10,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:15:10,723 INFO L495 AbstractCegarLoop]: Abstraction has 6056 states and 8210 transitions. [2023-12-21 22:15:10,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-21 22:15:10,723 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 8210 transitions. [2023-12-21 22:15:10,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2023-12-21 22:15:10,727 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:15:10,727 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:15:10,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2023-12-21 22:15:10,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:15:10,928 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:15:10,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:15:10,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1661536288, now seen corresponding path program 2 times [2023-12-21 22:15:10,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:15:10,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735956117] [2023-12-21 22:15:10,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 22:15:10,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:15:10,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:15:10,930 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:15:10,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-12-21 22:15:11,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 22:15:11,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 22:15:11,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:15:11,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:15:11,078 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2023-12-21 22:15:11,078 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:15:11,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:15:11,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735956117] [2023-12-21 22:15:11,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735956117] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:15:11,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:15:11,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:15:11,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777217454] [2023-12-21 22:15:11,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:15:11,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:15:11,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:15:11,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:15:11,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:15:11,080 INFO L87 Difference]: Start difference. First operand 6056 states and 8210 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-21 22:15:11,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:15:11,322 INFO L93 Difference]: Finished difference Result 7100 states and 9340 transitions. [2023-12-21 22:15:11,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:15:11,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 254 [2023-12-21 22:15:11,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:15:11,329 INFO L225 Difference]: With dead ends: 7100 [2023-12-21 22:15:11,329 INFO L226 Difference]: Without dead ends: 5866 [2023-12-21 22:15:11,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:15:11,332 INFO L413 NwaCegarLoop]: 4262 mSDtfsCounter, 156 mSDsluCounter, 4099 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 8361 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-21 22:15:11,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 8361 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:15:11,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5866 states. [2023-12-21 22:15:11,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5866 to 5866. [2023-12-21 22:15:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5866 states, 5370 states have (on average 1.3810055865921789) internal successors, (7416), 5391 states have internal predecessors, (7416), 282 states have call successors, (282), 197 states have call predecessors, (282), 212 states have return successors, (296), 278 states have call predecessors, (296), 280 states have call successors, (296) [2023-12-21 22:15:11,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5866 states to 5866 states and 7994 transitions. [2023-12-21 22:15:11,551 INFO L78 Accepts]: Start accepts. Automaton has 5866 states and 7994 transitions. Word has length 254 [2023-12-21 22:15:11,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:15:11,552 INFO L495 AbstractCegarLoop]: Abstraction has 5866 states and 7994 transitions. [2023-12-21 22:15:11,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-21 22:15:11,552 INFO L276 IsEmpty]: Start isEmpty. Operand 5866 states and 7994 transitions. [2023-12-21 22:15:11,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2023-12-21 22:15:11,555 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:15:11,555 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:15:11,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2023-12-21 22:15:11,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:15:11,759 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:15:11,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:15:11,760 INFO L85 PathProgramCache]: Analyzing trace with hash 707003634, now seen corresponding path program 3 times [2023-12-21 22:15:11,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:15:11,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641751718] [2023-12-21 22:15:11,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 22:15:11,760 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:15:11,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:15:11,761 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:15:11,762 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 (35)] Waiting until timeout for monitored process [2023-12-21 22:15:11,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-21 22:15:11,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 22:15:11,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 22:15:11,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:15:12,186 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 124 proven. 159 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 22:15:12,186 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 22:15:12,302 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2023-12-21 22:15:12,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:15:12,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641751718] [2023-12-21 22:15:12,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641751718] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 22:15:12,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 22:15:12,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2023-12-21 22:15:12,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158681222] [2023-12-21 22:15:12,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:15:12,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 22:15:12,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:15:12,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 22:15:12,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 22:15:12,303 INFO L87 Difference]: Start difference. First operand 5866 states and 7994 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-12-21 22:15:13,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:15:13,013 INFO L93 Difference]: Finished difference Result 5868 states and 7995 transitions. [2023-12-21 22:15:13,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 22:15:13,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 255 [2023-12-21 22:15:13,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:15:13,020 INFO L225 Difference]: With dead ends: 5868 [2023-12-21 22:15:13,020 INFO L226 Difference]: Without dead ends: 5865 [2023-12-21 22:15:13,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 22:15:13,021 INFO L413 NwaCegarLoop]: 4429 mSDtfsCounter, 4434 mSDsluCounter, 13020 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4434 SdHoareTripleChecker+Valid, 17449 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 22:15:13,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4434 Valid, 17449 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 22:15:13,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5865 states. [2023-12-21 22:15:13,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5865 to 5865. [2023-12-21 22:15:13,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5865 states, 5370 states have (on average 1.380633147113594) internal successors, (7414), 5390 states have internal predecessors, (7414), 281 states have call successors, (281), 197 states have call predecessors, (281), 212 states have return successors, (296), 278 states have call predecessors, (296), 280 states have call successors, (296) [2023-12-21 22:15:13,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5865 states to 5865 states and 7991 transitions. [2023-12-21 22:15:13,267 INFO L78 Accepts]: Start accepts. Automaton has 5865 states and 7991 transitions. Word has length 255 [2023-12-21 22:15:13,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:15:13,267 INFO L495 AbstractCegarLoop]: Abstraction has 5865 states and 7991 transitions. [2023-12-21 22:15:13,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-12-21 22:15:13,267 INFO L276 IsEmpty]: Start isEmpty. Operand 5865 states and 7991 transitions. [2023-12-21 22:15:13,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2023-12-21 22:15:13,272 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:15:13,272 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:15:13,278 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 (35)] Forceful destruction successful, exit code 0 [2023-12-21 22:15:13,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:15:13,476 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:15:13,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:15:13,476 INFO L85 PathProgramCache]: Analyzing trace with hash -2026768870, now seen corresponding path program 1 times [2023-12-21 22:15:13,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:15:13,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856356587] [2023-12-21 22:15:13,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:15:13,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:15:13,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:15:13,478 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:15:13,492 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 (36)] Waiting until timeout for monitored process [2023-12-21 22:15:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:15:13,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:15:13,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:15:13,597 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2023-12-21 22:15:13,597 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:15:13,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:15:13,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856356587] [2023-12-21 22:15:13,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856356587] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:15:13,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:15:13,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:15:13,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781509290] [2023-12-21 22:15:13,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:15:13,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:15:13,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:15:13,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:15:13,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:15:13,599 INFO L87 Difference]: Start difference. First operand 5865 states and 7991 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-21 22:15:13,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:15:13,854 INFO L93 Difference]: Finished difference Result 6918 states and 9121 transitions. [2023-12-21 22:15:13,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:15:13,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 259 [2023-12-21 22:15:13,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:15:13,863 INFO L225 Difference]: With dead ends: 6918 [2023-12-21 22:15:13,864 INFO L226 Difference]: Without dead ends: 5875 [2023-12-21 22:15:13,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:15:13,867 INFO L413 NwaCegarLoop]: 4137 mSDtfsCounter, 3 mSDsluCounter, 4123 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8260 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:15:13,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8260 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:15:13,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5875 states. [2023-12-21 22:15:14,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5875 to 5867. [2023-12-21 22:15:14,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5867 states, 5372 states have (on average 1.3804914370811616) internal successors, (7416), 5392 states have internal predecessors, (7416), 281 states have call successors, (281), 197 states have call predecessors, (281), 212 states have return successors, (296), 278 states have call predecessors, (296), 280 states have call successors, (296) [2023-12-21 22:15:14,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5867 states to 5867 states and 7993 transitions. [2023-12-21 22:15:14,116 INFO L78 Accepts]: Start accepts. Automaton has 5867 states and 7993 transitions. Word has length 259 [2023-12-21 22:15:14,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:15:14,116 INFO L495 AbstractCegarLoop]: Abstraction has 5867 states and 7993 transitions. [2023-12-21 22:15:14,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-21 22:15:14,116 INFO L276 IsEmpty]: Start isEmpty. Operand 5867 states and 7993 transitions. [2023-12-21 22:15:14,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2023-12-21 22:15:14,120 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:15:14,120 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:15:14,124 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 (36)] Ended with exit code 0 [2023-12-21 22:15:14,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:15:14,321 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:15:14,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:15:14,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1471158139, now seen corresponding path program 1 times [2023-12-21 22:15:14,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:15:14,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290351453] [2023-12-21 22:15:14,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:15:14,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:15:14,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:15:14,323 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 22:15:14,337 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 (37)] Waiting until timeout for monitored process [2023-12-21 22:15:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 22:15:14,432 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 22:15:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 22:15:14,666 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-21 22:15:14,666 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 22:15:14,667 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-21 22:15:14,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-21 22:15:14,675 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 (37)] Forceful destruction successful, exit code 0 [2023-12-21 22:15:14,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:15:14,878 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:15:14,881 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 22:15:15,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 10:15:15 BoogieIcfgContainer [2023-12-21 22:15:15,028 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 22:15:15,029 INFO L158 Benchmark]: Toolchain (without parser) took 47064.11ms. Allocated memory was 192.9MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 122.0MB in the beginning and 944.6MB in the end (delta: -822.6MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2023-12-21 22:15:15,029 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 192.9MB. Free memory is still 150.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 22:15:15,029 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2165.22ms. Allocated memory was 192.9MB in the beginning and 268.4MB in the end (delta: 75.5MB). Free memory was 121.6MB in the beginning and 99.8MB in the end (delta: 21.7MB). Peak memory consumption was 114.3MB. Max. memory is 8.0GB. [2023-12-21 22:15:15,032 INFO L158 Benchmark]: Boogie Procedure Inliner took 382.21ms. Allocated memory is still 268.4MB. Free memory was 99.8MB in the beginning and 133.5MB in the end (delta: -33.6MB). Peak memory consumption was 72.9MB. Max. memory is 8.0GB. [2023-12-21 22:15:15,034 INFO L158 Benchmark]: Boogie Preprocessor took 363.43ms. Allocated memory was 268.4MB in the beginning and 466.6MB in the end (delta: 198.2MB). Free memory was 133.5MB in the beginning and 296.5MB in the end (delta: -163.1MB). Peak memory consumption was 76.0MB. Max. memory is 8.0GB. [2023-12-21 22:15:15,034 INFO L158 Benchmark]: RCFGBuilder took 7444.66ms. Allocated memory was 466.6MB in the beginning and 1.1GB in the end (delta: 625.0MB). Free memory was 296.5MB in the beginning and 743.3MB in the end (delta: -446.8MB). Peak memory consumption was 406.8MB. Max. memory is 8.0GB. [2023-12-21 22:15:15,034 INFO L158 Benchmark]: TraceAbstraction took 36701.97ms. Allocated memory was 1.1GB in the beginning and 2.8GB in the end (delta: 1.7GB). Free memory was 742.8MB in the beginning and 944.6MB in the end (delta: -201.8MB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2023-12-21 22:15:15,035 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 192.9MB. Free memory is still 150.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 2165.22ms. Allocated memory was 192.9MB in the beginning and 268.4MB in the end (delta: 75.5MB). Free memory was 121.6MB in the beginning and 99.8MB in the end (delta: 21.7MB). Peak memory consumption was 114.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 382.21ms. Allocated memory is still 268.4MB. Free memory was 99.8MB in the beginning and 133.5MB in the end (delta: -33.6MB). Peak memory consumption was 72.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 363.43ms. Allocated memory was 268.4MB in the beginning and 466.6MB in the end (delta: 198.2MB). Free memory was 133.5MB in the beginning and 296.5MB in the end (delta: -163.1MB). Peak memory consumption was 76.0MB. Max. memory is 8.0GB. * RCFGBuilder took 7444.66ms. Allocated memory was 466.6MB in the beginning and 1.1GB in the end (delta: 625.0MB). Free memory was 296.5MB in the beginning and 743.3MB in the end (delta: -446.8MB). Peak memory consumption was 406.8MB. Max. memory is 8.0GB. * TraceAbstraction took 36701.97ms. Allocated memory was 1.1GB in the beginning and 2.8GB in the end (delta: 1.7GB). Free memory was 742.8MB in the beginning and 944.6MB in the end (delta: -201.8MB). Peak memory consumption was 1.5GB. 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 t3_pc = 0; [L11181] int m_st ; [L11182] int t1_st ; [L11183] int t2_st ; [L11184] int t3_st ; [L11185] int m_i ; [L11186] int t1_i ; [L11187] int t2_i ; [L11188] int t3_i ; [L11189] int M_E = 2; [L11190] int T1_E = 2; [L11191] int T2_E = 2; [L11192] int T3_E = 2; [L11193] int E_M = 2; [L11194] int E_1 = 2; [L11195] int E_2 = 2; [L11196] int E_3 = 2; [L11202] int token ; [L11204] int local ; [L11901] COND FALSE !(__VERIFIER_nondet_int()) [L11904] CALL main2() [L11888] int __retres1 ; [L11892] CALL init_model() [L11801] m_i = 1 [L11802] t1_i = 1 [L11803] t2_i = 1 [L11804] t3_i = 1 [L11892] RET init_model() [L11893] CALL start_simulation() [L11829] int kernel_st ; [L11830] int tmp ; [L11831] int tmp___0 ; [L11835] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11836] FCALL update_channels() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11837] CALL init_threads() [L11457] COND TRUE m_i == 1 [L11458] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11462] COND TRUE t1_i == 1 [L11463] t1_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11467] COND TRUE t2_i == 1 [L11468] t2_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11472] COND TRUE t3_i == 1 [L11473] t3_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11837] RET init_threads() [L11838] CALL fire_delta_events() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11594] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11599] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11604] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11609] COND FALSE !(T3_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11614] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11619] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11624] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11629] COND FALSE !(E_3 == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11838] RET fire_delta_events() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11839] CALL activate_threads() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11687] int tmp ; [L11688] int tmp___0 ; [L11689] int tmp___1 ; [L11690] int tmp___2 ; [L11694] CALL, EXPR is_master_triggered() [L11370] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11373] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11383] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11385] return (__retres1); [L11694] RET, EXPR is_master_triggered() [L11694] tmp = is_master_triggered() [L11696] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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, t3_i=1, t3_pc=0, t3_st=0, tmp=0, token=0] [L11702] CALL, EXPR is_transmit1_triggered() [L11389] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11392] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11402] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11404] return (__retres1); [L11702] RET, EXPR is_transmit1_triggered() [L11702] tmp___0 = is_transmit1_triggered() [L11704] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, token=0] [L11710] CALL, EXPR is_transmit2_triggered() [L11408] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11411] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11421] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11423] return (__retres1); [L11710] RET, EXPR is_transmit2_triggered() [L11710] tmp___1 = is_transmit2_triggered() [L11712] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L11718] CALL, EXPR is_transmit3_triggered() [L11427] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11430] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11440] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11442] return (__retres1); [L11718] RET, EXPR is_transmit3_triggered() [L11718] tmp___2 = is_transmit3_triggered() [L11720] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_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, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=0, token=0] [L11839] RET activate_threads() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11840] CALL reset_delta_events() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11642] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11647] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11652] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11657] COND FALSE !(T3_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11662] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11667] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11672] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11677] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11840] RET reset_delta_events() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11843] COND TRUE 1 [L11846] kernel_st = 1 [L11847] CALL eval() [L11513] int tmp ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11517] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11520] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11482] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11485] COND TRUE m_st == 0 [L11486] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11508] return (__retres1); [L11520] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11520] tmp = exists_runnable_thread() [L11522] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=0, t3_st=0, tmp=1, token=0] [L11527] COND TRUE m_st == 0 [L11528] int tmp_ndt_1; [L11529] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L11530] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=0, t3_st=0, tmp=1, tmp_ndt_1=0, token=0] [L11527-L11538] { 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_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=0, t3_st=0, tmp=1, token=0] [L11541] COND TRUE t1_st == 0 [L11542] int tmp_ndt_2; [L11543] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L11544] COND TRUE, EXPR \read(tmp_ndt_2) [L11546] EXPR t1_st = 1 [L11547] CALL, EXPR transmit1() [L11265] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11276] COND TRUE 1 [L11278] t1_pc = 1 [L11279] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11547] RET, EXPR transmit1() [L11541-L11552] { 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_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=0, t3_st=0, tmp=1, token=0] [L11555] COND TRUE t2_st == 0 [L11556] int tmp_ndt_3; [L11557] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L11558] COND TRUE, EXPR \read(tmp_ndt_3) [L11560] EXPR t2_st = 1 [L11561] CALL, EXPR transmit2() [L11301] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11312] COND TRUE 1 [L11314] t2_pc = 1 [L11315] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11561] RET, EXPR transmit2() [L11555-L11566] { 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_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=0, t3_st=0, tmp=1, token=0] [L11569] COND TRUE t3_st == 0 [L11570] int tmp_ndt_4; [L11571] EXPR tmp_ndt_4 = __VERIFIER_nondet_int() [L11572] COND TRUE, EXPR \read(tmp_ndt_4) [L11574] EXPR t3_st = 1 [L11575] CALL, EXPR transmit3() [L11337] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=0, t3_st=1, token=0] [L11348] COND TRUE 1 [L11350] t3_pc = 1 [L11351] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11575] RET, EXPR transmit3() [L11569-L11580] { int tmp_ndt_4; tmp_ndt_4 = __VERIFIER_nondet_int(); if (tmp_ndt_4) { { t3_st = 1; transmit3(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=0] [L11517] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=0] [L11520] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11482] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11485] COND TRUE m_st == 0 [L11486] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11508] return (__retres1); [L11520] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=0] [L11520] tmp = exists_runnable_thread() [L11522] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=0] [L11527] COND TRUE m_st == 0 [L11528] int tmp_ndt_1; [L11529] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L11530] COND TRUE, EXPR \read(tmp_ndt_1) [L11532] EXPR m_st = 1 [L11533] CALL, EXPR master() [L11207] int tmp_var = __VERIFIER_nondet_int(); [L11209] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11220] COND TRUE 1 [L11223] token = __VERIFIER_nondet_int() [L11224] local = token [L11225] E_1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11226] CALL immediate_notify() VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11734] CALL activate_threads() VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11687] int tmp ; [L11688] int tmp___0 ; [L11689] int tmp___1 ; [L11690] int tmp___2 ; [L11694] CALL, EXPR is_master_triggered() [L11370] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11373] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11383] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11385] return (__retres1); [L11694] RET, EXPR is_master_triggered() [L11694] tmp = is_master_triggered() [L11696] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=0] [L11702] CALL, EXPR is_transmit1_triggered() [L11389] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11392] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11393] COND TRUE E_1 == 1 [L11394] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11404] return (__retres1); [L11702] RET, EXPR is_transmit1_triggered() [L11702] tmp___0 = is_transmit1_triggered() [L11704] COND TRUE \read(tmp___0) [L11705] t1_st = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, token=0] [L11710] CALL, EXPR is_transmit2_triggered() [L11408] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11411] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11412] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11421] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11423] return (__retres1); [L11710] RET, EXPR is_transmit2_triggered() [L11710] tmp___1 = is_transmit2_triggered() [L11712] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L11718] CALL, EXPR is_transmit3_triggered() [L11427] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11430] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11431] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11440] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11442] return (__retres1); [L11718] RET, EXPR is_transmit3_triggered() [L11718] tmp___2 = is_transmit3_triggered() [L11720] COND FALSE !(\read(tmp___2)) VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, tmp___2=0, token=0] [L11734] RET activate_threads() VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11226] RET immediate_notify() VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11227] E_1 = 2 [L11228] m_pc = 1 [L11229] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11533] RET, EXPR master() [L11527-L11538] { 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_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=0] [L11541] COND TRUE t1_st == 0 [L11542] int tmp_ndt_2; [L11543] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L11544] COND TRUE, EXPR \read(tmp_ndt_2) [L11546] EXPR t1_st = 1 [L11547] CALL, EXPR transmit1() [L11265] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11268] COND TRUE t1_pc == 1 [L11284] token += 1 [L11285] E_2 = 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11286] CALL immediate_notify() VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11734] CALL activate_threads() VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11687] int tmp ; [L11688] int tmp___0 ; [L11689] int tmp___1 ; [L11690] int tmp___2 ; [L11694] CALL, EXPR is_master_triggered() [L11370] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11373] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11374] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11383] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11385] return (__retres1); [L11694] RET, EXPR is_master_triggered() [L11694] tmp = is_master_triggered() [L11696] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=1] [L11702] CALL, EXPR is_transmit1_triggered() [L11389] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11392] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11393] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11402] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11404] return (__retres1); [L11702] RET, EXPR is_transmit1_triggered() [L11702] tmp___0 = is_transmit1_triggered() [L11704] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=1] [L11710] CALL, EXPR is_transmit2_triggered() [L11408] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11411] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11412] COND TRUE E_2 == 1 [L11413] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11423] return (__retres1); [L11710] RET, EXPR is_transmit2_triggered() [L11710] tmp___1 = is_transmit2_triggered() [L11712] COND TRUE \read(tmp___1) [L11713] t2_st = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, token=1] [L11718] CALL, EXPR is_transmit3_triggered() [L11427] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11430] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11431] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11440] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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=0, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11442] return (__retres1); [L11718] RET, EXPR is_transmit3_triggered() [L11718] tmp___2 = is_transmit3_triggered() [L11720] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, tmp___2=0, token=1] [L11734] RET activate_threads() VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_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, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11286] RET immediate_notify() VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11287] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11276] COND TRUE 1 [L11278] t1_pc = 1 [L11279] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11547] RET, EXPR transmit1() [L11541-L11552] { 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_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=1] [L11555] COND TRUE t2_st == 0 [L11556] int tmp_ndt_3; [L11557] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L11558] COND TRUE, EXPR \read(tmp_ndt_3) [L11560] EXPR t2_st = 1 [L11561] CALL, EXPR transmit2() [L11301] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11304] COND TRUE t2_pc == 1 [L11320] token += 1 [L11321] E_3 = 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11322] CALL immediate_notify() VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11734] CALL activate_threads() VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11687] int tmp ; [L11688] int tmp___0 ; [L11689] int tmp___1 ; [L11690] int tmp___2 ; [L11694] CALL, EXPR is_master_triggered() [L11370] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11373] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11374] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11383] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11385] return (__retres1); [L11694] RET, EXPR is_master_triggered() [L11694] tmp = is_master_triggered() [L11696] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=2] [L11702] CALL, EXPR is_transmit1_triggered() [L11389] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11392] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11393] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11402] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11404] return (__retres1); [L11702] RET, EXPR is_transmit1_triggered() [L11702] tmp___0 = is_transmit1_triggered() [L11704] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=2] [L11710] CALL, EXPR is_transmit2_triggered() [L11408] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11411] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11412] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11421] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11423] return (__retres1); [L11710] RET, EXPR is_transmit2_triggered() [L11710] tmp___1 = is_transmit2_triggered() [L11712] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=0, token=2] [L11718] CALL, EXPR is_transmit3_triggered() [L11427] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11430] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11431] COND TRUE E_3 == 1 [L11432] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11442] return (__retres1); [L11718] RET, EXPR is_transmit3_triggered() [L11718] tmp___2 = is_transmit3_triggered() [L11720] COND TRUE \read(tmp___2) [L11721] t3_st = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=1, token=2] [L11734] RET activate_threads() VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_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=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=0, token=2] [L11322] RET immediate_notify() VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=0, token=2] [L11323] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=0, token=2] [L11312] COND TRUE 1 [L11314] t2_pc = 1 [L11315] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L11561] RET, EXPR transmit2() [L11555-L11566] { 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_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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=2, t3_i=1, t3_pc=1, t3_st=0, tmp=1, token=2] [L11569] COND TRUE t3_st == 0 [L11570] int tmp_ndt_4; [L11571] EXPR tmp_ndt_4 = __VERIFIER_nondet_int() [L11572] COND TRUE, EXPR \read(tmp_ndt_4) [L11574] EXPR t3_st = 1 [L11575] CALL, EXPR transmit3() [L11337] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L11340] COND TRUE t3_pc == 1 [L11356] token += 1 [L11357] E_M = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_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=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11358] CALL immediate_notify() VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11734] CALL activate_threads() VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11687] int tmp ; [L11688] int tmp___0 ; [L11689] int tmp___1 ; [L11690] int tmp___2 ; [L11694] CALL, EXPR is_master_triggered() [L11370] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11373] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11374] COND TRUE E_M == 1 [L11375] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11385] return (__retres1); [L11694] RET, EXPR is_master_triggered() [L11694] tmp = is_master_triggered() [L11696] COND TRUE \read(tmp) [L11697] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, token=3] [L11702] CALL, EXPR is_transmit1_triggered() [L11389] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11392] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11393] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11402] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11404] return (__retres1); [L11702] RET, EXPR is_transmit1_triggered() [L11702] tmp___0 = is_transmit1_triggered() [L11704] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, token=3] [L11710] CALL, EXPR is_transmit2_triggered() [L11408] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11411] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11412] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11421] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11423] return (__retres1); [L11710] RET, EXPR is_transmit2_triggered() [L11710] tmp___1 = is_transmit2_triggered() [L11712] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, tmp___1=0, token=3] [L11718] CALL, EXPR is_transmit3_triggered() [L11427] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11430] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11431] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11440] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11442] return (__retres1); [L11718] RET, EXPR is_transmit3_triggered() [L11718] tmp___2 = is_transmit3_triggered() [L11720] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, token=3] [L11734] RET activate_threads() VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_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=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11358] RET immediate_notify() VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11359] E_M = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11348] COND TRUE 1 [L11350] t3_pc = 1 [L11351] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, token=3] [L11575] RET, EXPR transmit3() [L11569-L11580] { int tmp_ndt_4; tmp_ndt_4 = __VERIFIER_nondet_int(); if (tmp_ndt_4) { { t3_st = 1; transmit3(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=3] [L11517] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=3] [L11520] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, token=3] [L11482] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, token=3] [L11485] COND TRUE m_st == 0 [L11486] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, token=3] [L11508] return (__retres1); [L11520] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=3] [L11520] tmp = exists_runnable_thread() [L11522] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=3] [L11527] COND TRUE m_st == 0 [L11528] int tmp_ndt_1; [L11529] tmp_ndt_1 = __VERIFIER_nondet_int() [L11530] COND TRUE \read(tmp_ndt_1) [L11532] m_st = 1 [L11533] CALL master() [L11207] int tmp_var = __VERIFIER_nondet_int(); [L11209] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, token=3] [L11212] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, token=3] [L11234] COND FALSE !(token != local + 3) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, token=3] [L11239] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L11240] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L11245] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L11246] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L11247] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L11248] CALL error() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, token=3] [L11173] reach_error() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_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, t3_i=1, t3_pc=1, t3_st=2, token=3] - UnprovableResult [Line: 11094]: 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, 2272 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 36.5s, OverallIterations: 36, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.2s, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81467 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81357 mSDsluCounter, 319739 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 173901 mSDsCounter, 426 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4011 IncrementalHoareTripleChecker+Invalid, 4437 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 426 mSolverCounterUnsat, 145838 mSDtfsCounter, 4011 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5410 GetRequests, 5337 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18374occurred in iteration=22, InterpolantAutomatonStates: 134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.7s AutomataMinimizationTime, 35 MinimizatonAttempts, 481 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 5435 NumberOfCodeBlocks, 5406 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 5394 ConstructedInterpolants, 0 QuantifiedInterpolants, 8886 SizeOfPredicates, 4 NumberOfNonLiveVariables, 10764 ConjunctsInSsa, 119 ConjunctsInUnsatCore, 36 InterpolantComputations, 35 PerfectInterpolantSequences, 3817/3976 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-21 22:15:15,054 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...