/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/pc_sfifo_1.cil-2+token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-22 02:28:57,434 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-22 02:28:57,503 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-22 02:28:57,509 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-22 02:28:57,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-22 02:28:57,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-22 02:28:57,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-22 02:28:57,539 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-22 02:28:57,539 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-22 02:28:57,543 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-22 02:28:57,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-22 02:28:57,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-22 02:28:57,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-22 02:28:57,545 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-22 02:28:57,545 INFO L153 SettingsManager]: * Use SBE=true [2023-12-22 02:28:57,545 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-22 02:28:57,546 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-22 02:28:57,546 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-22 02:28:57,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-22 02:28:57,547 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-22 02:28:57,547 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-22 02:28:57,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-22 02:28:57,548 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-22 02:28:57,548 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-22 02:28:57,548 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-22 02:28:57,548 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-22 02:28:57,548 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-22 02:28:57,548 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-22 02:28:57,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-22 02:28:57,549 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-22 02:28:57,549 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-22 02:28:57,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-22 02:28:57,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-22 02:28:57,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-22 02:28:57,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 02:28:57,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-22 02:28:57,550 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-22 02:28:57,550 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-22 02:28:57,550 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-22 02:28:57,550 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-22 02:28:57,551 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-22 02:28:57,551 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-22 02:28:57,551 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-22 02:28:57,551 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-22 02:28:57,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-22 02:28:57,551 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-22 02:28:57,551 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-22 02:28:57,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-22 02:28:57,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-22 02:28:57,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-22 02:28:57,745 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-22 02:28:57,745 INFO L274 PluginConnector]: CDTParser initialized [2023-12-22 02:28:57,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2023-12-22 02:28:58,893 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-22 02:28:59,062 INFO L384 CDTParser]: Found 1 translation units. [2023-12-22 02:28:59,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2023-12-22 02:28:59,075 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14c7df926/cadc42e3afec4e4590f370aa7413451b/FLAGc76456fc6 [2023-12-22 02:28:59,088 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14c7df926/cadc42e3afec4e4590f370aa7413451b [2023-12-22 02:28:59,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-22 02:28:59,091 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-22 02:28:59,092 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-22 02:28:59,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-22 02:28:59,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-22 02:28:59,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13aa8353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59, skipping insertion in model container [2023-12-22 02:28:59,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,141 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-22 02:28:59,285 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/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2023-12-22 02:28:59,312 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/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2023-12-22 02:28:59,331 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 02:28:59,349 INFO L202 MainTranslator]: Completed pre-run [2023-12-22 02:28:59,364 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/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2023-12-22 02:28:59,386 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/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2023-12-22 02:28:59,401 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 02:28:59,431 INFO L206 MainTranslator]: Completed translation [2023-12-22 02:28:59,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59 WrapperNode [2023-12-22 02:28:59,432 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-22 02:28:59,432 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-22 02:28:59,433 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-22 02:28:59,433 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-22 02:28:59,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,476 INFO L138 Inliner]: procedures = 51, calls = 51, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 404 [2023-12-22 02:28:59,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-22 02:28:59,477 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-22 02:28:59,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-22 02:28:59,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-22 02:28:59,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,489 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,499 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-22 02:28:59,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,521 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,532 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-22 02:28:59,536 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-22 02:28:59,537 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-22 02:28:59,537 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-22 02:28:59,537 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (1/1) ... [2023-12-22 02:28:59,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 02:28:59,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-22 02:28:59,568 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-22 02:28:59,594 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-22 02:28:59,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-22 02:28:59,623 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-22 02:28:59,623 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-22 02:28:59,623 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2023-12-22 02:28:59,623 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2023-12-22 02:28:59,624 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-12-22 02:28:59,624 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-12-22 02:28:59,624 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-12-22 02:28:59,624 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-12-22 02:28:59,624 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-12-22 02:28:59,624 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-12-22 02:28:59,624 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-12-22 02:28:59,624 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-12-22 02:28:59,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-22 02:28:59,624 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-12-22 02:28:59,624 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-12-22 02:28:59,624 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-12-22 02:28:59,625 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-12-22 02:28:59,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-22 02:28:59,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-22 02:28:59,626 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-12-22 02:28:59,626 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-12-22 02:28:59,691 INFO L241 CfgBuilder]: Building ICFG [2023-12-22 02:28:59,694 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-22 02:29:00,078 INFO L282 CfgBuilder]: Performing block encoding [2023-12-22 02:29:00,114 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-22 02:29:00,114 INFO L309 CfgBuilder]: Removed 8 assume(true) statements. [2023-12-22 02:29:00,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 02:29:00 BoogieIcfgContainer [2023-12-22 02:29:00,114 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-22 02:29:00,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-22 02:29:00,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-22 02:29:00,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-22 02:29:00,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 02:28:59" (1/3) ... [2023-12-22 02:29:00,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c7f81af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 02:29:00, skipping insertion in model container [2023-12-22 02:29:00,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:28:59" (2/3) ... [2023-12-22 02:29:00,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c7f81af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 02:29:00, skipping insertion in model container [2023-12-22 02:29:00,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 02:29:00" (3/3) ... [2023-12-22 02:29:00,120 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2023-12-22 02:29:00,132 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-22 02:29:00,132 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-22 02:29:00,171 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-22 02:29:00,177 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;@7bf2a631, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-22 02:29:00,177 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-22 02:29:00,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 125 states have (on average 1.632) internal successors, (204), 130 states have internal predecessors, (204), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-22 02:29:00,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-22 02:29:00,189 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:00,189 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] [2023-12-22 02:29:00,190 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:00,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:00,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1528274659, now seen corresponding path program 1 times [2023-12-22 02:29:00,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:00,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684274922] [2023-12-22 02:29:00,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:00,203 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-22 02:29:00,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:00,209 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-22 02:29:00,210 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-22 02:29:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:00,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:00,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:00,383 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-22 02:29:00,383 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:00,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:00,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684274922] [2023-12-22 02:29:00,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684274922] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:00,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:00,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:00,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365223262] [2023-12-22 02:29:00,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:00,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:00,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:00,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:00,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:00,424 INFO L87 Difference]: Start difference. First operand has 158 states, 125 states have (on average 1.632) internal successors, (204), 130 states have internal predecessors, (204), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-22 02:29:00,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:00,557 INFO L93 Difference]: Finished difference Result 358 states and 563 transitions. [2023-12-22 02:29:00,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:00,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2023-12-22 02:29:00,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:00,576 INFO L225 Difference]: With dead ends: 358 [2023-12-22 02:29:00,576 INFO L226 Difference]: Without dead ends: 206 [2023-12-22 02:29:00,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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-22 02:29:00,582 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 203 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:00,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 286 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:29:00,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-12-22 02:29:00,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 202. [2023-12-22 02:29:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 165 states have (on average 1.4606060606060607) internal successors, (241), 168 states have internal predecessors, (241), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (27), 23 states have call predecessors, (27), 23 states have call successors, (27) [2023-12-22 02:29:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 293 transitions. [2023-12-22 02:29:00,637 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 293 transitions. Word has length 37 [2023-12-22 02:29:00,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:00,637 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 293 transitions. [2023-12-22 02:29:00,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-22 02:29:00,637 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 293 transitions. [2023-12-22 02:29:00,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-22 02:29:00,640 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:00,640 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] [2023-12-22 02:29:00,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:00,848 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-22 02:29:00,849 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:00,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:00,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1110502537, now seen corresponding path program 1 times [2023-12-22 02:29:00,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:00,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [605412295] [2023-12-22 02:29:00,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:00,851 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-22 02:29:00,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:00,854 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-22 02:29:00,866 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-22 02:29:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:00,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:00,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:00,980 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-22 02:29:00,980 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:00,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:00,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [605412295] [2023-12-22 02:29:00,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [605412295] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:00,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:00,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:00,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568402541] [2023-12-22 02:29:00,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:00,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:00,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:00,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:00,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:00,988 INFO L87 Difference]: Start difference. First operand 202 states and 293 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-22 02:29:01,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:01,053 INFO L93 Difference]: Finished difference Result 402 states and 585 transitions. [2023-12-22 02:29:01,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:01,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2023-12-22 02:29:01,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:01,056 INFO L225 Difference]: With dead ends: 402 [2023-12-22 02:29:01,056 INFO L226 Difference]: Without dead ends: 299 [2023-12-22 02:29:01,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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-22 02:29:01,058 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 195 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:01,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 268 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:01,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-22 02:29:01,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2023-12-22 02:29:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 246 states have (on average 1.4308943089430894) internal successors, (352), 249 states have internal predecessors, (352), 33 states have call successors, (33), 15 states have call predecessors, (33), 14 states have return successors, (39), 31 states have call predecessors, (39), 31 states have call successors, (39) [2023-12-22 02:29:01,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 424 transitions. [2023-12-22 02:29:01,080 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 424 transitions. Word has length 38 [2023-12-22 02:29:01,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:01,080 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 424 transitions. [2023-12-22 02:29:01,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-22 02:29:01,081 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 424 transitions. [2023-12-22 02:29:01,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-22 02:29:01,083 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:01,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:01,088 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-22 02:29:01,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:01,287 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:01,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:01,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1727996056, now seen corresponding path program 1 times [2023-12-22 02:29:01,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:01,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913491815] [2023-12-22 02:29:01,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:01,289 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-22 02:29:01,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:01,291 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-22 02:29:01,316 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-22 02:29:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:01,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:01,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:01,369 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-22 02:29:01,369 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:01,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:01,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913491815] [2023-12-22 02:29:01,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913491815] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:01,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:01,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:01,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95191763] [2023-12-22 02:29:01,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:01,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:01,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:01,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:01,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:01,371 INFO L87 Difference]: Start difference. First operand 295 states and 424 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-22 02:29:01,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:01,431 INFO L93 Difference]: Finished difference Result 647 states and 921 transitions. [2023-12-22 02:29:01,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:01,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2023-12-22 02:29:01,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:01,433 INFO L225 Difference]: With dead ends: 647 [2023-12-22 02:29:01,433 INFO L226 Difference]: Without dead ends: 451 [2023-12-22 02:29:01,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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-22 02:29:01,434 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 58 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:01,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 404 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:01,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2023-12-22 02:29:01,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 400. [2023-12-22 02:29:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 339 states have (on average 1.4188790560471976) internal successors, (481), 344 states have internal predecessors, (481), 39 states have call successors, (39), 21 states have call predecessors, (39), 20 states have return successors, (47), 35 states have call predecessors, (47), 37 states have call successors, (47) [2023-12-22 02:29:01,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 567 transitions. [2023-12-22 02:29:01,460 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 567 transitions. Word has length 39 [2023-12-22 02:29:01,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:01,460 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 567 transitions. [2023-12-22 02:29:01,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-22 02:29:01,460 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 567 transitions. [2023-12-22 02:29:01,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-22 02:29:01,462 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:01,462 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] [2023-12-22 02:29:01,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-22 02:29:01,665 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-22 02:29:01,666 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:01,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:01,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1833980046, now seen corresponding path program 1 times [2023-12-22 02:29:01,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:01,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494571939] [2023-12-22 02:29:01,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:01,667 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-22 02:29:01,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:01,668 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-22 02:29:01,673 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-22 02:29:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:01,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:01,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:01,756 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-22 02:29:01,756 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:01,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:01,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494571939] [2023-12-22 02:29:01,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494571939] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:01,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:01,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:01,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761214694] [2023-12-22 02:29:01,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:01,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:01,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:01,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:01,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:01,758 INFO L87 Difference]: Start difference. First operand 400 states and 567 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:29:01,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:01,798 INFO L93 Difference]: Finished difference Result 489 states and 696 transitions. [2023-12-22 02:29:01,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:01,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-12-22 02:29:01,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:01,800 INFO L225 Difference]: With dead ends: 489 [2023-12-22 02:29:01,801 INFO L226 Difference]: Without dead ends: 400 [2023-12-22 02:29:01,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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-22 02:29:01,802 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 129 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:01,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 279 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:01,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2023-12-22 02:29:01,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2023-12-22 02:29:01,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 339 states have (on average 1.415929203539823) internal successors, (480), 344 states have internal predecessors, (480), 39 states have call successors, (39), 21 states have call predecessors, (39), 20 states have return successors, (47), 35 states have call predecessors, (47), 37 states have call successors, (47) [2023-12-22 02:29:01,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 566 transitions. [2023-12-22 02:29:01,822 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 566 transitions. Word has length 51 [2023-12-22 02:29:01,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:01,822 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 566 transitions. [2023-12-22 02:29:01,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:29:01,823 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 566 transitions. [2023-12-22 02:29:01,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-22 02:29:01,825 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:01,825 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] [2023-12-22 02:29:01,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:02,028 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-22 02:29:02,029 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:02,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:02,029 INFO L85 PathProgramCache]: Analyzing trace with hash 940493708, now seen corresponding path program 1 times [2023-12-22 02:29:02,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:02,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444357933] [2023-12-22 02:29:02,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:02,030 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-22 02:29:02,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:02,031 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-22 02:29:02,033 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-22 02:29:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:02,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:02,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:02,138 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-22 02:29:02,138 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:02,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:02,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444357933] [2023-12-22 02:29:02,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444357933] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:02,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:02,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:02,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693623966] [2023-12-22 02:29:02,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:02,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:29:02,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:02,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:29:02,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:02,140 INFO L87 Difference]: Start difference. First operand 400 states and 566 transitions. 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, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:29:02,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:02,420 INFO L93 Difference]: Finished difference Result 577 states and 825 transitions. [2023-12-22 02:29:02,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:29:02,421 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, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-12-22 02:29:02,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:02,423 INFO L225 Difference]: With dead ends: 577 [2023-12-22 02:29:02,423 INFO L226 Difference]: Without dead ends: 491 [2023-12-22 02:29:02,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 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-22 02:29:02,426 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 309 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:02,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 473 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:02,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2023-12-22 02:29:02,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 484. [2023-12-22 02:29:02,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 406 states have (on average 1.4261083743842364) internal successors, (579), 412 states have internal predecessors, (579), 49 states have call successors, (49), 27 states have call predecessors, (49), 27 states have return successors, (58), 45 states have call predecessors, (58), 47 states have call successors, (58) [2023-12-22 02:29:02,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 686 transitions. [2023-12-22 02:29:02,458 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 686 transitions. Word has length 51 [2023-12-22 02:29:02,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:02,460 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 686 transitions. [2023-12-22 02:29:02,460 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, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:29:02,460 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 686 transitions. [2023-12-22 02:29:02,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-22 02:29:02,462 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:02,463 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] [2023-12-22 02:29:02,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:02,666 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-22 02:29:02,666 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:02,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:02,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1786842256, now seen corresponding path program 1 times [2023-12-22 02:29:02,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:02,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69618105] [2023-12-22 02:29:02,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:02,668 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-22 02:29:02,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:02,669 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-22 02:29:02,670 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-22 02:29:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:02,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:02,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:02,745 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-22 02:29:02,745 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:02,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:02,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [69618105] [2023-12-22 02:29:02,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [69618105] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:02,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:02,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:02,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829159507] [2023-12-22 02:29:02,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:02,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:29:02,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:02,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:29:02,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:02,747 INFO L87 Difference]: Start difference. First operand 484 states and 686 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, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:29:02,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:02,937 INFO L93 Difference]: Finished difference Result 654 states and 937 transitions. [2023-12-22 02:29:02,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:02,938 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, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-12-22 02:29:02,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:02,939 INFO L225 Difference]: With dead ends: 654 [2023-12-22 02:29:02,940 INFO L226 Difference]: Without dead ends: 484 [2023-12-22 02:29:02,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 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-22 02:29:02,941 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 257 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:02,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 333 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:02,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2023-12-22 02:29:02,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2023-12-22 02:29:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 406 states have (on average 1.4088669950738917) internal successors, (572), 412 states have internal predecessors, (572), 49 states have call successors, (49), 27 states have call predecessors, (49), 27 states have return successors, (58), 45 states have call predecessors, (58), 47 states have call successors, (58) [2023-12-22 02:29:02,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 679 transitions. [2023-12-22 02:29:02,964 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 679 transitions. Word has length 51 [2023-12-22 02:29:02,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:02,964 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 679 transitions. [2023-12-22 02:29:02,964 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, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:29:02,964 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 679 transitions. [2023-12-22 02:29:02,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-22 02:29:02,965 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:02,965 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] [2023-12-22 02:29:02,971 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-22 02:29:03,168 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-22 02:29:03,169 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:03,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:03,169 INFO L85 PathProgramCache]: Analyzing trace with hash -402613492, now seen corresponding path program 1 times [2023-12-22 02:29:03,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:03,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645989586] [2023-12-22 02:29:03,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:03,170 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-22 02:29:03,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:03,171 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-22 02:29:03,173 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-22 02:29:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:03,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:03,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:03,263 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-22 02:29:03,264 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:03,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:03,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645989586] [2023-12-22 02:29:03,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645989586] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:03,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:03,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:03,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733109935] [2023-12-22 02:29:03,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:03,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:29:03,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:03,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:29:03,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:03,266 INFO L87 Difference]: Start difference. First operand 484 states and 679 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, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:29:03,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:03,494 INFO L93 Difference]: Finished difference Result 688 states and 975 transitions. [2023-12-22 02:29:03,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:29:03,494 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, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-12-22 02:29:03,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:03,496 INFO L225 Difference]: With dead ends: 688 [2023-12-22 02:29:03,496 INFO L226 Difference]: Without dead ends: 518 [2023-12-22 02:29:03,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 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-22 02:29:03,497 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 265 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:03,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 327 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:03,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2023-12-22 02:29:03,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2023-12-22 02:29:03,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 434 states have (on average 1.3894009216589862) internal successors, (603), 440 states have internal predecessors, (603), 51 states have call successors, (51), 31 states have call predecessors, (51), 31 states have return successors, (60), 47 states have call predecessors, (60), 49 states have call successors, (60) [2023-12-22 02:29:03,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 714 transitions. [2023-12-22 02:29:03,528 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 714 transitions. Word has length 51 [2023-12-22 02:29:03,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:03,529 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 714 transitions. [2023-12-22 02:29:03,529 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, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:29:03,529 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 714 transitions. [2023-12-22 02:29:03,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-22 02:29:03,530 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:03,530 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] [2023-12-22 02:29:03,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-22 02:29:03,733 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-22 02:29:03,734 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:03,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:03,736 INFO L85 PathProgramCache]: Analyzing trace with hash 560410791, now seen corresponding path program 1 times [2023-12-22 02:29:03,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:03,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313798783] [2023-12-22 02:29:03,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:03,737 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-22 02:29:03,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:03,738 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-22 02:29:03,744 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-22 02:29:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:03,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:03,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:03,801 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-22 02:29:03,801 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:03,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:03,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313798783] [2023-12-22 02:29:03,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [313798783] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:03,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:03,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:03,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373441032] [2023-12-22 02:29:03,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:03,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:03,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:03,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:03,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:03,803 INFO L87 Difference]: Start difference. First operand 518 states and 714 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:29:03,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:03,859 INFO L93 Difference]: Finished difference Result 761 states and 1054 transitions. [2023-12-22 02:29:03,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:03,860 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-12-22 02:29:03,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:03,862 INFO L225 Difference]: With dead ends: 761 [2023-12-22 02:29:03,862 INFO L226 Difference]: Without dead ends: 558 [2023-12-22 02:29:03,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 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-22 02:29:03,863 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 11 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:03,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 580 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:03,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2023-12-22 02:29:03,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 526. [2023-12-22 02:29:03,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 442 states have (on average 1.3823529411764706) internal successors, (611), 448 states have internal predecessors, (611), 51 states have call successors, (51), 31 states have call predecessors, (51), 31 states have return successors, (60), 47 states have call predecessors, (60), 49 states have call successors, (60) [2023-12-22 02:29:03,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 722 transitions. [2023-12-22 02:29:03,889 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 722 transitions. Word has length 51 [2023-12-22 02:29:03,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:03,890 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 722 transitions. [2023-12-22 02:29:03,890 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:29:03,890 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 722 transitions. [2023-12-22 02:29:03,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-22 02:29:03,891 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:03,891 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] [2023-12-22 02:29:03,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:04,094 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-22 02:29:04,094 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:04,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:04,095 INFO L85 PathProgramCache]: Analyzing trace with hash 583043045, now seen corresponding path program 1 times [2023-12-22 02:29:04,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:04,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875463703] [2023-12-22 02:29:04,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:04,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:04,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:04,097 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-22 02:29:04,125 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-22 02:29:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:04,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:04,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:04,183 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-22 02:29:04,183 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:04,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:04,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875463703] [2023-12-22 02:29:04,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875463703] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:04,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:04,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:04,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750646212] [2023-12-22 02:29:04,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:04,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:04,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:04,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:04,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:04,186 INFO L87 Difference]: Start difference. First operand 526 states and 722 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:29:04,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:04,244 INFO L93 Difference]: Finished difference Result 745 states and 1022 transitions. [2023-12-22 02:29:04,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:04,244 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-12-22 02:29:04,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:04,247 INFO L225 Difference]: With dead ends: 745 [2023-12-22 02:29:04,247 INFO L226 Difference]: Without dead ends: 534 [2023-12-22 02:29:04,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 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-22 02:29:04,249 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 2 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:04,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 583 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:04,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2023-12-22 02:29:04,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 530. [2023-12-22 02:29:04,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 446 states have (on average 1.3744394618834082) internal successors, (613), 452 states have internal predecessors, (613), 51 states have call successors, (51), 31 states have call predecessors, (51), 31 states have return successors, (60), 47 states have call predecessors, (60), 49 states have call successors, (60) [2023-12-22 02:29:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 724 transitions. [2023-12-22 02:29:04,299 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 724 transitions. Word has length 51 [2023-12-22 02:29:04,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:04,299 INFO L495 AbstractCegarLoop]: Abstraction has 530 states and 724 transitions. [2023-12-22 02:29:04,299 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:29:04,299 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 724 transitions. [2023-12-22 02:29:04,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-22 02:29:04,301 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:04,301 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] [2023-12-22 02:29:04,315 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-22 02:29:04,504 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-22 02:29:04,504 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:04,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:04,505 INFO L85 PathProgramCache]: Analyzing trace with hash 723591655, now seen corresponding path program 1 times [2023-12-22 02:29:04,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:04,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169618709] [2023-12-22 02:29:04,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:04,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-22 02:29:04,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:04,506 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-22 02:29:04,532 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-22 02:29:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:04,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-22 02:29:04,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:04,621 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-22 02:29:04,622 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:04,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:04,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169618709] [2023-12-22 02:29:04,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169618709] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:04,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:04,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:04,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945191523] [2023-12-22 02:29:04,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:04,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 02:29:04,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:04,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 02:29:04,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 02:29:04,623 INFO L87 Difference]: Start difference. First operand 530 states and 724 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, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:29:04,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:04,849 INFO L93 Difference]: Finished difference Result 790 states and 1069 transitions. [2023-12-22 02:29:04,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:29:04,849 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, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2023-12-22 02:29:04,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:04,851 INFO L225 Difference]: With dead ends: 790 [2023-12-22 02:29:04,851 INFO L226 Difference]: Without dead ends: 574 [2023-12-22 02:29:04,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-22 02:29:04,852 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 253 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:04,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 321 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:04,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2023-12-22 02:29:04,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 554. [2023-12-22 02:29:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 468 states have (on average 1.3418803418803418) internal successors, (628), 474 states have internal predecessors, (628), 51 states have call successors, (51), 33 states have call predecessors, (51), 33 states have return successors, (60), 47 states have call predecessors, (60), 49 states have call successors, (60) [2023-12-22 02:29:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 739 transitions. [2023-12-22 02:29:04,877 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 739 transitions. Word has length 51 [2023-12-22 02:29:04,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:04,877 INFO L495 AbstractCegarLoop]: Abstraction has 554 states and 739 transitions. [2023-12-22 02:29:04,877 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, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-22 02:29:04,877 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 739 transitions. [2023-12-22 02:29:04,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-22 02:29:04,878 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:04,878 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] [2023-12-22 02:29:04,881 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-22 02:29:05,081 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-22 02:29:05,081 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:05,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:05,082 INFO L85 PathProgramCache]: Analyzing trace with hash -965352087, now seen corresponding path program 1 times [2023-12-22 02:29:05,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:05,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316337084] [2023-12-22 02:29:05,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:05,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:05,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:05,084 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-22 02:29:05,110 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-22 02:29:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:05,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:05,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:05,175 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-22 02:29:05,175 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:05,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:05,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316337084] [2023-12-22 02:29:05,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316337084] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:05,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:05,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 02:29:05,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589930137] [2023-12-22 02:29:05,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:05,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:05,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:05,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:05,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:05,176 INFO L87 Difference]: Start difference. First operand 554 states and 739 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-22 02:29:05,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:05,259 INFO L93 Difference]: Finished difference Result 1013 states and 1314 transitions. [2023-12-22 02:29:05,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:05,259 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), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2023-12-22 02:29:05,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:05,262 INFO L225 Difference]: With dead ends: 1013 [2023-12-22 02:29:05,262 INFO L226 Difference]: Without dead ends: 774 [2023-12-22 02:29:05,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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-22 02:29:05,263 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 152 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:05,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 316 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:05,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2023-12-22 02:29:05,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 772. [2023-12-22 02:29:05,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 644 states have (on average 1.3027950310559007) internal successors, (839), 653 states have internal predecessors, (839), 74 states have call successors, (74), 51 states have call predecessors, (74), 52 states have return successors, (84), 68 states have call predecessors, (84), 72 states have call successors, (84) [2023-12-22 02:29:05,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 997 transitions. [2023-12-22 02:29:05,315 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 997 transitions. Word has length 51 [2023-12-22 02:29:05,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:05,315 INFO L495 AbstractCegarLoop]: Abstraction has 772 states and 997 transitions. [2023-12-22 02:29:05,316 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), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-22 02:29:05,316 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 997 transitions. [2023-12-22 02:29:05,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-22 02:29:05,317 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:05,317 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:05,322 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-22 02:29:05,522 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-22 02:29:05,523 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:05,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:05,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1488931652, now seen corresponding path program 1 times [2023-12-22 02:29:05,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:05,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953964994] [2023-12-22 02:29:05,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:05,524 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-22 02:29:05,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:05,537 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-22 02:29:05,563 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-22 02:29:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:05,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:05,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:05,595 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:29:05,595 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:05,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:05,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953964994] [2023-12-22 02:29:05,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953964994] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:05,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:05,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:05,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572896330] [2023-12-22 02:29:05,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:05,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:05,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:05,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:05,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:05,596 INFO L87 Difference]: Start difference. First operand 772 states and 997 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-22 02:29:05,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:05,659 INFO L93 Difference]: Finished difference Result 1224 states and 1634 transitions. [2023-12-22 02:29:05,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:05,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 54 [2023-12-22 02:29:05,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:05,662 INFO L225 Difference]: With dead ends: 1224 [2023-12-22 02:29:05,662 INFO L226 Difference]: Without dead ends: 923 [2023-12-22 02:29:05,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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-22 02:29:05,663 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 46 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:05,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 425 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:05,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2023-12-22 02:29:05,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 923. [2023-12-22 02:29:05,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 773 states have (on average 1.2910737386804658) internal successors, (998), 782 states have internal predecessors, (998), 88 states have call successors, (88), 59 states have call predecessors, (88), 60 states have return successors, (106), 82 states have call predecessors, (106), 86 states have call successors, (106) [2023-12-22 02:29:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1192 transitions. [2023-12-22 02:29:05,727 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1192 transitions. Word has length 54 [2023-12-22 02:29:05,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:05,728 INFO L495 AbstractCegarLoop]: Abstraction has 923 states and 1192 transitions. [2023-12-22 02:29:05,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-22 02:29:05,728 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1192 transitions. [2023-12-22 02:29:05,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-22 02:29:05,729 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:05,729 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:29:05,740 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 (13)] Ended with exit code 0 [2023-12-22 02:29:05,932 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-22 02:29:05,933 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:05,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:05,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1336073208, now seen corresponding path program 1 times [2023-12-22 02:29:05,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:05,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741516399] [2023-12-22 02:29:05,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:05,934 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-22 02:29:05,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:05,935 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-22 02:29:05,974 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-22 02:29:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:05,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:05,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:06,012 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-22 02:29:06,012 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:06,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:06,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741516399] [2023-12-22 02:29:06,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741516399] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:06,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:06,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:06,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514188560] [2023-12-22 02:29:06,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:06,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:06,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:06,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:06,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:06,013 INFO L87 Difference]: Start difference. First operand 923 states and 1192 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-22 02:29:06,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:06,077 INFO L93 Difference]: Finished difference Result 1408 states and 1851 transitions. [2023-12-22 02:29:06,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:06,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2023-12-22 02:29:06,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:06,081 INFO L225 Difference]: With dead ends: 1408 [2023-12-22 02:29:06,081 INFO L226 Difference]: Without dead ends: 1036 [2023-12-22 02:29:06,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:06,082 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 172 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:06,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 262 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:06,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2023-12-22 02:29:06,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1036. [2023-12-22 02:29:06,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 872 states have (on average 1.2798165137614679) internal successors, (1116), 881 states have internal predecessors, (1116), 96 states have call successors, (96), 65 states have call predecessors, (96), 66 states have return successors, (118), 90 states have call predecessors, (118), 94 states have call successors, (118) [2023-12-22 02:29:06,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1330 transitions. [2023-12-22 02:29:06,125 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1330 transitions. Word has length 59 [2023-12-22 02:29:06,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:06,126 INFO L495 AbstractCegarLoop]: Abstraction has 1036 states and 1330 transitions. [2023-12-22 02:29:06,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-22 02:29:06,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1330 transitions. [2023-12-22 02:29:06,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-22 02:29:06,127 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:06,127 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:29:06,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:06,330 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-22 02:29:06,331 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:06,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:06,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1066089968, now seen corresponding path program 1 times [2023-12-22 02:29:06,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:06,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690697853] [2023-12-22 02:29:06,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:06,332 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-22 02:29:06,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:06,333 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-22 02:29:06,360 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-22 02:29:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:06,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:06,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:06,389 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-22 02:29:06,389 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:06,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:06,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690697853] [2023-12-22 02:29:06,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [690697853] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:06,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:06,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:06,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583519407] [2023-12-22 02:29:06,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:06,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:06,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:06,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:06,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:06,391 INFO L87 Difference]: Start difference. First operand 1036 states and 1330 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-22 02:29:06,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:06,477 INFO L93 Difference]: Finished difference Result 1535 states and 2019 transitions. [2023-12-22 02:29:06,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:06,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2023-12-22 02:29:06,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:06,480 INFO L225 Difference]: With dead ends: 1535 [2023-12-22 02:29:06,480 INFO L226 Difference]: Without dead ends: 1097 [2023-12-22 02:29:06,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 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-22 02:29:06,482 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 11 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:06,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 574 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:06,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2023-12-22 02:29:06,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1067. [2023-12-22 02:29:06,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 901 states have (on average 1.2708102108768036) internal successors, (1145), 912 states have internal predecessors, (1145), 96 states have call successors, (96), 65 states have call predecessors, (96), 68 states have return successors, (120), 90 states have call predecessors, (120), 94 states have call successors, (120) [2023-12-22 02:29:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1361 transitions. [2023-12-22 02:29:06,525 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1361 transitions. Word has length 60 [2023-12-22 02:29:06,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:06,525 INFO L495 AbstractCegarLoop]: Abstraction has 1067 states and 1361 transitions. [2023-12-22 02:29:06,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-22 02:29:06,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1361 transitions. [2023-12-22 02:29:06,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-22 02:29:06,526 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:06,526 INFO L195 NwaCegarLoop]: trace histogram [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-22 02:29:06,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:06,730 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-22 02:29:06,730 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:06,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:06,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1910095470, now seen corresponding path program 1 times [2023-12-22 02:29:06,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:06,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774438929] [2023-12-22 02:29:06,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:06,731 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-22 02:29:06,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:06,739 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-22 02:29:06,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-22 02:29:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:06,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:06,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:06,806 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-22 02:29:06,806 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:06,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:06,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774438929] [2023-12-22 02:29:06,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774438929] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:06,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:06,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:06,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209700640] [2023-12-22 02:29:06,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:06,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:06,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:06,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:06,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:06,807 INFO L87 Difference]: Start difference. First operand 1067 states and 1361 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-22 02:29:06,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:06,896 INFO L93 Difference]: Finished difference Result 1484 states and 1930 transitions. [2023-12-22 02:29:06,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:06,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2023-12-22 02:29:06,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:06,899 INFO L225 Difference]: With dead ends: 1484 [2023-12-22 02:29:06,899 INFO L226 Difference]: Without dead ends: 974 [2023-12-22 02:29:06,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 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-22 02:29:06,901 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 2 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:06,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 571 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:06,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2023-12-22 02:29:06,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 968. [2023-12-22 02:29:06,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 816 states have (on average 1.2622549019607843) internal successors, (1030), 829 states have internal predecessors, (1030), 86 states have call successors, (86), 59 states have call predecessors, (86), 64 states have return successors, (106), 80 states have call predecessors, (106), 84 states have call successors, (106) [2023-12-22 02:29:06,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1222 transitions. [2023-12-22 02:29:06,938 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1222 transitions. Word has length 60 [2023-12-22 02:29:06,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:06,939 INFO L495 AbstractCegarLoop]: Abstraction has 968 states and 1222 transitions. [2023-12-22 02:29:06,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-22 02:29:06,939 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1222 transitions. [2023-12-22 02:29:06,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-22 02:29:06,940 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:06,940 INFO L195 NwaCegarLoop]: trace histogram [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-22 02:29:06,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-22 02:29:07,143 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-22 02:29:07,144 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:07,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:07,144 INFO L85 PathProgramCache]: Analyzing trace with hash -112455854, now seen corresponding path program 1 times [2023-12-22 02:29:07,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:07,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800355907] [2023-12-22 02:29:07,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:07,145 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-22 02:29:07,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:07,161 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-22 02:29:07,205 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-22 02:29:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:07,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:07,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:07,298 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:29:07,298 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 02:29:07,345 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-22 02:29:07,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:07,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800355907] [2023-12-22 02:29:07,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800355907] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 02:29:07,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 02:29:07,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-12-22 02:29:07,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013197980] [2023-12-22 02:29:07,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:07,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:07,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:07,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:07,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:07,346 INFO L87 Difference]: Start difference. First operand 968 states and 1222 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-22 02:29:07,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:07,482 INFO L93 Difference]: Finished difference Result 1017 states and 1283 transitions. [2023-12-22 02:29:07,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:07,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2023-12-22 02:29:07,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:07,486 INFO L225 Difference]: With dead ends: 1017 [2023-12-22 02:29:07,486 INFO L226 Difference]: Without dead ends: 1014 [2023-12-22 02:29:07,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 117 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-22 02:29:07,487 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 347 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:07,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 264 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:29:07,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2023-12-22 02:29:07,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 967. [2023-12-22 02:29:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 816 states have (on average 1.2598039215686274) internal successors, (1028), 828 states have internal predecessors, (1028), 85 states have call successors, (85), 59 states have call predecessors, (85), 64 states have return successors, (106), 80 states have call predecessors, (106), 84 states have call successors, (106) [2023-12-22 02:29:07,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1219 transitions. [2023-12-22 02:29:07,572 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1219 transitions. Word has length 60 [2023-12-22 02:29:07,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:07,573 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1219 transitions. [2023-12-22 02:29:07,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-22 02:29:07,573 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1219 transitions. [2023-12-22 02:29:07,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-22 02:29:07,574 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:07,574 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-22 02:29:07,594 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 (17)] Ended with exit code 0 [2023-12-22 02:29:07,777 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-22 02:29:07,777 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:07,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:07,778 INFO L85 PathProgramCache]: Analyzing trace with hash 808247865, now seen corresponding path program 1 times [2023-12-22 02:29:07,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:07,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334850297] [2023-12-22 02:29:07,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:07,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-22 02:29:07,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:07,780 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-22 02:29:07,817 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-22 02:29:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:07,860 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 02:29:07,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 02:29:08,043 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 02:29:08,109 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-22 02:29:08,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:08,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334850297] [2023-12-22 02:29:08,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334850297] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 02:29:08,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 02:29:08,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2023-12-22 02:29:08,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929828824] [2023-12-22 02:29:08,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 02:29:08,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-22 02:29:08,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:08,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-22 02:29:08,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-22 02:29:08,111 INFO L87 Difference]: Start difference. First operand 967 states and 1219 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-22 02:29:08,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:08,365 INFO L93 Difference]: Finished difference Result 1686 states and 2157 transitions. [2023-12-22 02:29:08,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-22 02:29:08,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 61 [2023-12-22 02:29:08,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:08,371 INFO L225 Difference]: With dead ends: 1686 [2023-12-22 02:29:08,371 INFO L226 Difference]: Without dead ends: 1683 [2023-12-22 02:29:08,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-22 02:29:08,372 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 370 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:08,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 891 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:29:08,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2023-12-22 02:29:08,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1270. [2023-12-22 02:29:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1083 states have (on average 1.2686980609418284) internal successors, (1374), 1101 states have internal predecessors, (1374), 104 states have call successors, (104), 72 states have call predecessors, (104), 81 states have return successors, (137), 97 states have call predecessors, (137), 103 states have call successors, (137) [2023-12-22 02:29:08,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1615 transitions. [2023-12-22 02:29:08,452 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1615 transitions. Word has length 61 [2023-12-22 02:29:08,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:08,453 INFO L495 AbstractCegarLoop]: Abstraction has 1270 states and 1615 transitions. [2023-12-22 02:29:08,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-22 02:29:08,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1615 transitions. [2023-12-22 02:29:08,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-22 02:29:08,455 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:08,455 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-22 02:29:08,459 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-22 02:29:08,658 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-22 02:29:08,659 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:08,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:08,659 INFO L85 PathProgramCache]: Analyzing trace with hash 490403576, now seen corresponding path program 2 times [2023-12-22 02:29:08,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:08,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456564427] [2023-12-22 02:29:08,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-22 02:29:08,660 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-22 02:29:08,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:08,661 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:08,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-22 02:29:08,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-22 02:29:08,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-22 02:29:08,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:08,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:08,732 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-22 02:29:08,733 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:08,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:08,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456564427] [2023-12-22 02:29:08,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456564427] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:08,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:08,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:08,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751595371] [2023-12-22 02:29:08,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:08,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:08,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:08,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:08,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:08,736 INFO L87 Difference]: Start difference. First operand 1270 states and 1615 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-22 02:29:08,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:08,840 INFO L93 Difference]: Finished difference Result 1825 states and 2346 transitions. [2023-12-22 02:29:08,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:08,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2023-12-22 02:29:08,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:08,844 INFO L225 Difference]: With dead ends: 1825 [2023-12-22 02:29:08,844 INFO L226 Difference]: Without dead ends: 1174 [2023-12-22 02:29:08,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 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-22 02:29:08,846 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 174 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:08,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 281 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:08,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2023-12-22 02:29:08,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1162. [2023-12-22 02:29:08,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 988 states have (on average 1.2611336032388665) internal successors, (1246), 1006 states have internal predecessors, (1246), 97 states have call successors, (97), 67 states have call predecessors, (97), 75 states have return successors, (126), 89 states have call predecessors, (126), 96 states have call successors, (126) [2023-12-22 02:29:08,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1469 transitions. [2023-12-22 02:29:08,903 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1469 transitions. Word has length 78 [2023-12-22 02:29:08,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:08,904 INFO L495 AbstractCegarLoop]: Abstraction has 1162 states and 1469 transitions. [2023-12-22 02:29:08,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-22 02:29:08,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1469 transitions. [2023-12-22 02:29:08,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-22 02:29:08,905 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:08,905 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:08,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:09,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:09,110 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:09,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:09,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1707477680, now seen corresponding path program 1 times [2023-12-22 02:29:09,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:09,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595289139] [2023-12-22 02:29:09,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:09,111 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-22 02:29:09,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:09,125 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:09,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-22 02:29:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:09,191 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:09,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-22 02:29:09,268 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:09,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:09,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595289139] [2023-12-22 02:29:09,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595289139] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:09,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:09,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 02:29:09,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684975746] [2023-12-22 02:29:09,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:09,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:09,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:09,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:09,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:09,270 INFO L87 Difference]: Start difference. First operand 1162 states and 1469 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-22 02:29:09,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:09,384 INFO L93 Difference]: Finished difference Result 1973 states and 2464 transitions. [2023-12-22 02:29:09,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:09,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2023-12-22 02:29:09,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:09,388 INFO L225 Difference]: With dead ends: 1973 [2023-12-22 02:29:09,388 INFO L226 Difference]: Without dead ends: 1516 [2023-12-22 02:29:09,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 81 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-22 02:29:09,389 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 143 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:09,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 315 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:09,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2023-12-22 02:29:09,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1510. [2023-12-22 02:29:09,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1268 states have (on average 1.2444794952681388) internal successors, (1578), 1290 states have internal predecessors, (1578), 135 states have call successors, (135), 95 states have call predecessors, (135), 105 states have return successors, (166), 125 states have call predecessors, (166), 134 states have call successors, (166) [2023-12-22 02:29:09,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 1879 transitions. [2023-12-22 02:29:09,469 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 1879 transitions. Word has length 83 [2023-12-22 02:29:09,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:09,469 INFO L495 AbstractCegarLoop]: Abstraction has 1510 states and 1879 transitions. [2023-12-22 02:29:09,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-22 02:29:09,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 1879 transitions. [2023-12-22 02:29:09,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-22 02:29:09,471 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:09,471 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] [2023-12-22 02:29:09,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:09,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:09,675 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:09,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:09,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1420835761, now seen corresponding path program 1 times [2023-12-22 02:29:09,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:09,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101025711] [2023-12-22 02:29:09,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:09,676 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-22 02:29:09,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:09,677 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:09,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-22 02:29:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:09,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-22 02:29:09,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:09,801 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-22 02:29:09,802 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:09,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:09,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101025711] [2023-12-22 02:29:09,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101025711] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:09,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:09,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:09,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441287608] [2023-12-22 02:29:09,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:09,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:09,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:09,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:09,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:09,803 INFO L87 Difference]: Start difference. First operand 1510 states and 1879 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, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 02:29:10,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:10,128 INFO L93 Difference]: Finished difference Result 3028 states and 3736 transitions. [2023-12-22 02:29:10,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:29:10,128 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, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 83 [2023-12-22 02:29:10,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:10,134 INFO L225 Difference]: With dead ends: 3028 [2023-12-22 02:29:10,134 INFO L226 Difference]: Without dead ends: 2224 [2023-12-22 02:29:10,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 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-22 02:29:10,136 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 217 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:10,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 352 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 02:29:10,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2023-12-22 02:29:10,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 2222. [2023-12-22 02:29:10,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2222 states, 1833 states have (on average 1.2214948172394982) internal successors, (2239), 1868 states have internal predecessors, (2239), 214 states have call successors, (214), 151 states have call predecessors, (214), 173 states have return successors, (281), 204 states have call predecessors, (281), 213 states have call successors, (281) [2023-12-22 02:29:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 2734 transitions. [2023-12-22 02:29:10,288 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 2734 transitions. Word has length 83 [2023-12-22 02:29:10,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:10,288 INFO L495 AbstractCegarLoop]: Abstraction has 2222 states and 2734 transitions. [2023-12-22 02:29:10,288 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, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 02:29:10,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 2734 transitions. [2023-12-22 02:29:10,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-22 02:29:10,292 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:10,292 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] [2023-12-22 02:29:10,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:10,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:10,496 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:10,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:10,497 INFO L85 PathProgramCache]: Analyzing trace with hash -656501137, now seen corresponding path program 1 times [2023-12-22 02:29:10,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:10,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221794252] [2023-12-22 02:29:10,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:10,497 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-22 02:29:10,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:10,513 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:10,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-22 02:29:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:10,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:10,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:10,578 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-22 02:29:10,578 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:10,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:10,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221794252] [2023-12-22 02:29:10,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221794252] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:10,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:10,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:10,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344261934] [2023-12-22 02:29:10,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:10,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:10,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:10,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:10,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:10,580 INFO L87 Difference]: Start difference. First operand 2222 states and 2734 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:29:10,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:10,727 INFO L93 Difference]: Finished difference Result 3398 states and 4137 transitions. [2023-12-22 02:29:10,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:10,728 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 83 [2023-12-22 02:29:10,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:10,733 INFO L225 Difference]: With dead ends: 3398 [2023-12-22 02:29:10,733 INFO L226 Difference]: Without dead ends: 1882 [2023-12-22 02:29:10,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 81 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-22 02:29:10,735 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 118 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:10,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 263 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:10,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2023-12-22 02:29:10,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1882. [2023-12-22 02:29:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1882 states, 1564 states have (on average 1.2282608695652173) internal successors, (1921), 1594 states have internal predecessors, (1921), 173 states have call successors, (173), 123 states have call predecessors, (173), 143 states have return successors, (226), 165 states have call predecessors, (226), 172 states have call successors, (226) [2023-12-22 02:29:10,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2320 transitions. [2023-12-22 02:29:10,844 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2320 transitions. Word has length 83 [2023-12-22 02:29:10,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:10,845 INFO L495 AbstractCegarLoop]: Abstraction has 1882 states and 2320 transitions. [2023-12-22 02:29:10,845 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 02:29:10,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2320 transitions. [2023-12-22 02:29:10,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-22 02:29:10,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:10,846 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] [2023-12-22 02:29:10,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-12-22 02:29:11,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:11,050 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:11,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:11,051 INFO L85 PathProgramCache]: Analyzing trace with hash 2018515020, now seen corresponding path program 1 times [2023-12-22 02:29:11,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:11,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [792165244] [2023-12-22 02:29:11,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:11,051 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-22 02:29:11,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:11,053 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:11,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-22 02:29:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:11,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:11,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:11,165 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-22 02:29:11,166 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:11,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:11,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [792165244] [2023-12-22 02:29:11,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [792165244] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:11,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:11,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:11,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349442633] [2023-12-22 02:29:11,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:11,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:11,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:11,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:11,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:11,167 INFO L87 Difference]: Start difference. First operand 1882 states and 2320 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-22 02:29:11,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:11,298 INFO L93 Difference]: Finished difference Result 2882 states and 3543 transitions. [2023-12-22 02:29:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:11,299 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), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 85 [2023-12-22 02:29:11,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:11,305 INFO L225 Difference]: With dead ends: 2882 [2023-12-22 02:29:11,305 INFO L226 Difference]: Without dead ends: 2150 [2023-12-22 02:29:11,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 83 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-22 02:29:11,308 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 81 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:11,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 450 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:11,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2023-12-22 02:29:11,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 2150. [2023-12-22 02:29:11,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2150 states, 1780 states have (on average 1.2174157303370787) internal successors, (2167), 1810 states have internal predecessors, (2167), 203 states have call successors, (203), 143 states have call predecessors, (203), 165 states have return successors, (268), 197 states have call predecessors, (268), 202 states have call successors, (268) [2023-12-22 02:29:11,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 2638 transitions. [2023-12-22 02:29:11,503 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 2638 transitions. Word has length 85 [2023-12-22 02:29:11,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:11,503 INFO L495 AbstractCegarLoop]: Abstraction has 2150 states and 2638 transitions. [2023-12-22 02:29:11,503 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), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-22 02:29:11,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 2638 transitions. [2023-12-22 02:29:11,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-22 02:29:11,505 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:11,505 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:11,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:11,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:11,713 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:11,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:11,713 INFO L85 PathProgramCache]: Analyzing trace with hash 431778550, now seen corresponding path program 1 times [2023-12-22 02:29:11,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:11,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699704824] [2023-12-22 02:29:11,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:11,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:11,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:11,715 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:11,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-22 02:29:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:11,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:11,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:11,809 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-22 02:29:11,809 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:11,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:11,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699704824] [2023-12-22 02:29:11,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699704824] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:11,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:11,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:11,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429433762] [2023-12-22 02:29:11,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:11,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:11,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:11,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:11,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:11,811 INFO L87 Difference]: Start difference. First operand 2150 states and 2638 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (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-22 02:29:12,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:12,052 INFO L93 Difference]: Finished difference Result 2874 states and 3579 transitions. [2023-12-22 02:29:12,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:29:12,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (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 92 [2023-12-22 02:29:12,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:12,058 INFO L225 Difference]: With dead ends: 2874 [2023-12-22 02:29:12,059 INFO L226 Difference]: Without dead ends: 2183 [2023-12-22 02:29:12,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 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-22 02:29:12,060 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 214 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:12,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 290 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:29:12,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2023-12-22 02:29:12,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 2150. [2023-12-22 02:29:12,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2150 states, 1780 states have (on average 1.208988764044944) internal successors, (2152), 1810 states have internal predecessors, (2152), 203 states have call successors, (203), 143 states have call predecessors, (203), 165 states have return successors, (267), 197 states have call predecessors, (267), 202 states have call successors, (267) [2023-12-22 02:29:12,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 2622 transitions. [2023-12-22 02:29:12,209 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 2622 transitions. Word has length 92 [2023-12-22 02:29:12,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:12,209 INFO L495 AbstractCegarLoop]: Abstraction has 2150 states and 2622 transitions. [2023-12-22 02:29:12,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (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-22 02:29:12,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 2622 transitions. [2023-12-22 02:29:12,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-22 02:29:12,212 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:12,212 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:12,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:12,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:12,413 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:12,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:12,413 INFO L85 PathProgramCache]: Analyzing trace with hash -924071807, now seen corresponding path program 1 times [2023-12-22 02:29:12,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:12,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161812226] [2023-12-22 02:29:12,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:12,414 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-22 02:29:12,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:12,415 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:12,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-22 02:29:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:12,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:12,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:12,484 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-22 02:29:12,484 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:12,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:12,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161812226] [2023-12-22 02:29:12,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161812226] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:12,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:12,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:12,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426820594] [2023-12-22 02:29:12,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:12,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:12,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:12,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:12,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:12,486 INFO L87 Difference]: Start difference. First operand 2150 states and 2622 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-22 02:29:12,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:12,629 INFO L93 Difference]: Finished difference Result 2433 states and 2973 transitions. [2023-12-22 02:29:12,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:12,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 93 [2023-12-22 02:29:12,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:12,633 INFO L225 Difference]: With dead ends: 2433 [2023-12-22 02:29:12,633 INFO L226 Difference]: Without dead ends: 1454 [2023-12-22 02:29:12,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 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-22 02:29:12,635 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 54 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:12,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 394 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:12,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2023-12-22 02:29:12,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1454. [2023-12-22 02:29:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1454 states, 1169 states have (on average 1.1847733105218134) internal successors, (1385), 1186 states have internal predecessors, (1385), 156 states have call successors, (156), 112 states have call predecessors, (156), 128 states have return successors, (194), 156 states have call predecessors, (194), 156 states have call successors, (194) [2023-12-22 02:29:12,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 1735 transitions. [2023-12-22 02:29:12,721 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 1735 transitions. Word has length 93 [2023-12-22 02:29:12,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:12,721 INFO L495 AbstractCegarLoop]: Abstraction has 1454 states and 1735 transitions. [2023-12-22 02:29:12,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-22 02:29:12,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1735 transitions. [2023-12-22 02:29:12,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-22 02:29:12,723 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:12,723 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:12,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:12,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:12,926 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:12,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:12,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1651378403, now seen corresponding path program 1 times [2023-12-22 02:29:12,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:12,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26097177] [2023-12-22 02:29:12,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:12,927 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-22 02:29:12,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:12,928 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:12,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-12-22 02:29:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:12,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 02:29:12,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:13,038 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-22 02:29:13,038 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:13,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:13,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26097177] [2023-12-22 02:29:13,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26097177] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:13,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:13,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 02:29:13,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128813634] [2023-12-22 02:29:13,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:13,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:13,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:13,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:13,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:13,040 INFO L87 Difference]: Start difference. First operand 1454 states and 1735 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-22 02:29:13,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:13,263 INFO L93 Difference]: Finished difference Result 2908 states and 3490 transitions. [2023-12-22 02:29:13,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 02:29:13,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 121 [2023-12-22 02:29:13,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:13,267 INFO L225 Difference]: With dead ends: 2908 [2023-12-22 02:29:13,267 INFO L226 Difference]: Without dead ends: 1464 [2023-12-22 02:29:13,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 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-22 02:29:13,270 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 117 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:13,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 206 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:29:13,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2023-12-22 02:29:13,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1464. [2023-12-22 02:29:13,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1464 states, 1175 states have (on average 1.1651063829787234) internal successors, (1369), 1194 states have internal predecessors, (1369), 156 states have call successors, (156), 112 states have call predecessors, (156), 132 states have return successors, (182), 158 states have call predecessors, (182), 156 states have call successors, (182) [2023-12-22 02:29:13,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 1707 transitions. [2023-12-22 02:29:13,361 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 1707 transitions. Word has length 121 [2023-12-22 02:29:13,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:13,361 INFO L495 AbstractCegarLoop]: Abstraction has 1464 states and 1707 transitions. [2023-12-22 02:29:13,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-22 02:29:13,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1707 transitions. [2023-12-22 02:29:13,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-22 02:29:13,364 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:13,364 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] [2023-12-22 02:29:13,382 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 (26)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:13,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:13,568 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:13,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:13,569 INFO L85 PathProgramCache]: Analyzing trace with hash -559000462, now seen corresponding path program 1 times [2023-12-22 02:29:13,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:13,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233743404] [2023-12-22 02:29:13,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:13,569 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-22 02:29:13,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:13,571 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:13,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-22 02:29:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:13,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 02:29:13,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-22 02:29:13,690 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:13,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:13,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233743404] [2023-12-22 02:29:13,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233743404] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:13,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:13,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-22 02:29:13,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179424928] [2023-12-22 02:29:13,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:13,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 02:29:13,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:13,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 02:29:13,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 02:29:13,692 INFO L87 Difference]: Start difference. First operand 1464 states and 1707 transitions. Second operand has 6 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-22 02:29:13,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:13,849 INFO L93 Difference]: Finished difference Result 2308 states and 2708 transitions. [2023-12-22 02:29:13,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 02:29:13,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 122 [2023-12-22 02:29:13,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:13,861 INFO L225 Difference]: With dead ends: 2308 [2023-12-22 02:29:13,861 INFO L226 Difference]: Without dead ends: 1462 [2023-12-22 02:29:13,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-22 02:29:13,863 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:13,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:13,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2023-12-22 02:29:13,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1462. [2023-12-22 02:29:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 1173 states have (on average 1.1636828644501278) internal successors, (1365), 1192 states have internal predecessors, (1365), 156 states have call successors, (156), 112 states have call predecessors, (156), 132 states have return successors, (182), 158 states have call predecessors, (182), 156 states have call successors, (182) [2023-12-22 02:29:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 1703 transitions. [2023-12-22 02:29:13,994 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 1703 transitions. Word has length 122 [2023-12-22 02:29:13,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:13,994 INFO L495 AbstractCegarLoop]: Abstraction has 1462 states and 1703 transitions. [2023-12-22 02:29:13,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-22 02:29:13,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 1703 transitions. [2023-12-22 02:29:13,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-22 02:29:13,996 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:13,996 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] [2023-12-22 02:29:14,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:14,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:14,200 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:14,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:14,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1490387380, now seen corresponding path program 1 times [2023-12-22 02:29:14,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:14,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180012240] [2023-12-22 02:29:14,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:14,201 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-22 02:29:14,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:14,217 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:14,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-22 02:29:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:14,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:14,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:14,321 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-22 02:29:14,321 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:14,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:14,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180012240] [2023-12-22 02:29:14,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180012240] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:14,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:14,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:14,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700140254] [2023-12-22 02:29:14,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:14,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:14,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:14,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:14,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:14,322 INFO L87 Difference]: Start difference. First operand 1462 states and 1703 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-22 02:29:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:14,404 INFO L93 Difference]: Finished difference Result 2176 states and 2538 transitions. [2023-12-22 02:29:14,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:14,404 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 122 [2023-12-22 02:29:14,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:14,406 INFO L225 Difference]: With dead ends: 2176 [2023-12-22 02:29:14,406 INFO L226 Difference]: Without dead ends: 662 [2023-12-22 02:29:14,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:14,408 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 85 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 261 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-22 02:29:14,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 261 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:14,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2023-12-22 02:29:14,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2023-12-22 02:29:14,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 529 states have (on average 1.1209829867674859) internal successors, (593), 536 states have internal predecessors, (593), 76 states have call successors, (76), 52 states have call predecessors, (76), 56 states have return successors, (80), 74 states have call predecessors, (80), 76 states have call successors, (80) [2023-12-22 02:29:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 749 transitions. [2023-12-22 02:29:14,449 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 749 transitions. Word has length 122 [2023-12-22 02:29:14,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:14,449 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 749 transitions. [2023-12-22 02:29:14,449 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-22 02:29:14,450 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 749 transitions. [2023-12-22 02:29:14,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-22 02:29:14,450 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:14,450 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] [2023-12-22 02:29:14,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:14,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:14,655 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:14,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:14,656 INFO L85 PathProgramCache]: Analyzing trace with hash 234742348, now seen corresponding path program 1 times [2023-12-22 02:29:14,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:14,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738121836] [2023-12-22 02:29:14,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:14,656 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-22 02:29:14,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:14,674 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:14,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-12-22 02:29:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:14,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 02:29:14,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:14,763 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-22 02:29:14,763 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:29:14,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:14,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738121836] [2023-12-22 02:29:14,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738121836] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:29:14,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:29:14,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 02:29:14,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808497849] [2023-12-22 02:29:14,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:14,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 02:29:14,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:14,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 02:29:14,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 02:29:14,765 INFO L87 Difference]: Start difference. First operand 662 states and 749 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, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-22 02:29:14,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:14,837 INFO L93 Difference]: Finished difference Result 1178 states and 1345 transitions. [2023-12-22 02:29:14,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 02:29:14,837 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, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 123 [2023-12-22 02:29:14,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:14,839 INFO L225 Difference]: With dead ends: 1178 [2023-12-22 02:29:14,839 INFO L226 Difference]: Without dead ends: 662 [2023-12-22 02:29:14,840 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-22 02:29:14,840 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 83 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 224 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-22 02:29:14,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 224 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:29:14,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2023-12-22 02:29:14,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2023-12-22 02:29:14,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 529 states have (on average 1.10586011342155) internal successors, (585), 536 states have internal predecessors, (585), 76 states have call successors, (76), 52 states have call predecessors, (76), 56 states have return successors, (80), 74 states have call predecessors, (80), 76 states have call successors, (80) [2023-12-22 02:29:14,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 741 transitions. [2023-12-22 02:29:14,884 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 741 transitions. Word has length 123 [2023-12-22 02:29:14,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:14,884 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 741 transitions. [2023-12-22 02:29:14,885 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, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-22 02:29:14,885 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 741 transitions. [2023-12-22 02:29:14,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-22 02:29:14,886 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:29:14,886 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-22 02:29:14,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:15,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:15,090 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:29:15,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:29:15,090 INFO L85 PathProgramCache]: Analyzing trace with hash -805635248, now seen corresponding path program 1 times [2023-12-22 02:29:15,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:29:15,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723191078] [2023-12-22 02:29:15,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:29:15,091 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-22 02:29:15,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:29:15,092 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 02:29:15,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-12-22 02:29:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:29:15,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 02:29:15,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:29:15,309 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-22 02:29:15,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 02:29:15,384 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-22 02:29:15,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:29:15,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723191078] [2023-12-22 02:29:15,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723191078] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 02:29:15,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 02:29:15,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-12-22 02:29:15,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226262021] [2023-12-22 02:29:15,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:29:15,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 02:29:15,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:29:15,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 02:29:15,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 02:29:15,385 INFO L87 Difference]: Start difference. First operand 662 states and 741 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-22 02:29:15,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:29:15,532 INFO L93 Difference]: Finished difference Result 664 states and 743 transitions. [2023-12-22 02:29:15,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 02:29:15,533 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), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 124 [2023-12-22 02:29:15,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:29:15,533 INFO L225 Difference]: With dead ends: 664 [2023-12-22 02:29:15,533 INFO L226 Difference]: Without dead ends: 0 [2023-12-22 02:29:15,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 244 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-22 02:29:15,536 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 179 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 02:29:15,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 318 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 02:29:15,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-22 02:29:15,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-22 02:29:15,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 02:29:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-22 02:29:15,536 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 124 [2023-12-22 02:29:15,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:29:15,537 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-22 02:29:15,537 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), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-22 02:29:15,537 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-22 02:29:15,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-22 02:29:15,539 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-22 02:29:15,539 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-22 02:29:15,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-12-22 02:29:15,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 02:29:15,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-22 02:29:27,295 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 706 716) no Hoare annotation was computed. [2023-12-22 02:29:27,295 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 706 716) no Hoare annotation was computed. [2023-12-22 02:29:27,296 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 706 716) the Hoare annotation is: (let ((.cse5 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse0 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse1 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse2 (not (= (_ bv2 32) ~T1_E~0))) (.cse3 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse4 (not (= (_ bv1 32) ~m_i~0))) (.cse6 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse7 (not (= (_ bv1 32) ~t1_i~0))) (.cse8 (not (= ~q_free~0 (_ bv0 32)))) (.cse9 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse10 (= |old(~m_st~0)| ~m_st~0)) (.cse11 (not (= (_ bv2 32) ~E_M~0))) (.cse12 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse13 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse14 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~local~0 ~token~0)) .cse8 (not (= (_ bv2 32) |old(~t1_st~0)|)) .cse9 (and .cse10 (= ~t1_st~0 (_ bv2 32))) .cse11 .cse12 .cse13 .cse14) (or (not (= |old(~m_st~0)| (_ bv2 32))) .cse0 (and (= ~t1_st~0 |old(~t1_st~0)|) (= (_ bv2 32) ~m_st~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= (_ bv2 32) ~E_1~0)) .cse12 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) .cse13 .cse14) (or .cse0 .cse1 .cse2 (not (= (_ bv0 32) |old(~t1_st~0)|)) .cse3 .cse4 .cse6 .cse7 (not (= (_ bv0 32) ~m_pc~0)) .cse8 .cse9 (and .cse10 (= ~t1_st~0 (_ bv0 32))) .cse11 .cse12 (not (= ~t1_pc~0 (_ bv0 32))) .cse13 .cse14))) [2023-12-22 02:29:27,296 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 59) no Hoare annotation was computed. [2023-12-22 02:29:27,296 INFO L899 garLoopResultBuilder]: For program point L50-2(lines 50 59) no Hoare annotation was computed. [2023-12-22 02:29:27,296 INFO L899 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 84 108) no Hoare annotation was computed. [2023-12-22 02:29:27,296 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 84 108) the Hoare annotation is: (let ((.cse8 (not (= ~q_free~0 (_ bv0 32)))) (.cse3 (not (= ~t1_st~0 (_ bv0 32)))) (.cse6 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse0 (not (= (_ bv2 32) ~M_E~0))) (.cse1 (not (= (_ bv2 32) ~T1_E~0))) (.cse2 (not (= (_ bv0 32) ~m_pc~0))) (.cse4 (not (= (_ bv2 32) ~E_1~0))) (.cse5 (not (= (_ bv2 32) ~E_M~0))) (.cse10 (= (_ bv2 32) ~c_dr_st~0)) (.cse9 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse11 (not (= |old(~c_dr_st~0)| (_ bv2 32))))) (and (or .cse0 (not (= ~p_num_write~0 ~c_num_read~0)) .cse1 .cse2 (and (= ~p_dw_st~0 (_ bv2 32)) (= |old(~c_dr_st~0)| ~c_dr_st~0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= (_ bv2 32) |old(~p_dw_st~0)|)) (not (= ~q_free~0 (_ bv1 32))) (not (= ~p_last_write~0 ~c_last_read~0))) (or .cse0 (not (= ~p_dw_pc~0 (_ bv0 32))) (not (= ~p_num_write~0 (_ bv1 32))) .cse1 (not (= ~c_num_read~0 (_ bv0 32))) (not (= |old(~c_dr_st~0)| (_ bv0 32))) .cse2 .cse8 .cse3 .cse4 .cse5 .cse9 .cse6 (= ~c_dr_st~0 (_ bv0 32)) .cse7) (or .cse0 .cse1 .cse2 .cse8 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) .cse3 .cse4 .cse5 .cse10 .cse11 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse10 .cse9 .cse11))) [2023-12-22 02:29:27,296 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 78) no Hoare annotation was computed. [2023-12-22 02:29:27,297 INFO L899 garLoopResultBuilder]: For program point L100(lines 100 104) no Hoare annotation was computed. [2023-12-22 02:29:27,297 INFO L899 garLoopResultBuilder]: For program point L69-2(lines 69 78) no Hoare annotation was computed. [2023-12-22 02:29:27,297 INFO L899 garLoopResultBuilder]: For program point L100-2(lines 84 108) no Hoare annotation was computed. [2023-12-22 02:29:27,297 INFO L899 garLoopResultBuilder]: For program point L61(lines 49 63) no Hoare annotation was computed. [2023-12-22 02:29:27,297 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 96) no Hoare annotation was computed. [2023-12-22 02:29:27,302 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 96) no Hoare annotation was computed. [2023-12-22 02:29:27,302 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 56) no Hoare annotation was computed. [2023-12-22 02:29:27,302 INFO L899 garLoopResultBuilder]: For program point L80(lines 68 82) no Hoare annotation was computed. [2023-12-22 02:29:27,302 INFO L899 garLoopResultBuilder]: For program point L70(lines 70 75) no Hoare annotation was computed. [2023-12-22 02:29:27,302 INFO L899 garLoopResultBuilder]: For program point L639-1(lines 628 651) no Hoare annotation was computed. [2023-12-22 02:29:27,303 INFO L899 garLoopResultBuilder]: For program point L634-1(lines 628 651) no Hoare annotation was computed. [2023-12-22 02:29:27,303 INFO L899 garLoopResultBuilder]: For program point L629-1(lines 628 651) no Hoare annotation was computed. [2023-12-22 02:29:27,303 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 625 652) the Hoare annotation is: (let ((.cse19 (not (= (_ bv2 32) ~m_st~0))) (.cse18 (not (= ~t1_st~0 (_ bv0 32)))) (.cse20 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse0 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse1 (not (= (_ bv0 32) ~m_st~0))) (.cse2 (not (= (_ bv2 32) |old(~E_M~0)|))) (.cse3 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse4 (not (= (_ bv2 32) |old(~E_1~0)|))) (.cse5 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse6 (not (= (_ bv1 32) ~m_i~0))) (.cse7 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse8 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse9 (not (= (_ bv1 32) ~t1_i~0))) (.cse21 (not (= ~local~0 ~token~0))) (.cse22 (not (= (_ bv0 32) ~m_pc~0))) (.cse10 (not (= ~q_free~0 (_ bv0 32)))) (.cse11 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse12 (not (= (_ bv2 32) |old(~T1_E~0)|))) (.cse13 (and (= (_ bv2 32) ~E_M~0) (= (_ bv2 32) ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (= (_ bv2 32) ~E_1~0))) (.cse14 (not (= ~t1_st~0 (_ bv2 32)))) (.cse15 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse16 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse17 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) .cse16 .cse17) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse18 .cse12 .cse13 .cse19 .cse15 .cse20 .cse16 .cse17) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse15 .cse16 .cse17) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse10 .cse11 .cse18 .cse12 .cse13 .cse19 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse21 .cse22 .cse10 .cse11 .cse18 .cse12 .cse13 .cse15 .cse20 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse22 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-22 02:29:27,303 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 625 652) no Hoare annotation was computed. [2023-12-22 02:29:27,303 INFO L899 garLoopResultBuilder]: For program point L644-1(lines 625 652) no Hoare annotation was computed. [2023-12-22 02:29:27,303 INFO L899 garLoopResultBuilder]: For program point L494(lines 494 503) no Hoare annotation was computed. [2023-12-22 02:29:27,303 INFO L899 garLoopResultBuilder]: For program point L494-2(lines 494 503) no Hoare annotation was computed. [2023-12-22 02:29:27,303 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 681 705) the Hoare annotation is: (let ((.cse25 (= ~t1_st~0 (_ bv0 32))) (.cse23 (= (_ bv2 32) ~m_st~0))) (let ((.cse12 (= |old(~m_st~0)| ~m_st~0)) (.cse22 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse13 (= ~t1_st~0 (_ bv2 32))) (.cse10 (not (= (_ bv2 32) |old(~t1_st~0)|))) (.cse24 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0))) (.cse18 (not (= |old(~m_st~0)| (_ bv2 32)))) (.cse0 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse1 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse19 (and .cse25 .cse23)) (.cse2 (not (= (_ bv2 32) ~T1_E~0))) (.cse20 (not (= (_ bv0 32) |old(~t1_st~0)|))) (.cse3 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse4 (not (= (_ bv1 32) ~m_i~0))) (.cse5 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse6 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse7 (not (= (_ bv1 32) ~t1_i~0))) (.cse8 (not (= ~local~0 ~token~0))) (.cse9 (not (= ~q_free~0 (_ bv0 32)))) (.cse11 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse21 (not (= (_ bv2 32) ~E_1~0))) (.cse14 (not (= (_ bv2 32) ~E_M~0))) (.cse15 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse16 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse17 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse12 .cse13) .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse19 .cse2 .cse20 .cse3 .cse4 .cse6 .cse7 .cse9 .cse11 .cse21 .cse14 .cse15 .cse22 .cse16 .cse17) (or .cse18 .cse0 (and (= ~t1_st~0 |old(~t1_st~0)|) .cse23) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse21 .cse15 .cse24 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse20 .cse3 .cse4 .cse6 .cse7 (not (= (_ bv0 32) ~m_pc~0)) .cse9 .cse11 (and .cse12 .cse25) .cse14 .cse15 .cse22 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse21 .cse14 .cse15 (and .cse23 .cse13) .cse16 .cse17) (or (not (= |old(~m_st~0)| (_ bv0 32))) .cse0 .cse1 .cse2 (and (= (_ bv0 32) ~m_st~0) .cse13) .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse21 .cse14 .cse15 .cse24 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse19 .cse2 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse21 .cse14 .cse15 .cse16 .cse17)))) [2023-12-22 02:29:27,303 INFO L899 garLoopResultBuilder]: For program point L513(lines 513 522) no Hoare annotation was computed. [2023-12-22 02:29:27,303 INFO L899 garLoopResultBuilder]: For program point L513-2(lines 513 522) no Hoare annotation was computed. [2023-12-22 02:29:27,304 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 681 705) no Hoare annotation was computed. [2023-12-22 02:29:27,304 INFO L899 garLoopResultBuilder]: For program point L505(lines 493 507) no Hoare annotation was computed. [2023-12-22 02:29:27,304 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 701) no Hoare annotation was computed. [2023-12-22 02:29:27,304 INFO L899 garLoopResultBuilder]: For program point L697-2(lines 681 705) no Hoare annotation was computed. [2023-12-22 02:29:27,304 INFO L899 garLoopResultBuilder]: For program point L689(lines 689 693) no Hoare annotation was computed. [2023-12-22 02:29:27,304 INFO L899 garLoopResultBuilder]: For program point L495(lines 495 500) no Hoare annotation was computed. [2023-12-22 02:29:27,304 INFO L899 garLoopResultBuilder]: For program point L689-2(lines 689 693) no Hoare annotation was computed. [2023-12-22 02:29:27,304 INFO L899 garLoopResultBuilder]: For program point L524(lines 512 526) no Hoare annotation was computed. [2023-12-22 02:29:27,304 INFO L899 garLoopResultBuilder]: For program point L514(lines 514 519) no Hoare annotation was computed. [2023-12-22 02:29:27,304 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 528 535) no Hoare annotation was computed. [2023-12-22 02:29:27,304 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 528 535) the Hoare annotation is: true [2023-12-22 02:29:27,304 INFO L895 garLoopResultBuilder]: At program point L812(line 812) the Hoare annotation is: (let ((.cse12 (= (_ bv2 32) ~m_st~0)) (.cse4 (= ~t1_st~0 (_ bv0 32))) (.cse14 (= ~t1_pc~0 (_ bv0 32))) (.cse21 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~local~0 ~token~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse5 (= ~q_free~0 (_ bv0 32))) (.cse20 (= (_ bv0 32) ~m_st~0)) (.cse6 (= (_ bv2 32) ~T1_E~0)) (.cse7 (= ~p_last_write~0 ~c_last_read~0)) (.cse8 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= (_ bv1 32) ~m_i~0)) (.cse10 (= (_ bv2 32) ~E_1~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse19 (= ~t1_st~0 (_ bv2 32))) (.cse18 (= ~t1_pc~0 (_ bv1 32))) (.cse13 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse18 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse17 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse17 .cse19 .cse18 .cse13 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse18 .cse13 .cse15 .cse16))) [2023-12-22 02:29:27,304 INFO L899 garLoopResultBuilder]: For program point L779(lines 768 781) no Hoare annotation was computed. [2023-12-22 02:29:27,304 INFO L895 garLoopResultBuilder]: At program point L581(line 581) the Hoare annotation is: (let ((.cse12 (= (_ bv2 32) ~m_st~0)) (.cse4 (= ~t1_st~0 (_ bv0 32))) (.cse14 (= ~t1_pc~0 (_ bv0 32))) (.cse21 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~local~0 ~token~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse5 (= ~q_free~0 (_ bv0 32))) (.cse20 (= (_ bv0 32) ~m_st~0)) (.cse6 (= (_ bv2 32) ~T1_E~0)) (.cse7 (= ~p_last_write~0 ~c_last_read~0)) (.cse8 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= (_ bv1 32) ~m_i~0)) (.cse10 (= (_ bv2 32) ~E_1~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse19 (= ~t1_st~0 (_ bv2 32))) (.cse18 (= ~t1_pc~0 (_ bv1 32))) (.cse13 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse18 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse17 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse17 .cse19 .cse18 .cse13 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse18 .cse13 .cse15 .cse16))) [2023-12-22 02:29:27,304 INFO L899 garLoopResultBuilder]: For program point L317(lines 306 319) no Hoare annotation was computed. [2023-12-22 02:29:27,305 INFO L899 garLoopResultBuilder]: For program point L284(lines 284 291) no Hoare annotation was computed. [2023-12-22 02:29:27,305 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 734) no Hoare annotation was computed. [2023-12-22 02:29:27,305 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 109 151) no Hoare annotation was computed. [2023-12-22 02:29:27,305 INFO L899 garLoopResultBuilder]: For program point L730-2(lines 729 752) no Hoare annotation was computed. [2023-12-22 02:29:27,305 INFO L899 garLoopResultBuilder]: For program point L169(lines 168 203) no Hoare annotation was computed. [2023-12-22 02:29:27,305 INFO L899 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2023-12-22 02:29:27,305 INFO L899 garLoopResultBuilder]: For program point L830(lines 830 834) no Hoare annotation was computed. [2023-12-22 02:29:27,305 INFO L899 garLoopResultBuilder]: For program point L219-1(lines 210 227) no Hoare annotation was computed. [2023-12-22 02:29:27,305 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 276) no Hoare annotation was computed. [2023-12-22 02:29:27,305 INFO L899 garLoopResultBuilder]: For program point L170-1(lines 170 180) no Hoare annotation was computed. [2023-12-22 02:29:27,305 INFO L899 garLoopResultBuilder]: For program point L583(line 583) no Hoare annotation was computed. [2023-12-22 02:29:27,305 INFO L895 garLoopResultBuilder]: At program point L798-1(lines 798 835) the Hoare annotation is: (let ((.cse12 (= (_ bv2 32) ~m_st~0)) (.cse4 (= ~t1_st~0 (_ bv0 32))) (.cse14 (= ~t1_pc~0 (_ bv0 32))) (.cse21 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~local~0 ~token~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse5 (= ~q_free~0 (_ bv0 32))) (.cse20 (= (_ bv0 32) ~m_st~0)) (.cse6 (= (_ bv2 32) ~T1_E~0)) (.cse7 (= ~p_last_write~0 ~c_last_read~0)) (.cse8 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= (_ bv1 32) ~m_i~0)) (.cse10 (= (_ bv2 32) ~E_1~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse19 (= ~t1_st~0 (_ bv2 32))) (.cse18 (= ~t1_pc~0 (_ bv1 32))) (.cse13 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse18 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse17 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse17 .cse19 .cse18 .cse13 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse18 .cse13 .cse15 .cse16))) [2023-12-22 02:29:27,305 INFO L895 garLoopResultBuilder]: At program point L187(line 187) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~E_M~0) (= ~t1_st~0 (_ bv0 32)) (= (_ bv2 32) ~M_E~0) (= (_ bv2 32) ~T1_E~0) (= ~p_dw_st~0 (_ bv2 32)) (= ~p_last_write~0 ~c_last_read~0) (= (_ bv2 32) ~E_1~0) (= (_ bv0 32) ~m_pc~0) (= ~q_free~0 (_ bv1 32)) (= ~p_num_write~0 ~c_num_read~0) (= ~t1_pc~0 (_ bv0 32))) [2023-12-22 02:29:27,305 INFO L899 garLoopResultBuilder]: For program point L187-1(line 187) no Hoare annotation was computed. [2023-12-22 02:29:27,305 INFO L899 garLoopResultBuilder]: For program point L815(line 815) no Hoare annotation was computed. [2023-12-22 02:29:27,305 INFO L899 garLoopResultBuilder]: For program point transmit1_returnLabel#1(lines 454 489) no Hoare annotation was computed. [2023-12-22 02:29:27,306 INFO L895 garLoopResultBuilder]: At program point L469-1(lines 469 482) the Hoare annotation is: (let ((.cse5 (= (_ bv0 32) ~m_st~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse6 (= (_ bv2 32) ~T1_E~0)) (.cse7 (= ~p_last_write~0 ~c_last_read~0)) (.cse8 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= (_ bv1 32) ~m_i~0)) (.cse10 (= (_ bv2 32) ~E_1~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse12 (= (_ bv1 32) ~t1_i~0)) (.cse13 (= ~c_dr_st~0 (_ bv0 32))) (.cse14 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~t1_pc~0 (_ bv1 32)) .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= (_ bv0 32) ~m_pc~0) .cse11 (= ~local~0 ~token~0) .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= (_ bv2 32) ~m_st~0) .cse12 .cse13 .cse14))) [2023-12-22 02:29:27,306 INFO L899 garLoopResultBuilder]: For program point L585(lines 585 589) no Hoare annotation was computed. [2023-12-22 02:29:27,306 INFO L899 garLoopResultBuilder]: For program point L585-1(lines 580 618) no Hoare annotation was computed. [2023-12-22 02:29:27,306 INFO L899 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2023-12-22 02:29:27,306 INFO L899 garLoopResultBuilder]: For program point start_simulation2_returnLabel#1(lines 783 841) no Hoare annotation was computed. [2023-12-22 02:29:27,306 INFO L899 garLoopResultBuilder]: For program point L817(lines 817 826) no Hoare annotation was computed. [2023-12-22 02:29:27,306 INFO L899 garLoopResultBuilder]: For program point L817-2(lines 817 826) no Hoare annotation was computed. [2023-12-22 02:29:27,306 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-22 02:29:27,306 INFO L895 garLoopResultBuilder]: At program point L256(line 256) the Hoare annotation is: (let ((.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~c_dr_st~0)) (.cse14 (= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse15 (= ~c_num_read~0 (_ bv0 32))) (.cse16 (= ~p_num_write~0 (_ bv0 32))) (.cse2 (= ~t1_st~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~M_E~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_dw_st~0 (_ bv2 32))) (.cse17 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= (_ bv2 32) ~E_1~0)) (.cse8 (= (_ bv0 32) ~m_pc~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse13 (= ~q_free~0 (_ bv1 32))) (.cse10 (= ~t1_pc~0 (_ bv0 32))) (.cse18 (= ~c_dr_st~0 (_ bv0 32))) (.cse19 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 .cse5 .cse7 .cse8 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse12 .cse7 .cse8 .cse13 .cse9 .cse14 .cse10) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse5 .cse17 .cse12 .cse7 .cse8 .cse11 .cse13 .cse10 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse14 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse18) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse5 .cse6 .cse17 .cse7 .cse8 .cse11 .cse13 .cse10 .cse18 .cse19))) [2023-12-22 02:29:27,306 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 202) no Hoare annotation was computed. [2023-12-22 02:29:27,306 INFO L899 garLoopResultBuilder]: For program point master_returnLabel#1(lines 410 453) no Hoare annotation was computed. [2023-12-22 02:29:27,306 INFO L899 garLoopResultBuilder]: For program point L735-1(lines 729 752) no Hoare annotation was computed. [2023-12-22 02:29:27,306 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 165) no Hoare annotation was computed. [2023-12-22 02:29:27,306 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 197) no Hoare annotation was computed. [2023-12-22 02:29:27,306 INFO L895 garLoopResultBuilder]: At program point L125-1(lines 125 145) the Hoare annotation is: (let ((.cse8 (= (_ bv2 32) ~c_dr_st~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse10 (= ~q_free~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~t1_st~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~M_E~0)) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= (_ bv2 32) ~E_1~0)) (.cse7 (= (_ bv0 32) ~m_pc~0)) (.cse9 (= ~t1_pc~0 (_ bv0 32))) (.cse12 (= ~c_dr_st~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse10 .cse8 (= ~p_num_write~0 ~c_num_read~0) .cse9) (and .cse1 .cse3 .cse5 .cse6 .cse7 .cse11 .cse8) (and .cse0 .cse1 (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) .cse2 .cse3 .cse5 (= ~p_last_write~0 ~c_last_read~0) .cse6 .cse7 .cse11 .cse10 .cse9 .cse12 (= ~p_dw_pc~0 (_ bv0 32))) (and .cse0 .cse1 .cse2 .cse3 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse4 .cse5 .cse6 .cse7 .cse9 .cse12))) [2023-12-22 02:29:27,306 INFO L895 garLoopResultBuilder]: At program point L604-1(lines 580 618) the Hoare annotation is: (let ((.cse12 (= (_ bv2 32) ~m_st~0)) (.cse4 (= ~t1_st~0 (_ bv0 32))) (.cse14 (= ~t1_pc~0 (_ bv0 32))) (.cse21 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~local~0 ~token~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse5 (= ~q_free~0 (_ bv0 32))) (.cse20 (= (_ bv0 32) ~m_st~0)) (.cse6 (= (_ bv2 32) ~T1_E~0)) (.cse7 (= ~p_last_write~0 ~c_last_read~0)) (.cse8 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= (_ bv1 32) ~m_i~0)) (.cse10 (= (_ bv2 32) ~E_1~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse19 (= ~t1_st~0 (_ bv2 32))) (.cse18 (= ~t1_pc~0 (_ bv1 32))) (.cse13 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse18 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse17 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse17 .cse19 .cse18 .cse13 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse18 .cse13 .cse15 .cse16))) [2023-12-22 02:29:27,307 INFO L899 garLoopResultBuilder]: For program point start_simulation1_returnLabel#1(lines 321 349) no Hoare annotation was computed. [2023-12-22 02:29:27,307 INFO L895 garLoopResultBuilder]: At program point L439-1(lines 425 446) the Hoare annotation is: (let ((.cse12 (= ~t1_st~0 (_ bv2 32))) (.cse13 (= ~t1_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= ~p_dw_st~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~m_i~0)) (.cse9 (= (_ bv2 32) ~E_1~0)) (.cse10 (= (_ bv0 32) ~m_pc~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse14 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~local~0 ~token~0) .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 (= ~t1_st~0 (_ bv0 32)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 (= ~t1_pc~0 (_ bv0 32)) .cse15 .cse16))) [2023-12-22 02:29:27,307 INFO L895 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: (let ((.cse6 (= (_ bv2 32) ~c_dr_st~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse0 (= (_ bv2 32) ~E_M~0)) (.cse8 (= ~t1_st~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~M_E~0)) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse2 (= (_ bv2 32) ~T1_E~0)) (.cse3 (= (_ bv2 32) ~E_1~0)) (.cse4 (= (_ bv0 32) ~m_pc~0)) (.cse5 (= ~c_dr_pc~0 (_ bv0 32))) (.cse10 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse1 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse9 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse7 .cse0 (= ~p_num_write~0 (_ bv1 32)) (= ~c_num_read~0 (_ bv0 32)) .cse8 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse10 (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))))) [2023-12-22 02:29:27,307 INFO L899 garLoopResultBuilder]: For program point L142-1(line 142) no Hoare annotation was computed. [2023-12-22 02:29:27,307 INFO L899 garLoopResultBuilder]: For program point L390(line 390) no Hoare annotation was computed. [2023-12-22 02:29:27,307 INFO L899 garLoopResultBuilder]: For program point L258(line 258) no Hoare annotation was computed. [2023-12-22 02:29:27,307 INFO L895 garLoopResultBuilder]: At program point L770(line 770) the Hoare annotation is: (let ((.cse12 (= (_ bv2 32) ~m_st~0)) (.cse4 (= ~t1_st~0 (_ bv0 32))) (.cse14 (= ~t1_pc~0 (_ bv0 32))) (.cse21 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~local~0 ~token~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse5 (= ~q_free~0 (_ bv0 32))) (.cse20 (= (_ bv0 32) ~m_st~0)) (.cse6 (= (_ bv2 32) ~T1_E~0)) (.cse7 (= ~p_last_write~0 ~c_last_read~0)) (.cse8 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= (_ bv1 32) ~m_i~0)) (.cse10 (= (_ bv2 32) ~E_1~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse19 (= ~t1_st~0 (_ bv2 32))) (.cse18 (= ~t1_pc~0 (_ bv1 32))) (.cse13 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse18 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse17 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse17 .cse19 .cse18 .cse13 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse18 .cse13 .cse15 .cse16))) [2023-12-22 02:29:27,307 INFO L899 garLoopResultBuilder]: For program point L770-1(line 770) no Hoare annotation was computed. [2023-12-22 02:29:27,307 INFO L899 garLoopResultBuilder]: For program point L126(lines 125 145) no Hoare annotation was computed. [2023-12-22 02:29:27,307 INFO L895 garLoopResultBuilder]: At program point L308(line 308) the Hoare annotation is: (let ((.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~c_dr_st~0)) (.cse14 (= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse15 (= ~c_num_read~0 (_ bv0 32))) (.cse16 (= ~p_num_write~0 (_ bv0 32))) (.cse2 (= ~t1_st~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~M_E~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_dw_st~0 (_ bv2 32))) (.cse17 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= (_ bv2 32) ~E_1~0)) (.cse8 (= (_ bv0 32) ~m_pc~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse13 (= ~q_free~0 (_ bv1 32))) (.cse10 (= ~t1_pc~0 (_ bv0 32))) (.cse18 (= ~c_dr_st~0 (_ bv0 32))) (.cse19 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 .cse5 .cse7 .cse8 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse12 .cse7 .cse8 .cse13 .cse9 .cse14 .cse10) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse5 .cse17 .cse12 .cse7 .cse8 .cse11 .cse13 .cse10 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse14 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse18) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse5 .cse6 .cse17 .cse7 .cse8 .cse11 .cse13 .cse10 .cse18 .cse19))) [2023-12-22 02:29:27,307 INFO L899 garLoopResultBuilder]: For program point L308-1(line 308) no Hoare annotation was computed. [2023-12-22 02:29:27,307 INFO L899 garLoopResultBuilder]: For program point eval2_returnLabel#1(lines 574 624) no Hoare annotation was computed. [2023-12-22 02:29:27,307 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 164) no Hoare annotation was computed. [2023-12-22 02:29:27,308 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 135) no Hoare annotation was computed. [2023-12-22 02:29:27,308 INFO L899 garLoopResultBuilder]: For program point L540(lines 540 544) no Hoare annotation was computed. [2023-12-22 02:29:27,308 INFO L899 garLoopResultBuilder]: For program point L540-2(lines 539 552) no Hoare annotation was computed. [2023-12-22 02:29:27,308 INFO L899 garLoopResultBuilder]: For program point L854(lines 854 860) no Hoare annotation was computed. [2023-12-22 02:29:27,308 INFO L895 garLoopResultBuilder]: At program point L821(line 821) the Hoare annotation is: (let ((.cse12 (= (_ bv2 32) ~m_st~0)) (.cse4 (= ~t1_st~0 (_ bv0 32))) (.cse14 (= ~t1_pc~0 (_ bv0 32))) (.cse21 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~local~0 ~token~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse5 (= ~q_free~0 (_ bv0 32))) (.cse20 (= (_ bv0 32) ~m_st~0)) (.cse6 (= (_ bv2 32) ~T1_E~0)) (.cse7 (= ~p_last_write~0 ~c_last_read~0)) (.cse8 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= (_ bv1 32) ~m_i~0)) (.cse10 (= (_ bv2 32) ~E_1~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse19 (= ~t1_st~0 (_ bv2 32))) (.cse18 (= ~t1_pc~0 (_ bv1 32))) (.cse13 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse18 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse17 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse17 .cse19 .cse18 .cse13 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse18 .cse13 .cse15 .cse16))) [2023-12-22 02:29:27,308 INFO L899 garLoopResultBuilder]: For program point L821-1(line 821) no Hoare annotation was computed. [2023-12-22 02:29:27,308 INFO L899 garLoopResultBuilder]: For program point L590-1(lines 580 618) no Hoare annotation was computed. [2023-12-22 02:29:27,308 INFO L899 garLoopResultBuilder]: For program point L458(lines 458 466) no Hoare annotation was computed. [2023-12-22 02:29:27,308 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2023-12-22 02:29:27,308 INFO L899 garLoopResultBuilder]: For program point L772(lines 772 777) no Hoare annotation was computed. [2023-12-22 02:29:27,308 INFO L899 garLoopResultBuilder]: For program point L260-1(lines 255 295) no Hoare annotation was computed. [2023-12-22 02:29:27,308 INFO L899 garLoopResultBuilder]: For program point L607(lines 607 614) no Hoare annotation was computed. [2023-12-22 02:29:27,308 INFO L899 garLoopResultBuilder]: For program point do_read_c_returnLabel#1(lines 153 209) no Hoare annotation was computed. [2023-12-22 02:29:27,308 INFO L899 garLoopResultBuilder]: For program point L607-2(lines 607 614) no Hoare annotation was computed. [2023-12-22 02:29:27,308 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 315) no Hoare annotation was computed. [2023-12-22 02:29:27,308 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-22 02:29:27,308 INFO L895 garLoopResultBuilder]: At program point L806(line 806) the Hoare annotation is: (let ((.cse12 (= (_ bv2 32) ~m_st~0)) (.cse4 (= ~t1_st~0 (_ bv0 32))) (.cse14 (= ~t1_pc~0 (_ bv0 32))) (.cse21 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~local~0 ~token~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse5 (= ~q_free~0 (_ bv0 32))) (.cse20 (= (_ bv0 32) ~m_st~0)) (.cse6 (= (_ bv2 32) ~T1_E~0)) (.cse7 (= ~p_last_write~0 ~c_last_read~0)) (.cse8 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= (_ bv1 32) ~m_i~0)) (.cse10 (= (_ bv2 32) ~E_1~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse19 (= ~t1_st~0 (_ bv2 32))) (.cse18 (= ~t1_pc~0 (_ bv1 32))) (.cse13 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse18 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse17 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse17 .cse19 .cse18 .cse13 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse18 .cse13 .cse15 .cse16))) [2023-12-22 02:29:27,309 INFO L899 garLoopResultBuilder]: For program point L806-1(line 806) no Hoare annotation was computed. [2023-12-22 02:29:27,309 INFO L895 garLoopResultBuilder]: At program point L195(line 195) the Hoare annotation is: false [2023-12-22 02:29:27,309 INFO L899 garLoopResultBuilder]: For program point L740-1(lines 729 752) no Hoare annotation was computed. [2023-12-22 02:29:27,309 INFO L899 garLoopResultBuilder]: For program point L856(lines 856 859) no Hoare annotation was computed. [2023-12-22 02:29:27,309 INFO L899 garLoopResultBuilder]: For program point eval1_returnLabel#1(lines 248 301) no Hoare annotation was computed. [2023-12-22 02:29:27,309 INFO L895 garLoopResultBuilder]: At program point L791(line 791) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~E_M~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) (= ~t1_st~0 (_ bv0 32)) (= (_ bv2 32) ~M_E~0) (= ~q_free~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) (= (_ bv2 32) ~T1_E~0) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= (_ bv1 32) ~m_i~0) (= (_ bv2 32) ~E_1~0) (= (_ bv0 32) ~m_pc~0) (= ~c_dr_pc~0 (_ bv0 32)) (= ~local~0 ~token~0) (= (_ bv1 32) ~t1_i~0) (= ~t1_pc~0 (_ bv0 32)) (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2023-12-22 02:29:27,309 INFO L899 garLoopResultBuilder]: For program point L791-1(line 791) no Hoare annotation was computed. [2023-12-22 02:29:27,309 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 122) no Hoare annotation was computed. [2023-12-22 02:29:27,309 INFO L899 garLoopResultBuilder]: For program point L593(lines 593 600) no Hoare annotation was computed. [2023-12-22 02:29:27,309 INFO L899 garLoopResultBuilder]: For program point L593-2(lines 593 600) no Hoare annotation was computed. [2023-12-22 02:29:27,309 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 465) no Hoare annotation was computed. [2023-12-22 02:29:27,309 INFO L895 garLoopResultBuilder]: At program point L280(lines 255 295) the Hoare annotation is: (let ((.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~c_dr_st~0)) (.cse14 (= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse15 (= ~c_num_read~0 (_ bv0 32))) (.cse16 (= ~p_num_write~0 (_ bv0 32))) (.cse2 (= ~t1_st~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~M_E~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_dw_st~0 (_ bv2 32))) (.cse17 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= (_ bv2 32) ~E_1~0)) (.cse8 (= (_ bv0 32) ~m_pc~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse13 (= ~q_free~0 (_ bv1 32))) (.cse10 (= ~t1_pc~0 (_ bv0 32))) (.cse18 (= ~c_dr_st~0 (_ bv0 32))) (.cse19 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 .cse5 .cse7 .cse8 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse12 .cse7 .cse8 .cse13 .cse9 .cse14 .cse10) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse5 .cse17 .cse12 .cse7 .cse8 .cse11 .cse13 .cse10 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse14 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse18) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse5 .cse6 .cse17 .cse7 .cse8 .cse11 .cse13 .cse10 .cse18 .cse19))) [2023-12-22 02:29:27,309 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 390) no Hoare annotation was computed. [2023-12-22 02:29:27,309 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 218) no Hoare annotation was computed. [2023-12-22 02:29:27,309 INFO L899 garLoopResultBuilder]: For program point L214-2(lines 213 226) no Hoare annotation was computed. [2023-12-22 02:29:27,310 INFO L899 garLoopResultBuilder]: For program point $Ultimate##101(lines 439 445) no Hoare annotation was computed. [2023-12-22 02:29:27,310 INFO L899 garLoopResultBuilder]: For program point L545-1(lines 536 553) no Hoare annotation was computed. [2023-12-22 02:29:27,310 INFO L895 garLoopResultBuilder]: At program point L479(line 479) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (bvadd ~local~0 (_ bv1 32)) ~token~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) (= ~q_free~0 (_ bv0 32)) (= (_ bv2 32) ~T1_E~0) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= (_ bv1 32) ~m_i~0) (= (_ bv2 32) ~E_1~0) (= ~c_dr_pc~0 (_ bv0 32)) (= (_ bv2 32) ~m_st~0) (= ~t1_pc~0 (_ bv1 32)) (= (_ bv1 32) ~t1_i~0) (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2023-12-22 02:29:27,310 INFO L899 garLoopResultBuilder]: For program point L479-1(line 479) no Hoare annotation was computed. [2023-12-22 02:29:27,310 INFO L895 garLoopResultBuilder]: At program point L793(line 793) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~E_M~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) (= ~t1_st~0 (_ bv0 32)) (= (_ bv2 32) ~M_E~0) (= ~q_free~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) (= (_ bv2 32) ~T1_E~0) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= (_ bv1 32) ~m_i~0) (= (_ bv2 32) ~E_1~0) (= (_ bv0 32) ~m_pc~0) (= ~c_dr_pc~0 (_ bv0 32)) (= ~local~0 ~token~0) (= (_ bv1 32) ~t1_i~0) (= ~t1_pc~0 (_ bv0 32)) (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2023-12-22 02:29:27,310 INFO L895 garLoopResultBuilder]: At program point L793-1(line 793) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~E_M~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) (= ~t1_st~0 (_ bv0 32)) (= (_ bv2 32) ~M_E~0) (= ~q_free~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) (= (_ bv2 32) ~T1_E~0) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= (_ bv1 32) ~m_i~0) (= (_ bv2 32) ~E_1~0) (= (_ bv0 32) ~m_pc~0) (= ~c_dr_pc~0 (_ bv0 32)) (= ~local~0 ~token~0) (= (_ bv1 32) ~t1_i~0) (= ~t1_pc~0 (_ bv0 32)) (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2023-12-22 02:29:27,310 INFO L895 garLoopResultBuilder]: At program point L810(line 810) the Hoare annotation is: (let ((.cse12 (= (_ bv2 32) ~m_st~0)) (.cse4 (= ~t1_st~0 (_ bv0 32))) (.cse14 (= ~t1_pc~0 (_ bv0 32))) (.cse21 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~local~0 ~token~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse5 (= ~q_free~0 (_ bv0 32))) (.cse20 (= (_ bv0 32) ~m_st~0)) (.cse6 (= (_ bv2 32) ~T1_E~0)) (.cse7 (= ~p_last_write~0 ~c_last_read~0)) (.cse8 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= (_ bv1 32) ~m_i~0)) (.cse10 (= (_ bv2 32) ~E_1~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse19 (= ~t1_st~0 (_ bv2 32))) (.cse18 (= ~t1_pc~0 (_ bv1 32))) (.cse13 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse18 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse17 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse17 .cse19 .cse18 .cse13 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse18 .cse13 .cse15 .cse16))) [2023-12-22 02:29:27,310 INFO L899 garLoopResultBuilder]: For program point L265(lines 255 295) no Hoare annotation was computed. [2023-12-22 02:29:27,310 INFO L895 garLoopResultBuilder]: At program point L331-2(lines 331 343) the Hoare annotation is: (let ((.cse12 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= (_ bv2 32) ~c_dr_st~0)) (.cse14 (= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse15 (= ~c_num_read~0 (_ bv0 32))) (.cse16 (= ~p_num_write~0 (_ bv0 32))) (.cse2 (= ~t1_st~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~M_E~0)) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_dw_st~0 (_ bv2 32))) (.cse17 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= (_ bv2 32) ~E_1~0)) (.cse8 (= (_ bv0 32) ~m_pc~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse13 (= ~q_free~0 (_ bv1 32))) (.cse10 (= ~t1_pc~0 (_ bv0 32))) (.cse18 (= ~c_dr_st~0 (_ bv0 32))) (.cse19 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 .cse5 .cse7 .cse8 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse12 .cse7 .cse8 .cse13 .cse9 .cse14 .cse10) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse5 .cse17 .cse12 .cse7 .cse8 .cse11 .cse13 .cse10 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse14 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse18) (and .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse5 .cse6 .cse17 .cse7 .cse8 .cse11 .cse13 .cse10 .cse18 .cse19))) [2023-12-22 02:29:27,310 INFO L895 garLoopResultBuilder]: At program point L810-1(line 810) the Hoare annotation is: (let ((.cse12 (= (_ bv2 32) ~m_st~0)) (.cse4 (= ~t1_st~0 (_ bv0 32))) (.cse14 (= ~t1_pc~0 (_ bv0 32))) (.cse21 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~local~0 ~token~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse5 (= ~q_free~0 (_ bv0 32))) (.cse20 (= (_ bv0 32) ~m_st~0)) (.cse6 (= (_ bv2 32) ~T1_E~0)) (.cse7 (= ~p_last_write~0 ~c_last_read~0)) (.cse8 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= (_ bv1 32) ~m_i~0)) (.cse10 (= (_ bv2 32) ~E_1~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse19 (= ~t1_st~0 (_ bv2 32))) (.cse18 (= ~t1_pc~0 (_ bv1 32))) (.cse13 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse18 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse17 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse17 .cse19 .cse18 .cse13 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse18 .cse13 .cse15 .cse16))) [2023-12-22 02:29:27,310 INFO L899 garLoopResultBuilder]: For program point L414(lines 414 422) no Hoare annotation was computed. [2023-12-22 02:29:27,311 INFO L895 garLoopResultBuilder]: At program point L794(line 794) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~E_M~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) (= ~t1_st~0 (_ bv0 32)) (= (_ bv2 32) ~M_E~0) (= ~q_free~0 (_ bv0 32)) (= (_ bv0 32) ~m_st~0) (= (_ bv2 32) ~T1_E~0) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= (_ bv1 32) ~m_i~0) (= (_ bv2 32) ~E_1~0) (= (_ bv0 32) ~m_pc~0) (= ~c_dr_pc~0 (_ bv0 32)) (= ~local~0 ~token~0) (= (_ bv1 32) ~t1_i~0) (= ~t1_pc~0 (_ bv0 32)) (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2023-12-22 02:29:27,311 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 121) no Hoare annotation was computed. [2023-12-22 02:29:27,311 INFO L895 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse5 (= (_ bv2 32) ~T1_E~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse7 (= ~p_dw_st~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~m_i~0)) (.cse9 (= ~c_dr_pc~0 (_ bv0 32))) (.cse10 (= (_ bv1 32) ~t1_i~0)) (.cse11 (= ~c_dr_st~0 (_ bv0 32))) (.cse12 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~t1_st~0 (_ bv0 32)) .cse4 .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~m_pc~0) .cse9 .cse10 (= ~t1_pc~0 (_ bv0 32)) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~local~0 ~token~0) (= ~t1_st~0 (_ bv2 32)) (= ~t1_pc~0 (_ bv1 32)) .cse10 .cse11 .cse12))) [2023-12-22 02:29:27,311 INFO L899 garLoopResultBuilder]: For program point L431-1(line 431) no Hoare annotation was computed. [2023-12-22 02:29:27,311 INFO L895 garLoopResultBuilder]: At program point L811(line 811) the Hoare annotation is: (let ((.cse12 (= (_ bv2 32) ~m_st~0)) (.cse4 (= ~t1_st~0 (_ bv0 32))) (.cse14 (= ~t1_pc~0 (_ bv0 32))) (.cse21 (= (_ bv0 32) ~m_pc~0)) (.cse17 (= ~local~0 ~token~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse5 (= ~q_free~0 (_ bv0 32))) (.cse20 (= (_ bv0 32) ~m_st~0)) (.cse6 (= (_ bv2 32) ~T1_E~0)) (.cse7 (= ~p_last_write~0 ~c_last_read~0)) (.cse8 (= ~p_dw_st~0 (_ bv0 32))) (.cse9 (= (_ bv1 32) ~m_i~0)) (.cse10 (= (_ bv2 32) ~E_1~0)) (.cse11 (= ~c_dr_pc~0 (_ bv0 32))) (.cse19 (= ~t1_st~0 (_ bv2 32))) (.cse18 (= ~t1_pc~0 (_ bv1 32))) (.cse13 (= (_ bv1 32) ~t1_i~0)) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse18 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse17 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse17 .cse19 .cse18 .cse13 .cse15 .cse16) (and .cse0 .cse1 (= (bvadd ~local~0 (_ bv1 32)) ~token~0) .cse2 .cse3 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse18 .cse13 .cse15 .cse16))) [2023-12-22 02:29:27,311 INFO L895 garLoopResultBuilder]: At program point L200(line 200) the Hoare annotation is: false [2023-12-22 02:29:27,311 INFO L899 garLoopResultBuilder]: For program point L745-1(lines 726 753) no Hoare annotation was computed. [2023-12-22 02:29:27,311 INFO L895 garLoopResultBuilder]: At program point L200-1(lines 168 203) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~E_M~0)) (.cse2 (= ~t1_st~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~M_E~0)) (.cse4 (= (_ bv2 32) ~T1_E~0)) (.cse5 (= ~p_dw_st~0 (_ bv2 32))) (.cse9 (= ~p_last_write~0 ~c_last_read~0)) (.cse6 (= (_ bv2 32) ~E_1~0)) (.cse7 (= (_ bv0 32) ~m_pc~0)) (.cse10 (= ~q_free~0 (_ bv1 32))) (.cse11 (= ~p_num_write~0 ~c_num_read~0)) (.cse8 (= ~t1_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) (= ~q_free~0 (_ bv0 32)) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 (= ~p_dw_st~0 (_ bv0 32)) .cse6 .cse7 .cse10 .cse11 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7 .cse10 .cse11 .cse8))) [2023-12-22 02:29:27,311 INFO L899 garLoopResultBuilder]: For program point L244(lines 231 246) no Hoare annotation was computed. [2023-12-22 02:29:27,311 INFO L899 garLoopResultBuilder]: For program point L236(lines 236 241) no Hoare annotation was computed. [2023-12-22 02:29:27,311 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 228 247) the Hoare annotation is: true [2023-12-22 02:29:27,311 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 242) no Hoare annotation was computed. [2023-12-22 02:29:27,311 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 228 247) no Hoare annotation was computed. [2023-12-22 02:29:27,311 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 23 30) the Hoare annotation is: true [2023-12-22 02:29:27,311 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2023-12-22 02:29:27,312 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2023-12-22 02:29:27,312 INFO L899 garLoopResultBuilder]: For program point L570(lines 557 572) no Hoare annotation was computed. [2023-12-22 02:29:27,312 INFO L899 garLoopResultBuilder]: For program point L562(lines 562 567) no Hoare annotation was computed. [2023-12-22 02:29:27,312 INFO L899 garLoopResultBuilder]: For program point L558(lines 558 568) no Hoare annotation was computed. [2023-12-22 02:29:27,312 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 554 573) the Hoare annotation is: true [2023-12-22 02:29:27,312 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 554 573) no Hoare annotation was computed. [2023-12-22 02:29:27,312 INFO L899 garLoopResultBuilder]: For program point L672-1(lines 653 680) no Hoare annotation was computed. [2023-12-22 02:29:27,312 INFO L899 garLoopResultBuilder]: For program point L667-1(lines 656 679) no Hoare annotation was computed. [2023-12-22 02:29:27,312 INFO L899 garLoopResultBuilder]: For program point L662-1(lines 656 679) no Hoare annotation was computed. [2023-12-22 02:29:27,312 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 653 680) no Hoare annotation was computed. [2023-12-22 02:29:27,312 INFO L899 garLoopResultBuilder]: For program point L657-1(lines 656 679) no Hoare annotation was computed. [2023-12-22 02:29:27,312 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 653 680) the Hoare annotation is: (let ((.cse19 (not (= (_ bv2 32) ~m_st~0))) (.cse18 (not (= ~t1_st~0 (_ bv0 32)))) (.cse20 (not (= ~t1_pc~0 (_ bv0 32)))) (.cse0 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse1 (not (= (_ bv0 32) ~m_st~0))) (.cse2 (not (= (_ bv2 32) |old(~E_M~0)|))) (.cse3 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse4 (not (= (_ bv2 32) |old(~E_1~0)|))) (.cse5 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse6 (not (= (_ bv1 32) ~m_i~0))) (.cse7 (not (= ~t1_pc~0 (_ bv1 32)))) (.cse8 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse9 (not (= (_ bv1 32) ~t1_i~0))) (.cse21 (not (= ~local~0 ~token~0))) (.cse22 (not (= (_ bv0 32) ~m_pc~0))) (.cse10 (not (= ~q_free~0 (_ bv0 32)))) (.cse11 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse12 (not (= (_ bv2 32) |old(~T1_E~0)|))) (.cse13 (and (= (_ bv2 32) ~E_M~0) (= (_ bv2 32) ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (= (_ bv2 32) ~E_1~0))) (.cse14 (not (= ~t1_st~0 (_ bv2 32)))) (.cse15 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse16 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse17 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= (bvadd ~local~0 (_ bv1 32)) ~token~0)) .cse16 .cse17) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse18 .cse12 .cse13 .cse19 .cse15 .cse20 .cse16 .cse17) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse15 .cse16 .cse17) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse10 .cse11 .cse18 .cse12 .cse13 .cse19 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse21 .cse22 .cse10 .cse11 .cse18 .cse12 .cse13 .cse15 .cse20 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse22 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2023-12-22 02:29:27,336 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 02:29:27,338 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-22 02:29:27,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 02:29:27 BoogieIcfgContainer [2023-12-22 02:29:27,392 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-22 02:29:27,392 INFO L158 Benchmark]: Toolchain (without parser) took 28301.70ms. Allocated memory was 182.5MB in the beginning and 820.0MB in the end (delta: 637.5MB). Free memory was 131.4MB in the beginning and 697.6MB in the end (delta: -566.2MB). Peak memory consumption was 474.5MB. Max. memory is 8.0GB. [2023-12-22 02:29:27,393 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 182.5MB. Free memory is still 135.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-22 02:29:27,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.24ms. Allocated memory is still 182.5MB. Free memory was 131.0MB in the beginning and 114.0MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-22 02:29:27,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.10ms. Allocated memory is still 182.5MB. Free memory was 114.0MB in the beginning and 111.1MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-22 02:29:27,393 INFO L158 Benchmark]: Boogie Preprocessor took 58.89ms. Allocated memory is still 182.5MB. Free memory was 111.1MB in the beginning and 107.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-22 02:29:27,393 INFO L158 Benchmark]: RCFGBuilder took 578.08ms. Allocated memory was 182.5MB in the beginning and 251.7MB in the end (delta: 69.2MB). Free memory was 107.9MB in the beginning and 214.4MB in the end (delta: -106.4MB). Peak memory consumption was 33.9MB. Max. memory is 8.0GB. [2023-12-22 02:29:27,393 INFO L158 Benchmark]: TraceAbstraction took 27275.98ms. Allocated memory was 251.7MB in the beginning and 820.0MB in the end (delta: 568.3MB). Free memory was 213.8MB in the beginning and 697.6MB in the end (delta: -483.8MB). Peak memory consumption was 485.7MB. Max. memory is 8.0GB. [2023-12-22 02:29:27,394 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.54ms. Allocated memory is still 182.5MB. Free memory is still 135.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 340.24ms. Allocated memory is still 182.5MB. Free memory was 131.0MB in the beginning and 114.0MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.10ms. Allocated memory is still 182.5MB. Free memory was 114.0MB in the beginning and 111.1MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.89ms. Allocated memory is still 182.5MB. Free memory was 111.1MB in the beginning and 107.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 578.08ms. Allocated memory was 182.5MB in the beginning and 251.7MB in the end (delta: 69.2MB). Free memory was 107.9MB in the beginning and 214.4MB in the end (delta: -106.4MB). Peak memory consumption was 33.9MB. Max. memory is 8.0GB. * TraceAbstraction took 27275.98ms. Allocated memory was 251.7MB in the beginning and 820.0MB in the end (delta: 568.3MB). Free memory was 213.8MB in the beginning and 697.6MB in the end (delta: -483.8MB). Peak memory consumption was 485.7MB. 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 - PositiveResult [Line: 390]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 27]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 158 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 27.2s, OverallIterations: 29, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4329 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4248 mSDsluCounter, 11085 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5673 mSDsCounter, 344 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2653 IncrementalHoareTripleChecker+Invalid, 2997 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 344 mSolverCounterUnsat, 5412 mSDtfsCounter, 2653 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2311 GetRequests, 2248 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2222occurred in iteration=20, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 29 MinimizatonAttempts, 673 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 37 LocationsWithAnnotation, 1413 PreInvPairs, 1626 NumberOfFragments, 7484 HoareAnnotationTreeSize, 1413 FormulaSimplifications, 207 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 37 FormulaSimplificationsInter, 18222 FormulaSimplificationTreeSizeReductionInter, 10.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2085 NumberOfCodeBlocks, 2085 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2298 ConstructedInterpolants, 0 QuantifiedInterpolants, 4056 SizeOfPredicates, 7 NumberOfNonLiveVariables, 4605 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 32 InterpolantComputations, 28 PerfectInterpolantSequences, 745/785 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 425]: Loop Invariant Derived loop invariant: ((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (c_num_read == 0)) && (p_num_write == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (t1_st == 2)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) || (((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (((local + 1) % 4294967296) == token)) && (c_num_read == 0)) && (p_num_write == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (t1_st == 2)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (c_num_read == 0)) && (p_num_write == 0)) && (t1_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) - InvariantResult [Line: 469]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (((local + 1) % 4294967296) == token)) && (c_num_read == 0)) && (p_num_write == 0)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0)) || (((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (c_num_read == 0)) && (p_num_write == 0)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (c_num_read == 0)) && (p_num_write == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (c_num_read == 0)) && (p_num_write == 0)) && (t1_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) || ((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (c_num_read == 0)) && (p_num_write == 0)) && (t1_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (local == token)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (c_num_read == 0)) && (p_num_write == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (t1_st == 2)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (c_num_read == 0)) && (p_num_write == 0)) && (t1_st == 0)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (c_num_read == 0)) && (p_num_write == 0)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (t1_st == 2)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (((local + 1) % 4294967296) == token)) && (c_num_read == 0)) && (p_num_write == 0)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (t1_st == 2)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (t1_st == 0)) && (2 == M_E)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (q_free == 0)) && (2 == T1_E)) && (p_dw_st == 2)) && (2 == E_1)) && (0 == m_pc)) && (t1_pc == 0)) || ((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (t1_st == 0)) && (2 == M_E)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_free == 1)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || ((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (t1_st == 0)) && (2 == M_E)) && (2 == T1_E)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (2 == E_1)) && (0 == m_pc)) && (q_free == 1)) && (p_num_write == c_num_read)) && (t1_pc == 0))) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (2 == T1_E)) && (p_dw_st == 2)) && (2 == E_1)) && (0 == m_pc)) && (2 == c_dr_st)) && (t1_pc == 0)) || (((((((2 == E_M) && (2 == M_E)) && (2 == T1_E)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == c_dr_st))) || ((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (t1_st == 0)) && (2 == M_E)) && (2 == T1_E)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || ((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (c_num_read == 0)) && (p_num_write == 0)) && (t1_st == 0)) && (2 == M_E)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_free == 1)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (t1_st == 0)) && (2 == M_E)) && (2 == T1_E)) && (p_dw_st == 2)) && (2 == E_1)) && (0 == m_pc)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || ((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (t1_st == 0)) && (2 == M_E)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (q_free == 0)) && (2 == T1_E)) && (p_dw_st == 2)) && (2 == E_1)) && (0 == m_pc)) && (t1_pc == 0)) && (c_dr_st == 0))) || ((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (c_num_read == 0)) && (p_num_write == 0)) && (t1_st == 0)) && (2 == M_E)) && (2 == T1_E)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_free == 1)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (2 == T1_E)) && (2 == E_1)) && (0 == m_pc)) && (2 == c_dr_st)) && (t1_pc == 0)) || (((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (t1_st == 0)) && (2 == M_E)) && (2 == T1_E)) && (2 == E_1)) && (0 == m_pc)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || (((((((2 == E_M) && (2 == M_E)) && (2 == T1_E)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == c_dr_st))) || (((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (c_num_read == 0)) && (p_num_write == 0)) && (t1_st == 0)) && (2 == M_E)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_free == 1)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (t1_st == 0)) && (2 == M_E)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (q_free == 0)) && (2 == T1_E)) && (2 == E_1)) && (0 == m_pc)) && (t1_pc == 0)) && (c_dr_st == 0))) - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: (((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (t1_st == 0)) && (2 == M_E)) && (q_free == 0)) && (2 == T1_E)) && (p_dw_st == 2)) && (2 == E_1)) && (0 == m_pc)) && (2 == c_dr_st)) && (t1_pc == 0)) || (((((((2 == E_M) && (2 == M_E)) && (2 == T1_E)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (2 == c_dr_st))) || ((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (t1_st == 0)) && (2 == M_E)) && (2 == T1_E)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || ((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (c_num_read == 0)) && (p_num_write == 0)) && (t1_st == 0)) && (2 == M_E)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_free == 1)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (t1_st == 0)) && (2 == M_E)) && (2 == T1_E)) && (p_dw_st == 2)) && (2 == E_1)) && (0 == m_pc)) && (q_free == 1)) && (2 == c_dr_st)) && (p_num_write == c_num_read)) && (t1_pc == 0))) || ((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (t1_st == 0)) && (2 == M_E)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (q_free == 0)) && (2 == T1_E)) && (p_dw_st == 2)) && (2 == E_1)) && (0 == m_pc)) && (t1_pc == 0)) && (c_dr_st == 0))) || ((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (c_num_read == 0)) && (p_num_write == 0)) && (t1_st == 0)) && (2 == M_E)) && (2 == T1_E)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (q_free == 1)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) - InvariantResult [Line: 798]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (c_num_read == 0)) && (p_num_write == 0)) && (t1_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0)) || ((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (c_num_read == 0)) && (p_num_write == 0)) && (t1_st == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (local == token)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (c_num_read == 0)) && (p_num_write == 0)) && (q_free == 0)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (2 == m_st)) && (t1_st == 2)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (c_num_read == 0)) && (p_num_write == 0)) && (t1_st == 0)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (1 == t1_i)) && (t1_pc == 0)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || (((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (c_num_read == 0)) && (p_num_write == 0)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (0 == m_pc)) && (c_dr_pc == 0)) && (local == token)) && (t1_st == 2)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((((((((((((p_last_write == q_buf_0) && (2 == E_M)) && (((local + 1) % 4294967296) == token)) && (c_num_read == 0)) && (p_num_write == 0)) && (q_free == 0)) && (0 == m_st)) && (2 == T1_E)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (1 == m_i)) && (2 == E_1)) && (c_dr_pc == 0)) && (t1_st == 2)) && (t1_pc == 1)) && (1 == t1_i)) && (c_dr_st == 0)) && (p_dw_pc == 0))) RESULT: Ultimate proved your program to be correct! [2023-12-22 02:29:27,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...