/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.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 22:14:01,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 22:14:01,766 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:01,769 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 22:14:01,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 22:14:01,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 22:14:01,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 22:14:01,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 22:14:01,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 22:14:01,797 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 22:14:01,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 22:14:01,798 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 22:14:01,798 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 22:14:01,799 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 22:14:01,799 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 22:14:01,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 22:14:01,800 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 22:14:01,800 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 22:14:01,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 22:14:01,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 22:14:01,800 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 22:14:01,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 22:14:01,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 22:14:01,801 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 22:14:01,801 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 22:14:01,801 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 22:14:01,801 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 22:14:01,802 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 22:14:01,802 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 22:14:01,802 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 22:14:01,803 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 22:14:01,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 22:14:01,803 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 22:14:01,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 22:14:01,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 22:14:01,803 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 22:14:01,803 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 22:14:01,804 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 22:14:01,804 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 22:14:01,804 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 22:14:01,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 22:14:01,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 22:14:01,805 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 22:14:01,805 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 22:14:01,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 22:14:01,805 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 22:14:01,805 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:01,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 22:14:02,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 22:14:02,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 22:14:02,003 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 22:14:02,003 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 22:14:02,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/Problem05_label49+token_ring.01.cil-2.c [2023-12-21 22:14:03,086 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 22:14:03,478 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 22:14:03,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label49+token_ring.01.cil-2.c [2023-12-21 22:14:03,516 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddb79ac27/332fa1049a514962879d663566a069de/FLAG00e2f0aac [2023-12-21 22:14:03,530 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddb79ac27/332fa1049a514962879d663566a069de [2023-12-21 22:14:03,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 22:14:03,532 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 22:14:03,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 22:14:03,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 22:14:03,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 22:14:03,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:14:03" (1/1) ... [2023-12-21 22:14:03,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7739905d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:03, skipping insertion in model container [2023-12-21 22:14:03,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:14:03" (1/1) ... [2023-12-21 22:14:03,701 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 22:14:04,847 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.01.cil-2.c[380593,380606] [2023-12-21 22:14:04,866 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.01.cil-2.c[383339,383352] [2023-12-21 22:14:04,956 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 22:14:04,970 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 22:14:05,510 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.01.cil-2.c[380593,380606] [2023-12-21 22:14:05,513 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.01.cil-2.c[383339,383352] [2023-12-21 22:14:05,530 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 22:14:05,567 INFO L206 MainTranslator]: Completed translation [2023-12-21 22:14:05,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:05 WrapperNode [2023-12-21 22:14:05,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 22:14:05,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 22:14:05,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 22:14:05,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 22:14:05,573 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:05" (1/1) ... [2023-12-21 22:14:05,626 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:05" (1/1) ... [2023-12-21 22:14:05,884 INFO L138 Inliner]: procedures = 47, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12558 [2023-12-21 22:14:05,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 22:14:05,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 22:14:05,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 22:14:05,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 22:14:05,893 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:05" (1/1) ... [2023-12-21 22:14:05,894 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:05" (1/1) ... [2023-12-21 22:14:06,029 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:05" (1/1) ... [2023-12-21 22:14:06,099 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:06,099 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:05" (1/1) ... [2023-12-21 22:14:06,099 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:05" (1/1) ... [2023-12-21 22:14:06,196 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:05" (1/1) ... [2023-12-21 22:14:06,280 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:05" (1/1) ... [2023-12-21 22:14:06,301 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:05" (1/1) ... [2023-12-21 22:14:06,316 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:05" (1/1) ... [2023-12-21 22:14:06,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 22:14:06,368 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 22:14:06,368 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 22:14:06,368 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 22:14:06,369 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:05" (1/1) ... [2023-12-21 22:14:06,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 22:14:06,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 22:14:06,389 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:06,444 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:06,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 22:14:06,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 22:14:06,456 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-21 22:14:06,456 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-21 22:14:06,456 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-21 22:14:06,456 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-21 22:14:06,456 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-21 22:14:06,456 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-21 22:14:06,456 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-21 22:14:06,457 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-21 22:14:06,457 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-21 22:14:06,457 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-21 22:14:06,457 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-21 22:14:06,457 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-21 22:14:06,457 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-21 22:14:06,457 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-21 22:14:06,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 22:14:06,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 22:14:06,565 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 22:14:06,567 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 22:14:13,557 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 22:14:13,651 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 22:14:13,651 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-21 22:14:13,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:14:13 BoogieIcfgContainer [2023-12-21 22:14:13,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 22:14:13,653 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 22:14:13,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 22:14:13,655 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 22:14:13,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 10:14:03" (1/3) ... [2023-12-21 22:14:13,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f933947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:14:13, skipping insertion in model container [2023-12-21 22:14:13,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:05" (2/3) ... [2023-12-21 22:14:13,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f933947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:14:13, skipping insertion in model container [2023-12-21 22:14:13,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:14:13" (3/3) ... [2023-12-21 22:14:13,656 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.01.cil-2.c [2023-12-21 22:14:13,668 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 22:14:13,668 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-21 22:14:13,720 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 22:14:13,724 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;@5c74b70a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 22:14:13,724 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-21 22:14:13,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 2226 states, 2199 states have (on average 1.8872214643019554) internal successors, (4150), 2204 states have internal predecessors, (4150), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 22:14:13,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-21 22:14:13,740 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:13,740 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] [2023-12-21 22:14:13,741 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:13,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:13,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1135104280, now seen corresponding path program 1 times [2023-12-21 22:14:13,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:13,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863205647] [2023-12-21 22:14:13,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:13,755 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:13,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:13,757 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:13,796 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:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:13,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:14:13,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:13,957 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:13,957 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:13,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:13,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863205647] [2023-12-21 22:14:13,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863205647] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:13,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:13,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:14:13,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798801904] [2023-12-21 22:14:13,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:13,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 22:14:13,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:13,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 22:14:13,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 22:14:13,983 INFO L87 Difference]: Start difference. First operand has 2226 states, 2199 states have (on average 1.8872214643019554) internal successors, (4150), 2204 states have internal predecessors, (4150), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 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:14,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:14,437 INFO L93 Difference]: Finished difference Result 4544 states and 8516 transitions. [2023-12-21 22:14:14,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 22:14:14,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 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 52 [2023-12-21 22:14:14,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:14,454 INFO L225 Difference]: With dead ends: 4544 [2023-12-21 22:14:14,455 INFO L226 Difference]: Without dead ends: 2319 [2023-12-21 22:14:14,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 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:14,462 INFO L413 NwaCegarLoop]: 4067 mSDtfsCounter, 4179 mSDsluCounter, 8171 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4188 SdHoareTripleChecker+Valid, 12238 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:14,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4188 Valid, 12238 Invalid, 256 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [38 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 22:14:14,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2023-12-21 22:14:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2310. [2023-12-21 22:14:14,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 2268 states have (on average 1.843915343915344) internal successors, (4182), 2272 states have internal predecessors, (4182), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2023-12-21 22:14:14,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 4235 transitions. [2023-12-21 22:14:14,536 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 4235 transitions. Word has length 52 [2023-12-21 22:14:14,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:14,537 INFO L495 AbstractCegarLoop]: Abstraction has 2310 states and 4235 transitions. [2023-12-21 22:14:14,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 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:14,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 4235 transitions. [2023-12-21 22:14:14,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-21 22:14:14,539 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:14,539 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] [2023-12-21 22:14:14,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-21 22:14:14,746 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:14,747 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:14,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:14,747 INFO L85 PathProgramCache]: Analyzing trace with hash -668103068, now seen corresponding path program 1 times [2023-12-21 22:14:14,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:14,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152486181] [2023-12-21 22:14:14,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:14,748 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:14,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:14,749 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:14,753 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:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:14,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:14:14,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:14,837 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:14,837 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:14,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:14,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152486181] [2023-12-21 22:14:14,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152486181] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:14,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:14,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:14:14,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792535819] [2023-12-21 22:14:14,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:14,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 22:14:14,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:14,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 22:14:14,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 22:14:14,840 INFO L87 Difference]: Start difference. First operand 2310 states and 4235 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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:15,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:15,023 INFO L93 Difference]: Finished difference Result 2492 states and 4508 transitions. [2023-12-21 22:14:15,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 22:14:15,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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 52 [2023-12-21 22:14:15,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:15,031 INFO L225 Difference]: With dead ends: 2492 [2023-12-21 22:14:15,031 INFO L226 Difference]: Without dead ends: 2310 [2023-12-21 22:14:15,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 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:15,033 INFO L413 NwaCegarLoop]: 4047 mSDtfsCounter, 4121 mSDsluCounter, 8048 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4130 SdHoareTripleChecker+Valid, 12095 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:15,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4130 Valid, 12095 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 22:14:15,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2023-12-21 22:14:15,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 2310. [2023-12-21 22:14:15,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 2268 states have (on average 1.8408289241622575) internal successors, (4175), 2272 states have internal predecessors, (4175), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2023-12-21 22:14:15,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 4228 transitions. [2023-12-21 22:14:15,074 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 4228 transitions. Word has length 52 [2023-12-21 22:14:15,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:15,074 INFO L495 AbstractCegarLoop]: Abstraction has 2310 states and 4228 transitions. [2023-12-21 22:14:15,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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:15,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 4228 transitions. [2023-12-21 22:14:15,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-21 22:14:15,076 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:15,076 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] [2023-12-21 22:14:15,081 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:15,282 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:15,282 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:15,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:15,283 INFO L85 PathProgramCache]: Analyzing trace with hash 178245480, now seen corresponding path program 1 times [2023-12-21 22:14:15,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:15,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457297806] [2023-12-21 22:14:15,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:15,283 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:14:15,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:15,285 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:15,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-21 22:14:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:15,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:14:15,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:15,375 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:15,375 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:15,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:15,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1457297806] [2023-12-21 22:14:15,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1457297806] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:15,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:15,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:14:15,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365395915] [2023-12-21 22:14:15,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:15,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 22:14:15,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:15,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 22:14:15,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 22:14:15,378 INFO L87 Difference]: Start difference. First operand 2310 states and 4228 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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:15,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:15,582 INFO L93 Difference]: Finished difference Result 2526 states and 4546 transitions. [2023-12-21 22:14:15,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 22:14:15,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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 52 [2023-12-21 22:14:15,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:15,592 INFO L225 Difference]: With dead ends: 2526 [2023-12-21 22:14:15,592 INFO L226 Difference]: Without dead ends: 2344 [2023-12-21 22:14:15,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 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:15,596 INFO L413 NwaCegarLoop]: 4045 mSDtfsCounter, 4130 mSDsluCounter, 8044 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4139 SdHoareTripleChecker+Valid, 12089 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:15,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4139 Valid, 12089 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 22:14:15,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2344 states. [2023-12-21 22:14:15,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2344 to 2344. [2023-12-21 22:14:15,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 2296 states have (on average 1.8318815331010454) internal successors, (4206), 2300 states have internal predecessors, (4206), 29 states have call successors, (29), 17 states have call predecessors, (29), 17 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2023-12-21 22:14:15,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 4263 transitions. [2023-12-21 22:14:15,645 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 4263 transitions. Word has length 52 [2023-12-21 22:14:15,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:15,646 INFO L495 AbstractCegarLoop]: Abstraction has 2344 states and 4263 transitions. [2023-12-21 22:14:15,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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:15,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 4263 transitions. [2023-12-21 22:14:15,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-21 22:14:15,648 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:15,648 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] [2023-12-21 22:14:15,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-21 22:14:15,851 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:15,851 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:15,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:15,852 INFO L85 PathProgramCache]: Analyzing trace with hash 655106755, now seen corresponding path program 1 times [2023-12-21 22:14:15,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:15,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335191769] [2023-12-21 22:14:15,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:15,852 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:15,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:15,853 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:15,855 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:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:15,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:14:15,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:15,930 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:15,931 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:15,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:15,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335191769] [2023-12-21 22:14:15,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335191769] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:15,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:15,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:14:15,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71562985] [2023-12-21 22:14:15,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:15,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 22:14:15,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:15,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 22:14:15,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 22:14:15,932 INFO L87 Difference]: Start difference. First operand 2344 states and 4263 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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:16,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:16,121 INFO L93 Difference]: Finished difference Result 2588 states and 4608 transitions. [2023-12-21 22:14:16,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 22:14:16,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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 52 [2023-12-21 22:14:16,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:16,128 INFO L225 Difference]: With dead ends: 2588 [2023-12-21 22:14:16,129 INFO L226 Difference]: Without dead ends: 2372 [2023-12-21 22:14:16,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 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:16,131 INFO L413 NwaCegarLoop]: 4042 mSDtfsCounter, 4123 mSDsluCounter, 8040 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4132 SdHoareTripleChecker+Valid, 12082 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:16,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4132 Valid, 12082 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 22:14:16,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2023-12-21 22:14:16,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 2372. [2023-12-21 22:14:16,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2372 states, 2322 states have (on average 1.8221360895779501) internal successors, (4231), 2326 states have internal predecessors, (4231), 29 states have call successors, (29), 19 states have call predecessors, (29), 19 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2023-12-21 22:14:16,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 4288 transitions. [2023-12-21 22:14:16,184 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 4288 transitions. Word has length 52 [2023-12-21 22:14:16,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:16,184 INFO L495 AbstractCegarLoop]: Abstraction has 2372 states and 4288 transitions. [2023-12-21 22:14:16,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 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:16,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 4288 transitions. [2023-12-21 22:14:16,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-21 22:14:16,185 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:16,186 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] [2023-12-21 22:14:16,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-21 22:14:16,389 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:16,389 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:16,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:16,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1415763143, now seen corresponding path program 1 times [2023-12-21 22:14:16,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:16,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177030088] [2023-12-21 22:14:16,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:16,390 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:16,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:16,391 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:16,419 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:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:16,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:14:16,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:16,461 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:16,461 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:16,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:16,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177030088] [2023-12-21 22:14:16,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177030088] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:16,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:16,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:14:16,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985222026] [2023-12-21 22:14:16,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:16,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 22:14:16,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:16,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 22:14:16,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:14:16,464 INFO L87 Difference]: Start difference. First operand 2372 states and 4288 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:16,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:16,540 INFO L93 Difference]: Finished difference Result 2635 states and 4643 transitions. [2023-12-21 22:14:16,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 22:14:16,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 52 [2023-12-21 22:14:16,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:16,553 INFO L225 Difference]: With dead ends: 2635 [2023-12-21 22:14:16,554 INFO L226 Difference]: Without dead ends: 2392 [2023-12-21 22:14:16,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 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:16,558 INFO L413 NwaCegarLoop]: 4084 mSDtfsCounter, 11 mSDsluCounter, 8162 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12246 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:16,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 12246 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:14:16,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2023-12-21 22:14:16,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 2376. [2023-12-21 22:14:16,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2376 states, 2326 states have (on average 1.8190025795356837) internal successors, (4231), 2330 states have internal predecessors, (4231), 29 states have call successors, (29), 19 states have call predecessors, (29), 19 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2023-12-21 22:14:16,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 4288 transitions. [2023-12-21 22:14:16,609 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 4288 transitions. Word has length 52 [2023-12-21 22:14:16,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:16,609 INFO L495 AbstractCegarLoop]: Abstraction has 2376 states and 4288 transitions. [2023-12-21 22:14:16,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:16,610 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 4288 transitions. [2023-12-21 22:14:16,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-21 22:14:16,611 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:16,611 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] [2023-12-21 22:14:16,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-21 22:14:16,814 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:16,814 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:16,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:16,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2117363017, now seen corresponding path program 1 times [2023-12-21 22:14:16,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:16,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345627283] [2023-12-21 22:14:16,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:16,816 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:16,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:16,816 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:16,832 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:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:16,866 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:14:16,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:16,876 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:16,877 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:16,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:16,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345627283] [2023-12-21 22:14:16,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [345627283] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:16,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:16,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:14:16,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073722122] [2023-12-21 22:14:16,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:16,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 22:14:16,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:16,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 22:14:16,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:14:16,878 INFO L87 Difference]: Start difference. First operand 2376 states and 4288 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:16,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:16,953 INFO L93 Difference]: Finished difference Result 2631 states and 4627 transitions. [2023-12-21 22:14:16,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 22:14:16,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 52 [2023-12-21 22:14:16,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:16,960 INFO L225 Difference]: With dead ends: 2631 [2023-12-21 22:14:16,960 INFO L226 Difference]: Without dead ends: 2384 [2023-12-21 22:14:16,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 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:16,962 INFO L413 NwaCegarLoop]: 4084 mSDtfsCounter, 2 mSDsluCounter, 8163 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 12247 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:16,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 12247 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:14:16,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2023-12-21 22:14:16,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 2380. [2023-12-21 22:14:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 2330 states have (on average 1.8158798283261803) internal successors, (4231), 2334 states have internal predecessors, (4231), 29 states have call successors, (29), 19 states have call predecessors, (29), 19 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2023-12-21 22:14:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 4288 transitions. [2023-12-21 22:14:17,014 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 4288 transitions. Word has length 52 [2023-12-21 22:14:17,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:17,014 INFO L495 AbstractCegarLoop]: Abstraction has 2380 states and 4288 transitions. [2023-12-21 22:14:17,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:17,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 4288 transitions. [2023-12-21 22:14:17,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-21 22:14:17,017 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:17,017 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] [2023-12-21 22:14:17,026 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:17,220 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:17,221 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:17,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:17,221 INFO L85 PathProgramCache]: Analyzing trace with hash -2115564665, now seen corresponding path program 1 times [2023-12-21 22:14:17,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:17,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658684512] [2023-12-21 22:14:17,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:17,221 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:17,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:17,222 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:17,223 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:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:17,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:14:17,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:17,316 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:17,316 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:17,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:17,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658684512] [2023-12-21 22:14:17,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658684512] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:17,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:17,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 22:14:17,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852644797] [2023-12-21 22:14:17,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:17,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:14:17,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:17,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:14:17,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:14:17,318 INFO L87 Difference]: Start difference. First operand 2380 states and 4288 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 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:17,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:17,381 INFO L93 Difference]: Finished difference Result 2851 states and 4885 transitions. [2023-12-21 22:14:17,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:14:17,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 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 52 [2023-12-21 22:14:17,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:17,388 INFO L225 Difference]: With dead ends: 2851 [2023-12-21 22:14:17,388 INFO L226 Difference]: Without dead ends: 2600 [2023-12-21 22:14:17,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:14:17,390 INFO L413 NwaCegarLoop]: 4113 mSDtfsCounter, 4025 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4025 SdHoareTripleChecker+Valid, 4220 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:17,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4025 Valid, 4220 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:14:17,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2023-12-21 22:14:17,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 2598. [2023-12-21 22:14:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2598 states, 2506 states have (on average 1.7725458898643256) internal successors, (4442), 2513 states have internal predecessors, (4442), 52 states have call successors, (52), 37 states have call predecessors, (52), 38 states have return successors, (52), 48 states have call predecessors, (52), 50 states have call successors, (52) [2023-12-21 22:14:17,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 4546 transitions. [2023-12-21 22:14:17,452 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 4546 transitions. Word has length 52 [2023-12-21 22:14:17,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:17,454 INFO L495 AbstractCegarLoop]: Abstraction has 2598 states and 4546 transitions. [2023-12-21 22:14:17,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 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:17,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 4546 transitions. [2023-12-21 22:14:17,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-21 22:14:17,455 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:17,455 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-21 22:14:17,658 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:17,658 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:17,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:17,658 INFO L85 PathProgramCache]: Analyzing trace with hash -165286157, now seen corresponding path program 1 times [2023-12-21 22:14:17,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:17,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769504554] [2023-12-21 22:14:17,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:17,659 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:17,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:17,660 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:17,662 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:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:17,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 22:14:17,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-21 22:14:17,791 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:17,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:17,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769504554] [2023-12-21 22:14:17,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769504554] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:17,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:17,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:14:17,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930880337] [2023-12-21 22:14:17,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:17,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 22:14:17,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:17,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 22:14:17,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:14:17,793 INFO L87 Difference]: Start difference. First operand 2598 states and 4546 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:18,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:18,060 INFO L93 Difference]: Finished difference Result 3456 states and 5619 transitions. [2023-12-21 22:14:18,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 22:14:18,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 84 [2023-12-21 22:14:18,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:18,069 INFO L225 Difference]: With dead ends: 3456 [2023-12-21 22:14:18,069 INFO L226 Difference]: Without dead ends: 2988 [2023-12-21 22:14:18,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 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:18,072 INFO L413 NwaCegarLoop]: 4100 mSDtfsCounter, 4087 mSDsluCounter, 4125 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4091 SdHoareTripleChecker+Valid, 8225 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:18,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4091 Valid, 8225 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 22:14:18,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2023-12-21 22:14:18,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 2984. [2023-12-21 22:14:18,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2984 states, 2813 states have (on average 1.7116956985424814) internal successors, (4815), 2829 states have internal predecessors, (4815), 93 states have call successors, (93), 65 states have call predecessors, (93), 76 states have return successors, (115), 91 states have call predecessors, (115), 91 states have call successors, (115) [2023-12-21 22:14:18,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2984 states and 5023 transitions. [2023-12-21 22:14:18,140 INFO L78 Accepts]: Start accepts. Automaton has 2984 states and 5023 transitions. Word has length 84 [2023-12-21 22:14:18,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:18,140 INFO L495 AbstractCegarLoop]: Abstraction has 2984 states and 5023 transitions. [2023-12-21 22:14:18,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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:18,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 5023 transitions. [2023-12-21 22:14:18,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-21 22:14:18,141 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:18,141 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,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 (9)] Forceful destruction successful, exit code 0 [2023-12-21 22:14:18,345 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:18,345 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:18,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:18,346 INFO L85 PathProgramCache]: Analyzing trace with hash -138220555, now seen corresponding path program 1 times [2023-12-21 22:14:18,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:18,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36836943] [2023-12-21 22:14:18,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:18,346 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:18,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:18,347 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:18,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 (10)] Waiting until timeout for monitored process [2023-12-21 22:14:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:18,406 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:14:18,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:18,419 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-21 22:14:18,421 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:18,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:18,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36836943] [2023-12-21 22:14:18,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36836943] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:18,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:18,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:14:18,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323796916] [2023-12-21 22:14:18,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:18,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:14:18,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:18,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:14:18,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:14:18,423 INFO L87 Difference]: Start difference. First operand 2984 states and 5023 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:18,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:18,481 INFO L93 Difference]: Finished difference Result 3834 states and 6066 transitions. [2023-12-21 22:14:18,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:14:18,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 84 [2023-12-21 22:14:18,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:18,502 INFO L225 Difference]: With dead ends: 3834 [2023-12-21 22:14:18,502 INFO L226 Difference]: Without dead ends: 2980 [2023-12-21 22:14:18,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 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:18,506 INFO L413 NwaCegarLoop]: 4083 mSDtfsCounter, 131 mSDsluCounter, 3957 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 8040 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:18,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 8040 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:14:18,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2023-12-21 22:14:18,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 2980. [2023-12-21 22:14:18,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2980 states, 2812 states have (on average 1.711593172119488) internal successors, (4813), 2827 states have internal predecessors, (4813), 90 states have call successors, (90), 65 states have call predecessors, (90), 76 states have return successors, (112), 88 states have call predecessors, (112), 88 states have call successors, (112) [2023-12-21 22:14:18,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2980 states to 2980 states and 5015 transitions. [2023-12-21 22:14:18,573 INFO L78 Accepts]: Start accepts. Automaton has 2980 states and 5015 transitions. Word has length 84 [2023-12-21 22:14:18,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:18,573 INFO L495 AbstractCegarLoop]: Abstraction has 2980 states and 5015 transitions. [2023-12-21 22:14:18,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:18,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2980 states and 5015 transitions. [2023-12-21 22:14:18,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-21 22:14:18,574 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:18,574 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,592 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:18,777 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:18,777 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:18,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:18,777 INFO L85 PathProgramCache]: Analyzing trace with hash 988362680, now seen corresponding path program 1 times [2023-12-21 22:14:18,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:18,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782105409] [2023-12-21 22:14:18,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:18,778 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:18,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:18,779 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:18,780 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:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:18,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:14:18,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:18,857 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-21 22:14:18,857 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:18,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:18,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782105409] [2023-12-21 22:14:18,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782105409] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:18,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:18,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:14:18,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058060496] [2023-12-21 22:14:18,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:18,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:14:18,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:18,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:14:18,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:14:18,858 INFO L87 Difference]: Start difference. First operand 2980 states and 5015 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:18,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:18,960 INFO L93 Difference]: Finished difference Result 4445 states and 6830 transitions. [2023-12-21 22:14:18,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:14:18,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 86 [2023-12-21 22:14:18,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:18,967 INFO L225 Difference]: With dead ends: 4445 [2023-12-21 22:14:18,968 INFO L226 Difference]: Without dead ends: 3292 [2023-12-21 22:14:18,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 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:18,970 INFO L413 NwaCegarLoop]: 4168 mSDtfsCounter, 89 mSDsluCounter, 4076 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 8244 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:18,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 8244 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:14:18,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3292 states. [2023-12-21 22:14:19,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 3292. [2023-12-21 22:14:19,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3292 states, 3064 states have (on average 1.6671018276762402) internal successors, (5108), 3081 states have internal predecessors, (5108), 124 states have call successors, (124), 89 states have call predecessors, (124), 102 states have return successors, (158), 122 states have call predecessors, (158), 122 states have call successors, (158) [2023-12-21 22:14:19,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 3292 states and 5390 transitions. [2023-12-21 22:14:19,043 INFO L78 Accepts]: Start accepts. Automaton has 3292 states and 5390 transitions. Word has length 86 [2023-12-21 22:14:19,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:19,043 INFO L495 AbstractCegarLoop]: Abstraction has 3292 states and 5390 transitions. [2023-12-21 22:14:19,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:19,044 INFO L276 IsEmpty]: Start isEmpty. Operand 3292 states and 5390 transitions. [2023-12-21 22:14:19,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-21 22:14:19,045 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:19,045 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-21 22:14:19,048 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:19,248 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:19,249 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:19,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:19,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1817944487, now seen corresponding path program 1 times [2023-12-21 22:14:19,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:19,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956530464] [2023-12-21 22:14:19,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:19,250 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:19,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:19,250 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:19,251 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:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:19,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:14:19,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:19,387 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-21 22:14:19,387 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:19,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:19,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956530464] [2023-12-21 22:14:19,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956530464] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:19,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:19,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 22:14:19,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870786537] [2023-12-21 22:14:19,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:19,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:14:19,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:19,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:14:19,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:14:19,388 INFO L87 Difference]: Start difference. First operand 3292 states and 5390 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 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:19,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:19,476 INFO L93 Difference]: Finished difference Result 4765 states and 7182 transitions. [2023-12-21 22:14:19,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:14:19,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 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 107 [2023-12-21 22:14:19,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:19,482 INFO L225 Difference]: With dead ends: 4765 [2023-12-21 22:14:19,483 INFO L226 Difference]: Without dead ends: 3602 [2023-12-21 22:14:19,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 105 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:19,486 INFO L413 NwaCegarLoop]: 4113 mSDtfsCounter, 4001 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4001 SdHoareTripleChecker+Valid, 4222 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:19,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4001 Valid, 4222 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:14:19,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3602 states. [2023-12-21 22:14:19,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3602 to 3596. [2023-12-21 22:14:19,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3596 states, 3308 states have (on average 1.6269649334945586) internal successors, (5382), 3327 states have internal predecessors, (5382), 158 states have call successors, (158), 113 states have call predecessors, (158), 128 states have return successors, (194), 156 states have call predecessors, (194), 156 states have call successors, (194) [2023-12-21 22:14:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3596 states to 3596 states and 5734 transitions. [2023-12-21 22:14:19,641 INFO L78 Accepts]: Start accepts. Automaton has 3596 states and 5734 transitions. Word has length 107 [2023-12-21 22:14:19,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:19,642 INFO L495 AbstractCegarLoop]: Abstraction has 3596 states and 5734 transitions. [2023-12-21 22:14:19,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 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:19,642 INFO L276 IsEmpty]: Start isEmpty. Operand 3596 states and 5734 transitions. [2023-12-21 22:14:19,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-21 22:14:19,645 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:19,645 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:14:19,651 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:19,849 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:19,849 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:19,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:19,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1754711175, now seen corresponding path program 1 times [2023-12-21 22:14:19,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:19,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694716558] [2023-12-21 22:14:19,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:19,850 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:19,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:19,851 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:19,851 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:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:19,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:14:19,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-21 22:14:19,991 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:19,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:19,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694716558] [2023-12-21 22:14:19,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1694716558] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:19,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:19,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:14:19,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362847556] [2023-12-21 22:14:19,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:19,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 22:14:19,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:19,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 22:14:19,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:14:19,993 INFO L87 Difference]: Start difference. First operand 3596 states and 5734 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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:20,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:20,204 INFO L93 Difference]: Finished difference Result 5072 states and 7531 transitions. [2023-12-21 22:14:20,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 22:14:20,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 122 [2023-12-21 22:14:20,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:20,211 INFO L225 Difference]: With dead ends: 5072 [2023-12-21 22:14:20,211 INFO L226 Difference]: Without dead ends: 3606 [2023-12-21 22:14:20,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 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:20,214 INFO L413 NwaCegarLoop]: 4057 mSDtfsCounter, 4077 mSDsluCounter, 4094 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4083 SdHoareTripleChecker+Valid, 8151 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:20,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4083 Valid, 8151 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 22:14:20,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3606 states. [2023-12-21 22:14:20,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3606 to 3606. [2023-12-21 22:14:20,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3606 states, 3314 states have (on average 1.6191913095956547) internal successors, (5366), 3335 states have internal predecessors, (5366), 158 states have call successors, (158), 113 states have call predecessors, (158), 132 states have return successors, (182), 158 states have call predecessors, (182), 156 states have call successors, (182) [2023-12-21 22:14:20,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3606 states to 3606 states and 5706 transitions. [2023-12-21 22:14:20,297 INFO L78 Accepts]: Start accepts. Automaton has 3606 states and 5706 transitions. Word has length 122 [2023-12-21 22:14:20,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:20,297 INFO L495 AbstractCegarLoop]: Abstraction has 3606 states and 5706 transitions. [2023-12-21 22:14:20,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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:20,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3606 states and 5706 transitions. [2023-12-21 22:14:20,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-21 22:14:20,300 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:20,301 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,306 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:20,504 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:20,504 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:20,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:20,505 INFO L85 PathProgramCache]: Analyzing trace with hash -830212948, now seen corresponding path program 1 times [2023-12-21 22:14:20,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:20,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1032637361] [2023-12-21 22:14:20,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:20,505 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:20,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:20,506 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:20,524 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:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:20,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:14:20,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:20,592 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-21 22:14:20,592 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:20,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:20,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1032637361] [2023-12-21 22:14:20,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1032637361] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:20,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:20,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:14:20,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052184098] [2023-12-21 22:14:20,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:20,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:14:20,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:20,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:14:20,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:14:20,593 INFO L87 Difference]: Start difference. First operand 3606 states and 5706 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:20,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:20,676 INFO L93 Difference]: Finished difference Result 4334 states and 6567 transitions. [2023-12-21 22:14:20,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:14:20,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 123 [2023-12-21 22:14:20,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:20,681 INFO L225 Difference]: With dead ends: 4334 [2023-12-21 22:14:20,681 INFO L226 Difference]: Without dead ends: 2794 [2023-12-21 22:14:20,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 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:20,684 INFO L413 NwaCegarLoop]: 4128 mSDtfsCounter, 97 mSDsluCounter, 4058 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 8186 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:20,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 8186 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:14:20,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2794 states. [2023-12-21 22:14:20,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2794 to 2794. [2023-12-21 22:14:20,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2794 states, 2658 states have (on average 1.7193378480060195) internal successors, (4570), 2667 states have internal predecessors, (4570), 78 states have call successors, (78), 53 states have call predecessors, (78), 56 states have return successors, (80), 74 states have call predecessors, (80), 76 states have call successors, (80) [2023-12-21 22:14:20,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2794 states to 2794 states and 4728 transitions. [2023-12-21 22:14:20,737 INFO L78 Accepts]: Start accepts. Automaton has 2794 states and 4728 transitions. Word has length 123 [2023-12-21 22:14:20,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:20,737 INFO L495 AbstractCegarLoop]: Abstraction has 2794 states and 4728 transitions. [2023-12-21 22:14:20,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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:20,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2794 states and 4728 transitions. [2023-12-21 22:14:20,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-21 22:14:20,738 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:20,738 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-21 22:14:20,744 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 (14)] Ended with exit code 0 [2023-12-21 22:14:20,944 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:20,944 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:20,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:20,945 INFO L85 PathProgramCache]: Analyzing trace with hash -842766993, now seen corresponding path program 1 times [2023-12-21 22:14:20,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:20,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551487012] [2023-12-21 22:14:20,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:20,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:20,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:20,948 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:20,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 (15)] Waiting until timeout for monitored process [2023-12-21 22:14:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:21,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:14:21,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:21,041 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-21 22:14:21,041 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:21,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:21,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551487012] [2023-12-21 22:14:21,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551487012] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:21,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:21,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:14:21,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343293112] [2023-12-21 22:14:21,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:21,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:14:21,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:21,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:14:21,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:14:21,043 INFO L87 Difference]: Start difference. First operand 2794 states and 4728 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-21 22:14:21,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:21,104 INFO L93 Difference]: Finished difference Result 3322 states and 5346 transitions. [2023-12-21 22:14:21,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:14:21,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 124 [2023-12-21 22:14:21,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:21,109 INFO L225 Difference]: With dead ends: 3322 [2023-12-21 22:14:21,109 INFO L226 Difference]: Without dead ends: 2794 [2023-12-21 22:14:21,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:14:21,111 INFO L413 NwaCegarLoop]: 4115 mSDtfsCounter, 95 mSDsluCounter, 4035 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 8150 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:21,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 8150 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:14:21,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2794 states. [2023-12-21 22:14:21,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2794 to 2794. [2023-12-21 22:14:21,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2794 states, 2658 states have (on average 1.7163280662151994) internal successors, (4562), 2667 states have internal predecessors, (4562), 78 states have call successors, (78), 53 states have call predecessors, (78), 56 states have return successors, (80), 74 states have call predecessors, (80), 76 states have call successors, (80) [2023-12-21 22:14:21,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2794 states to 2794 states and 4720 transitions. [2023-12-21 22:14:21,239 INFO L78 Accepts]: Start accepts. Automaton has 2794 states and 4720 transitions. Word has length 124 [2023-12-21 22:14:21,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:21,239 INFO L495 AbstractCegarLoop]: Abstraction has 2794 states and 4720 transitions. [2023-12-21 22:14:21,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-21 22:14:21,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2794 states and 4720 transitions. [2023-12-21 22:14:21,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-21 22:14:21,241 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:21,241 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-21 22:14:21,246 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:21,444 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:21,444 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:21,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:21,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1882288285, now seen corresponding path program 1 times [2023-12-21 22:14:21,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:21,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258791461] [2023-12-21 22:14:21,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:21,445 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:21,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:21,446 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:21,453 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:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:21,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 22:14:21,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:21,614 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 50 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 22:14:21,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 22:14:21,687 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-21 22:14:21,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:21,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258791461] [2023-12-21 22:14:21,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [258791461] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 22:14:21,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 22:14:21,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-12-21 22:14:21,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033905129] [2023-12-21 22:14:21,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:21,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 22:14:21,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:21,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 22:14:21,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:14:21,688 INFO L87 Difference]: Start difference. First operand 2794 states and 4720 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-21 22:14:21,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:21,863 INFO L93 Difference]: Finished difference Result 2798 states and 4723 transitions. [2023-12-21 22:14:21,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 22:14:21,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 125 [2023-12-21 22:14:21,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:21,868 INFO L225 Difference]: With dead ends: 2798 [2023-12-21 22:14:21,868 INFO L226 Difference]: Without dead ends: 2795 [2023-12-21 22:14:21,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 246 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:21,869 INFO L413 NwaCegarLoop]: 4152 mSDtfsCounter, 4148 mSDsluCounter, 4103 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4148 SdHoareTripleChecker+Valid, 8255 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:21,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4148 Valid, 8255 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 22:14:21,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2795 states. [2023-12-21 22:14:21,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2795 to 2793. [2023-12-21 22:14:21,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2793 states, 2658 states have (on average 1.7155756207674944) internal successors, (4560), 2666 states have internal predecessors, (4560), 77 states have call successors, (77), 53 states have call predecessors, (77), 56 states have return successors, (80), 74 states have call predecessors, (80), 76 states have call successors, (80) [2023-12-21 22:14:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2793 states to 2793 states and 4717 transitions. [2023-12-21 22:14:21,946 INFO L78 Accepts]: Start accepts. Automaton has 2793 states and 4717 transitions. Word has length 125 [2023-12-21 22:14:21,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:21,947 INFO L495 AbstractCegarLoop]: Abstraction has 2793 states and 4717 transitions. [2023-12-21 22:14:21,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-21 22:14:21,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2793 states and 4717 transitions. [2023-12-21 22:14:21,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-21 22:14:21,948 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:21,948 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-21 22:14:21,954 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:22,151 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:22,152 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:22,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:22,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1749844747, now seen corresponding path program 1 times [2023-12-21 22:14:22,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:22,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1556521827] [2023-12-21 22:14:22,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:22,153 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:22,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:22,154 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:22,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-21 22:14:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:14:22,219 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:14:22,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:14:22,229 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-12-21 22:14:22,229 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:14:22,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:14:22,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1556521827] [2023-12-21 22:14:22,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1556521827] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:14:22,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:14:22,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:14:22,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920386805] [2023-12-21 22:14:22,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:14:22,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:14:22,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:14:22,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:14:22,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:14:22,230 INFO L87 Difference]: Start difference. First operand 2793 states and 4717 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 22:14:22,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:14:22,332 INFO L93 Difference]: Finished difference Result 3202 states and 5181 transitions. [2023-12-21 22:14:22,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:14:22,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 129 [2023-12-21 22:14:22,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:14:22,337 INFO L225 Difference]: With dead ends: 3202 [2023-12-21 22:14:22,337 INFO L226 Difference]: Without dead ends: 2803 [2023-12-21 22:14:22,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 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:22,339 INFO L413 NwaCegarLoop]: 4082 mSDtfsCounter, 3 mSDsluCounter, 4068 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8150 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:14:22,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8150 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:14:22,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2803 states. [2023-12-21 22:14:22,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2803 to 2795. [2023-12-21 22:14:22,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2795 states, 2660 states have (on average 1.7150375939849625) internal successors, (4562), 2668 states have internal predecessors, (4562), 77 states have call successors, (77), 53 states have call predecessors, (77), 56 states have return successors, (80), 74 states have call predecessors, (80), 76 states have call successors, (80) [2023-12-21 22:14:22,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2795 states to 2795 states and 4719 transitions. [2023-12-21 22:14:22,420 INFO L78 Accepts]: Start accepts. Automaton has 2795 states and 4719 transitions. Word has length 129 [2023-12-21 22:14:22,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:14:22,421 INFO L495 AbstractCegarLoop]: Abstraction has 2795 states and 4719 transitions. [2023-12-21 22:14:22,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 22:14:22,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2795 states and 4719 transitions. [2023-12-21 22:14:22,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-21 22:14:22,422 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:14:22,422 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-21 22:14:22,428 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:22,626 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:22,626 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:14:22,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:14:22,626 INFO L85 PathProgramCache]: Analyzing trace with hash -360147520, now seen corresponding path program 1 times [2023-12-21 22:14:22,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:14:22,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097450513] [2023-12-21 22:14:22,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:14:22,627 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:22,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:14:22,628 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:22,628 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:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 22:14:22,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 22:14:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 22:14:22,810 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-21 22:14:22,810 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 22:14:22,811 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-21 22:14:22,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-21 22:14:22,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-21 22:14:23,016 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:23,019 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:14:23,022 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 22:14:23,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 10:14:23 BoogieIcfgContainer [2023-12-21 22:14:23,122 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 22:14:23,122 INFO L158 Benchmark]: Toolchain (without parser) took 19590.15ms. Allocated memory was 188.7MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 114.6MB in the beginning and 961.0MB in the end (delta: -846.4MB). Peak memory consumption was 549.7MB. Max. memory is 8.0GB. [2023-12-21 22:14:23,123 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 188.7MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 22:14:23,123 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2033.85ms. Allocated memory was 188.7MB in the beginning and 255.9MB in the end (delta: 67.1MB). Free memory was 114.6MB in the beginning and 110.9MB in the end (delta: 3.7MB). Peak memory consumption was 142.0MB. Max. memory is 8.0GB. [2023-12-21 22:14:23,123 INFO L158 Benchmark]: Boogie Procedure Inliner took 316.21ms. Allocated memory is still 255.9MB. Free memory was 110.9MB in the beginning and 106.2MB in the end (delta: 4.7MB). Peak memory consumption was 62.4MB. Max. memory is 8.0GB. [2023-12-21 22:14:23,123 INFO L158 Benchmark]: Boogie Preprocessor took 481.39ms. Allocated memory was 255.9MB in the beginning and 402.7MB in the end (delta: 146.8MB). Free memory was 106.2MB in the beginning and 237.3MB in the end (delta: -131.1MB). Peak memory consumption was 61.9MB. Max. memory is 8.0GB. [2023-12-21 22:14:23,123 INFO L158 Benchmark]: RCFGBuilder took 7283.51ms. Allocated memory was 402.7MB in the beginning and 1.1GB in the end (delta: 652.2MB). Free memory was 237.3MB in the beginning and 413.4MB in the end (delta: -176.2MB). Peak memory consumption was 477.6MB. Max. memory is 8.0GB. [2023-12-21 22:14:23,123 INFO L158 Benchmark]: TraceAbstraction took 9469.35ms. Allocated memory was 1.1GB in the beginning and 1.6GB in the end (delta: 529.5MB). Free memory was 412.4MB in the beginning and 961.0MB in the end (delta: -548.6MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 22:14:23,124 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.13ms. Allocated memory is still 188.7MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 2033.85ms. Allocated memory was 188.7MB in the beginning and 255.9MB in the end (delta: 67.1MB). Free memory was 114.6MB in the beginning and 110.9MB in the end (delta: 3.7MB). Peak memory consumption was 142.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 316.21ms. Allocated memory is still 255.9MB. Free memory was 110.9MB in the beginning and 106.2MB in the end (delta: 4.7MB). Peak memory consumption was 62.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 481.39ms. Allocated memory was 255.9MB in the beginning and 402.7MB in the end (delta: 146.8MB). Free memory was 106.2MB in the beginning and 237.3MB in the end (delta: -131.1MB). Peak memory consumption was 61.9MB. Max. memory is 8.0GB. * RCFGBuilder took 7283.51ms. Allocated memory was 402.7MB in the beginning and 1.1GB in the end (delta: 652.2MB). Free memory was 237.3MB in the beginning and 413.4MB in the end (delta: -176.2MB). Peak memory consumption was 477.6MB. Max. memory is 8.0GB. * TraceAbstraction took 9469.35ms. Allocated memory was 1.1GB in the beginning and 1.6GB in the end (delta: 529.5MB). Free memory was 412.4MB in the beginning and 961.0MB in the end (delta: -548.6MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L11586] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L11340] COND TRUE t1_i == 1 [L11341] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L11587] RET init_threads() [L11588] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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, token=0] [L11424] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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, token=0] [L11429] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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, token=0] [L11434] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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, token=0] [L11439] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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, token=0] [L11588] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L11589] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_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, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_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, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_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, token=0] [L11299] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_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, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_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, tmp=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_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, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_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, token=0] [L11318] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_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, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_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, tmp=0, tmp___0=0, token=0] [L11589] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L11590] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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, token=0] [L11452] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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, token=0] [L11457] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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, token=0] [L11462] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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, token=0] [L11467] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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, token=0] [L11590] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L11593] COND TRUE 1 [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_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, tmp=1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_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, tmp=1, tmp_ndt_1=0, token=0] [L11385-L11396] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_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, tmp=1, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE, EXPR \read(tmp_ndt_2) [L11404] EXPR t1_st = 1 [L11405] CALL, EXPR transmit1() [L11253] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L11405] RET, EXPR transmit1() [L11399-L11410] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_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, tmp=1, token=0] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_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, tmp=1, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_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, tmp=1, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_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, tmp=1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE, EXPR \read(tmp_ndt_1) [L11390] EXPR m_st = 1 [L11391] CALL, EXPR master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L11208] COND TRUE 1 [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_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, token=0] [L11214] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_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, token=0] [L11506] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_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, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_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, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_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, token=0] [L11299] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_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, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_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, tmp=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_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, token=0] [L11308] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_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, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_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, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_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, tmp=0, tmp___0=1, token=0] [L11506] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_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, token=0] [L11214] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_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, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L11391] RET, EXPR master() [L11385-L11396] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_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, tmp=1, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE, EXPR \read(tmp_ndt_2) [L11404] EXPR t1_st = 1 [L11405] CALL, EXPR transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_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, token=0] [L11256] COND TRUE t1_pc == 1 [L11272] token += 1 [L11273] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_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, token=1] [L11274] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_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=1, token=1] [L11506] CALL activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_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=1, token=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_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=1, token=1] [L11289] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_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=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_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=1, token=1] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_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=1, tmp=1, token=1] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_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=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_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=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_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=1, token=1] [L11318] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_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=1, token=1] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_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=1, tmp=1, tmp___0=0, token=1] [L11506] RET activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_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=1, token=1] [L11274] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_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=1, token=1] [L11275] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_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=1, token=1] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_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, token=1] [L11405] RET, EXPR transmit1() [L11399-L11410] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_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, tmp=1, token=1] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_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, tmp=1, token=1] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_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, token=1] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_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, token=1] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_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, token=1] [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_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, tmp=1, token=1] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_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, tmp=1, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_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, token=1] [L11200] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_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, token=1] [L11222] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, M_E=2, T1_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, token=1] [L11227] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_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, tmp_var=5, token=1] [L11228] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_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, tmp_var=5, token=1] [L11233] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_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, tmp_var=5, token=1] [L11234] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_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, tmp_var=5, token=1] [L11235] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_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, tmp_var=5, token=1] [L11236] CALL error() VAL [E_1=2, E_M=2, M_E=2, T1_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, token=1] [L11173] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_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, token=1] - 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, 2226 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37366 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37319 mSDsluCounter, 146840 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 81360 mSDsCounter, 198 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1346 IncrementalHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 198 mSolverCounterUnsat, 65480 mSDtfsCounter, 1346 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1464 GetRequests, 1429 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3606occurred in iteration=12, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 51 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1478 NumberOfCodeBlocks, 1478 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1456 ConstructedInterpolants, 0 QuantifiedInterpolants, 2387 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2830 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 542/556 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:14:23,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...