/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/systemc/pc_sfifo_2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 17:52:30,502 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 17:52:30,576 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 17:52:30,581 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 17:52:30,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 17:52:30,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 17:52:30,605 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 17:52:30,606 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 17:52:30,606 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 17:52:30,609 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 17:52:30,609 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 17:52:30,610 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 17:52:30,610 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 17:52:30,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 17:52:30,611 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 17:52:30,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 17:52:30,612 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 17:52:30,612 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 17:52:30,612 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 17:52:30,613 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 17:52:30,613 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 17:52:30,614 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 17:52:30,614 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 17:52:30,614 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 17:52:30,614 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 17:52:30,614 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 17:52:30,614 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 17:52:30,615 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 17:52:30,615 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 17:52:30,615 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 17:52:30,616 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 17:52:30,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 17:52:30,616 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 17:52:30,616 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 17:52:30,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 17:52:30,616 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 17:52:30,616 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 17:52:30,616 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 17:52:30,617 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 17:52:30,617 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 17:52:30,617 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 17:52:30,617 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 17:52:30,617 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 17:52:30,617 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 17:52:30,617 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 17:52:30,618 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 17:52:30,618 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 17:52:30,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 17:52:30,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 17:52:30,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 17:52:30,823 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 17:52:30,823 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 17:52:30,824 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c [2023-12-16 17:52:31,884 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 17:52:32,015 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 17:52:32,015 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c [2023-12-16 17:52:32,021 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/654983647/51688a19aac0454b8d62ff43caffc45d/FLAGad481e4b2 [2023-12-16 17:52:32,045 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/654983647/51688a19aac0454b8d62ff43caffc45d [2023-12-16 17:52:32,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 17:52:32,047 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 17:52:32,048 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 17:52:32,048 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 17:52:32,051 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 17:52:32,052 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:52:32" (1/1) ... [2023-12-16 17:52:32,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dea325c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:32, skipping insertion in model container [2023-12-16 17:52:32,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:52:32" (1/1) ... [2023-12-16 17:52:32,079 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 17:52:32,192 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c[643,656] [2023-12-16 17:52:32,230 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 17:52:32,240 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 17:52:32,249 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-1.c[643,656] [2023-12-16 17:52:32,263 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 17:52:32,284 INFO L206 MainTranslator]: Completed translation [2023-12-16 17:52:32,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:32 WrapperNode [2023-12-16 17:52:32,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 17:52:32,285 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 17:52:32,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 17:52:32,286 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 17:52:32,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:32" (1/1) ... [2023-12-16 17:52:32,306 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:32" (1/1) ... [2023-12-16 17:52:32,322 INFO L138 Inliner]: procedures = 29, calls = 31, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 183 [2023-12-16 17:52:32,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 17:52:32,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 17:52:32,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 17:52:32,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 17:52:32,329 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:32" (1/1) ... [2023-12-16 17:52:32,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:32" (1/1) ... [2023-12-16 17:52:32,331 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:32" (1/1) ... [2023-12-16 17:52:32,342 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 17:52:32,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:32" (1/1) ... [2023-12-16 17:52:32,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:32" (1/1) ... [2023-12-16 17:52:32,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:32" (1/1) ... [2023-12-16 17:52:32,350 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:32" (1/1) ... [2023-12-16 17:52:32,351 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:32" (1/1) ... [2023-12-16 17:52:32,352 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:32" (1/1) ... [2023-12-16 17:52:32,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 17:52:32,355 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 17:52:32,355 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 17:52:32,355 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 17:52:32,355 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:32" (1/1) ... [2023-12-16 17:52:32,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 17:52:32,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 17:52:32,378 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 17:52:32,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 17:52:32,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 17:52:32,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 17:52:32,407 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-16 17:52:32,407 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-16 17:52:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-12-16 17:52:32,408 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-12-16 17:52:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-16 17:52:32,408 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-16 17:52:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-16 17:52:32,408 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-16 17:52:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-16 17:52:32,408 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-16 17:52:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-16 17:52:32,408 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-16 17:52:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-16 17:52:32,409 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-16 17:52:32,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 17:52:32,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 17:52:32,409 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-12-16 17:52:32,409 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-12-16 17:52:32,460 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 17:52:32,462 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 17:52:32,801 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 17:52:32,846 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 17:52:32,846 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-16 17:52:32,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:52:32 BoogieIcfgContainer [2023-12-16 17:52:32,847 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 17:52:32,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 17:52:32,849 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 17:52:32,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 17:52:32,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:52:32" (1/3) ... [2023-12-16 17:52:32,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640aa3a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:52:32, skipping insertion in model container [2023-12-16 17:52:32,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:32" (2/3) ... [2023-12-16 17:52:32,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640aa3a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:52:32, skipping insertion in model container [2023-12-16 17:52:32,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:52:32" (3/3) ... [2023-12-16 17:52:32,853 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2023-12-16 17:52:32,864 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 17:52:32,864 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 17:52:32,904 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 17:52:32,915 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;@6ff61dbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 17:52:32,916 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 17:52:32,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 71 states have internal predecessors, (108), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 17:52:32,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-16 17:52:32,925 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:32,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:52:32,926 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:32,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:32,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1654461006, now seen corresponding path program 1 times [2023-12-16 17:52:32,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:32,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479651383] [2023-12-16 17:52:32,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:32,938 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:32,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:32,943 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:52:32,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 17:52:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:33,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 17:52:33,036 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:33,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:52:33,084 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:33,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:33,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479651383] [2023-12-16 17:52:33,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [479651383] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:33,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:33,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 17:52:33,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895288620] [2023-12-16 17:52:33,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:33,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 17:52:33,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:33,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 17:52:33,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:33,127 INFO L87 Difference]: Start difference. First operand has 91 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 71 states have internal predecessors, (108), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 17:52:33,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:33,188 INFO L93 Difference]: Finished difference Result 176 states and 264 transitions. [2023-12-16 17:52:33,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 17:52:33,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2023-12-16 17:52:33,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:33,197 INFO L225 Difference]: With dead ends: 176 [2023-12-16 17:52:33,197 INFO L226 Difference]: Without dead ends: 88 [2023-12-16 17:52:33,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:33,203 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 117 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:33,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 114 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:52:33,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-16 17:52:33,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-12-16 17:52:33,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 68 states have internal predecessors, (96), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 17:52:33,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2023-12-16 17:52:33,253 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 57 [2023-12-16 17:52:33,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:33,254 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2023-12-16 17:52:33,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 17:52:33,254 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2023-12-16 17:52:33,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-16 17:52:33,256 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:33,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:52:33,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 17:52:33,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:33,459 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:33,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:33,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1173380748, now seen corresponding path program 1 times [2023-12-16 17:52:33,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:33,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1577185627] [2023-12-16 17:52:33,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:33,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:33,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:33,462 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:52:33,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 17:52:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:33,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 17:52:33,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:33,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:52:33,578 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:33,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:33,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1577185627] [2023-12-16 17:52:33,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1577185627] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:33,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:33,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 17:52:33,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128652929] [2023-12-16 17:52:33,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:33,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:52:33,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:33,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:52:33,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:52:33,580 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 17:52:33,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:33,804 INFO L93 Difference]: Finished difference Result 264 states and 375 transitions. [2023-12-16 17:52:33,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 17:52:33,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2023-12-16 17:52:33,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:33,807 INFO L225 Difference]: With dead ends: 264 [2023-12-16 17:52:33,808 INFO L226 Difference]: Without dead ends: 183 [2023-12-16 17:52:33,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 17:52:33,809 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 190 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:33,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 280 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 17:52:33,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-12-16 17:52:33,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 176. [2023-12-16 17:52:33,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 134 states have (on average 1.4328358208955223) internal successors, (192), 138 states have internal predecessors, (192), 25 states have call successors, (25), 15 states have call predecessors, (25), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2023-12-16 17:52:33,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 245 transitions. [2023-12-16 17:52:33,827 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 245 transitions. Word has length 57 [2023-12-16 17:52:33,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:33,827 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 245 transitions. [2023-12-16 17:52:33,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 17:52:33,827 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 245 transitions. [2023-12-16 17:52:33,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-16 17:52:33,829 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:33,829 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:52:33,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 17:52:34,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:34,031 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:34,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:34,032 INFO L85 PathProgramCache]: Analyzing trace with hash 2030424501, now seen corresponding path program 1 times [2023-12-16 17:52:34,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:34,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960081862] [2023-12-16 17:52:34,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:34,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:34,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:34,034 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:52:34,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 17:52:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:34,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 17:52:34,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:34,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:52:34,113 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:34,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:34,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960081862] [2023-12-16 17:52:34,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960081862] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:34,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:34,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 17:52:34,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63911202] [2023-12-16 17:52:34,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:34,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:52:34,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:34,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:52:34,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:52:34,115 INFO L87 Difference]: Start difference. First operand 176 states and 245 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 17:52:34,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:34,318 INFO L93 Difference]: Finished difference Result 535 states and 764 transitions. [2023-12-16 17:52:34,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 17:52:34,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2023-12-16 17:52:34,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:34,321 INFO L225 Difference]: With dead ends: 535 [2023-12-16 17:52:34,321 INFO L226 Difference]: Without dead ends: 371 [2023-12-16 17:52:34,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 17:52:34,323 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 182 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:34,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 284 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 17:52:34,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2023-12-16 17:52:34,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2023-12-16 17:52:34,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 277 states have (on average 1.4007220216606497) internal successors, (388), 289 states have internal predecessors, (388), 47 states have call successors, (47), 29 states have call predecessors, (47), 38 states have return successors, (70), 48 states have call predecessors, (70), 45 states have call successors, (70) [2023-12-16 17:52:34,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 505 transitions. [2023-12-16 17:52:34,369 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 505 transitions. Word has length 57 [2023-12-16 17:52:34,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:34,369 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 505 transitions. [2023-12-16 17:52:34,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 17:52:34,370 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 505 transitions. [2023-12-16 17:52:34,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-16 17:52:34,373 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:34,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:52:34,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 17:52:34,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:34,592 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:34,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:34,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1685039242, now seen corresponding path program 1 times [2023-12-16 17:52:34,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:34,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879196320] [2023-12-16 17:52:34,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:34,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:34,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:34,595 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:52:34,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 17:52:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:34,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 17:52:34,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:34,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:52:34,706 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:34,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:34,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879196320] [2023-12-16 17:52:34,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [879196320] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:34,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:34,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 17:52:34,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743077319] [2023-12-16 17:52:34,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:34,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 17:52:34,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:34,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 17:52:34,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 17:52:34,708 INFO L87 Difference]: Start difference. First operand 363 states and 505 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 17:52:34,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:34,768 INFO L93 Difference]: Finished difference Result 718 states and 1002 transitions. [2023-12-16 17:52:34,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 17:52:34,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2023-12-16 17:52:34,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:34,770 INFO L225 Difference]: With dead ends: 718 [2023-12-16 17:52:34,770 INFO L226 Difference]: Without dead ends: 381 [2023-12-16 17:52:34,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 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-16 17:52:34,772 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 6 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 555 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-16 17:52:34,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 555 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:52:34,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2023-12-16 17:52:34,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 371. [2023-12-16 17:52:34,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 283 states have (on average 1.3851590106007068) internal successors, (392), 295 states have internal predecessors, (392), 47 states have call successors, (47), 29 states have call predecessors, (47), 40 states have return successors, (72), 50 states have call predecessors, (72), 45 states have call successors, (72) [2023-12-16 17:52:34,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 511 transitions. [2023-12-16 17:52:34,800 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 511 transitions. Word has length 57 [2023-12-16 17:52:34,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:34,800 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 511 transitions. [2023-12-16 17:52:34,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 17:52:34,801 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 511 transitions. [2023-12-16 17:52:34,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-16 17:52:34,802 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:34,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:52:34,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-16 17:52:35,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:35,005 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:35,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:35,005 INFO L85 PathProgramCache]: Analyzing trace with hash 365944756, now seen corresponding path program 1 times [2023-12-16 17:52:35,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:35,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268733255] [2023-12-16 17:52:35,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:35,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:35,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:35,007 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:52:35,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 17:52:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:35,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 17:52:35,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:52:35,091 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:35,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:35,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268733255] [2023-12-16 17:52:35,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268733255] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:35,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:35,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 17:52:35,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613257952] [2023-12-16 17:52:35,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:35,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 17:52:35,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:35,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 17:52:35,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 17:52:35,093 INFO L87 Difference]: Start difference. First operand 371 states and 511 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 17:52:35,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:35,145 INFO L93 Difference]: Finished difference Result 728 states and 1004 transitions. [2023-12-16 17:52:35,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 17:52:35,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2023-12-16 17:52:35,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:35,147 INFO L225 Difference]: With dead ends: 728 [2023-12-16 17:52:35,147 INFO L226 Difference]: Without dead ends: 383 [2023-12-16 17:52:35,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 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-16 17:52:35,149 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 3 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 560 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-16 17:52:35,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 560 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:52:35,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2023-12-16 17:52:35,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2023-12-16 17:52:35,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 289 states have (on average 1.3702422145328719) internal successors, (396), 301 states have internal predecessors, (396), 47 states have call successors, (47), 29 states have call predecessors, (47), 42 states have return successors, (74), 52 states have call predecessors, (74), 45 states have call successors, (74) [2023-12-16 17:52:35,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 517 transitions. [2023-12-16 17:52:35,170 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 517 transitions. Word has length 57 [2023-12-16 17:52:35,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:35,170 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 517 transitions. [2023-12-16 17:52:35,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 17:52:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 517 transitions. [2023-12-16 17:52:35,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-16 17:52:35,171 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:35,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:52:35,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-16 17:52:35,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:35,376 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:35,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:35,376 INFO L85 PathProgramCache]: Analyzing trace with hash 427984370, now seen corresponding path program 1 times [2023-12-16 17:52:35,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:35,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992016354] [2023-12-16 17:52:35,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:35,377 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:35,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:35,378 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:52:35,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 17:52:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:35,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 17:52:35,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:52:35,456 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:35,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:35,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992016354] [2023-12-16 17:52:35,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992016354] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:35,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:35,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 17:52:35,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572858996] [2023-12-16 17:52:35,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:35,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 17:52:35,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:35,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 17:52:35,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 17:52:35,458 INFO L87 Difference]: Start difference. First operand 379 states and 517 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-16 17:52:35,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:35,623 INFO L93 Difference]: Finished difference Result 1077 states and 1460 transitions. [2023-12-16 17:52:35,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 17:52:35,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2023-12-16 17:52:35,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:35,626 INFO L225 Difference]: With dead ends: 1077 [2023-12-16 17:52:35,626 INFO L226 Difference]: Without dead ends: 728 [2023-12-16 17:52:35,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:52:35,628 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 156 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:35,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 178 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:52:35,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2023-12-16 17:52:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 724. [2023-12-16 17:52:35,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 544 states have (on average 1.3363970588235294) internal successors, (727), 571 states have internal predecessors, (727), 93 states have call successors, (93), 57 states have call predecessors, (93), 86 states have return successors, (159), 103 states have call predecessors, (159), 91 states have call successors, (159) [2023-12-16 17:52:35,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 979 transitions. [2023-12-16 17:52:35,667 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 979 transitions. Word has length 57 [2023-12-16 17:52:35,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:35,667 INFO L495 AbstractCegarLoop]: Abstraction has 724 states and 979 transitions. [2023-12-16 17:52:35,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-16 17:52:35,667 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 979 transitions. [2023-12-16 17:52:35,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-16 17:52:35,669 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:35,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:52:35,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 17:52:35,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:35,871 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:35,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:35,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1010014240, now seen corresponding path program 1 times [2023-12-16 17:52:35,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:35,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928008703] [2023-12-16 17:52:35,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:35,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:35,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:35,873 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:52:35,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 17:52:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:35,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 17:52:35,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:35,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:52:35,963 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:35,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:35,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928008703] [2023-12-16 17:52:35,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928008703] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:35,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:35,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 17:52:35,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342547257] [2023-12-16 17:52:35,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:35,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 17:52:35,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:35,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 17:52:35,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:35,965 INFO L87 Difference]: Start difference. First operand 724 states and 979 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 17:52:36,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:36,077 INFO L93 Difference]: Finished difference Result 2038 states and 2750 transitions. [2023-12-16 17:52:36,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 17:52:36,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 58 [2023-12-16 17:52:36,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:36,082 INFO L225 Difference]: With dead ends: 2038 [2023-12-16 17:52:36,082 INFO L226 Difference]: Without dead ends: 1356 [2023-12-16 17:52:36,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:36,084 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 61 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:36,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 219 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:52:36,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2023-12-16 17:52:36,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1312. [2023-12-16 17:52:36,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 984 states have (on average 1.309959349593496) internal successors, (1289), 1033 states have internal predecessors, (1289), 159 states have call successors, (159), 113 states have call predecessors, (159), 168 states have return successors, (273), 173 states have call predecessors, (273), 157 states have call successors, (273) [2023-12-16 17:52:36,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1721 transitions. [2023-12-16 17:52:36,156 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1721 transitions. Word has length 58 [2023-12-16 17:52:36,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:36,157 INFO L495 AbstractCegarLoop]: Abstraction has 1312 states and 1721 transitions. [2023-12-16 17:52:36,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 17:52:36,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1721 transitions. [2023-12-16 17:52:36,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-16 17:52:36,158 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:36,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:52:36,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 17:52:36,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:36,361 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:36,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:36,362 INFO L85 PathProgramCache]: Analyzing trace with hash 2016957774, now seen corresponding path program 1 times [2023-12-16 17:52:36,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:36,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080052742] [2023-12-16 17:52:36,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:36,362 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:36,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:36,363 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:52:36,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 17:52:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:36,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 17:52:36,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:36,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:52:36,452 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:36,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:36,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080052742] [2023-12-16 17:52:36,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080052742] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:36,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:36,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 17:52:36,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78272801] [2023-12-16 17:52:36,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:36,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 17:52:36,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:36,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 17:52:36,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:36,454 INFO L87 Difference]: Start difference. First operand 1312 states and 1721 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 17:52:36,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:36,591 INFO L93 Difference]: Finished difference Result 3728 states and 4888 transitions. [2023-12-16 17:52:36,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 17:52:36,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2023-12-16 17:52:36,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:36,599 INFO L225 Difference]: With dead ends: 3728 [2023-12-16 17:52:36,599 INFO L226 Difference]: Without dead ends: 2430 [2023-12-16 17:52:36,601 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-16 17:52:36,601 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 62 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:36,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 194 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:52:36,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2023-12-16 17:52:36,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2398. [2023-12-16 17:52:36,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2398 states, 1802 states have (on average 1.2952275249722531) internal successors, (2334), 1872 states have internal predecessors, (2334), 279 states have call successors, (279), 225 states have call predecessors, (279), 316 states have return successors, (451), 304 states have call predecessors, (451), 277 states have call successors, (451) [2023-12-16 17:52:36,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 3064 transitions. [2023-12-16 17:52:36,716 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 3064 transitions. Word has length 59 [2023-12-16 17:52:36,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:36,716 INFO L495 AbstractCegarLoop]: Abstraction has 2398 states and 3064 transitions. [2023-12-16 17:52:36,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 17:52:36,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 3064 transitions. [2023-12-16 17:52:36,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-16 17:52:36,718 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:36,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:52:36,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 17:52:36,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:36,934 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:36,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:36,935 INFO L85 PathProgramCache]: Analyzing trace with hash -321283507, now seen corresponding path program 1 times [2023-12-16 17:52:36,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:36,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922139033] [2023-12-16 17:52:36,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:36,936 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:36,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:36,937 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:52:36,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 17:52:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:36,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 17:52:37,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:37,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:52:37,060 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:37,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:37,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922139033] [2023-12-16 17:52:37,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922139033] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:37,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:37,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 17:52:37,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60650743] [2023-12-16 17:52:37,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:37,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 17:52:37,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:37,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 17:52:37,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:37,061 INFO L87 Difference]: Start difference. First operand 2398 states and 3064 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 17:52:37,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:37,232 INFO L93 Difference]: Finished difference Result 5334 states and 6802 transitions. [2023-12-16 17:52:37,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 17:52:37,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 65 [2023-12-16 17:52:37,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:37,242 INFO L225 Difference]: With dead ends: 5334 [2023-12-16 17:52:37,242 INFO L226 Difference]: Without dead ends: 2958 [2023-12-16 17:52:37,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:37,247 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 56 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:37,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 219 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:52:37,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2023-12-16 17:52:37,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2914. [2023-12-16 17:52:37,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 2190 states have (on average 1.2812785388127854) internal successors, (2806), 2268 states have internal predecessors, (2806), 343 states have call successors, (343), 281 states have call predecessors, (343), 380 states have return successors, (534), 368 states have call predecessors, (534), 341 states have call successors, (534) [2023-12-16 17:52:37,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 3683 transitions. [2023-12-16 17:52:37,405 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 3683 transitions. Word has length 65 [2023-12-16 17:52:37,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:37,405 INFO L495 AbstractCegarLoop]: Abstraction has 2914 states and 3683 transitions. [2023-12-16 17:52:37,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 17:52:37,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 3683 transitions. [2023-12-16 17:52:37,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-16 17:52:37,406 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:37,406 INFO L195 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:52:37,414 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 (10)] Ended with exit code 0 [2023-12-16 17:52:37,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:37,609 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:37,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:37,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1885701990, now seen corresponding path program 1 times [2023-12-16 17:52:37,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:37,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126145998] [2023-12-16 17:52:37,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:37,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:37,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:37,611 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:52:37,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-16 17:52:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:37,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 17:52:37,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:37,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:52:37,672 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:37,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:37,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126145998] [2023-12-16 17:52:37,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1126145998] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:37,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:37,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 17:52:37,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712960002] [2023-12-16 17:52:37,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:37,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 17:52:37,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:37,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 17:52:37,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 17:52:37,673 INFO L87 Difference]: Start difference. First operand 2914 states and 3683 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 17:52:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:37,900 INFO L93 Difference]: Finished difference Result 3534 states and 4456 transitions. [2023-12-16 17:52:37,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 17:52:37,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 66 [2023-12-16 17:52:37,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:37,911 INFO L225 Difference]: With dead ends: 3534 [2023-12-16 17:52:37,912 INFO L226 Difference]: Without dead ends: 3531 [2023-12-16 17:52:37,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:52:37,913 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 245 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:37,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 202 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:52:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3531 states. [2023-12-16 17:52:38,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3531 to 3497. [2023-12-16 17:52:38,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3497 states, 2628 states have (on average 1.2766362252663623) internal successors, (3355), 2720 states have internal predecessors, (3355), 408 states have call successors, (408), 337 states have call predecessors, (408), 460 states have return successors, (637), 443 states have call predecessors, (637), 407 states have call successors, (637) [2023-12-16 17:52:38,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3497 states to 3497 states and 4400 transitions. [2023-12-16 17:52:38,090 INFO L78 Accepts]: Start accepts. Automaton has 3497 states and 4400 transitions. Word has length 66 [2023-12-16 17:52:38,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:38,090 INFO L495 AbstractCegarLoop]: Abstraction has 3497 states and 4400 transitions. [2023-12-16 17:52:38,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 17:52:38,091 INFO L276 IsEmpty]: Start isEmpty. Operand 3497 states and 4400 transitions. [2023-12-16 17:52:38,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-16 17:52:38,091 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:38,091 INFO L195 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:52:38,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-16 17:52:38,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:38,294 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:38,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:38,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1672428599, now seen corresponding path program 1 times [2023-12-16 17:52:38,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:38,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918538889] [2023-12-16 17:52:38,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:38,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:38,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:38,296 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:52:38,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-16 17:52:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:38,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 17:52:38,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:38,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:52:38,500 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:52:38,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:52:38,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:38,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918538889] [2023-12-16 17:52:38,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918538889] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:52:38,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:52:38,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-16 17:52:38,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007097914] [2023-12-16 17:52:38,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:52:38,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 17:52:38,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:38,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 17:52:38,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-16 17:52:38,577 INFO L87 Difference]: Start difference. First operand 3497 states and 4400 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 17:52:39,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:39,097 INFO L93 Difference]: Finished difference Result 8036 states and 10156 transitions. [2023-12-16 17:52:39,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 17:52:39,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 67 [2023-12-16 17:52:39,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:39,120 INFO L225 Difference]: With dead ends: 8036 [2023-12-16 17:52:39,120 INFO L226 Difference]: Without dead ends: 8033 [2023-12-16 17:52:39,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 127 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-16 17:52:39,122 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 514 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:39,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 827 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:52:39,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8033 states. [2023-12-16 17:52:39,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8033 to 5851. [2023-12-16 17:52:39,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5851 states, 4402 states have (on average 1.2800999545661063) internal successors, (5635), 4560 states have internal predecessors, (5635), 672 states have call successors, (672), 561 states have call predecessors, (672), 776 states have return successors, (1071), 733 states have call predecessors, (1071), 671 states have call successors, (1071) [2023-12-16 17:52:39,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5851 states to 5851 states and 7378 transitions. [2023-12-16 17:52:39,498 INFO L78 Accepts]: Start accepts. Automaton has 5851 states and 7378 transitions. Word has length 67 [2023-12-16 17:52:39,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:39,499 INFO L495 AbstractCegarLoop]: Abstraction has 5851 states and 7378 transitions. [2023-12-16 17:52:39,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-16 17:52:39,499 INFO L276 IsEmpty]: Start isEmpty. Operand 5851 states and 7378 transitions. [2023-12-16 17:52:39,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-16 17:52:39,500 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:39,500 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:52:39,505 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 (12)] Ended with exit code 0 [2023-12-16 17:52:39,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:39,703 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:39,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:39,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1152070234, now seen corresponding path program 2 times [2023-12-16 17:52:39,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:39,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1185160255] [2023-12-16 17:52:39,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 17:52:39,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:39,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:39,721 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:52:39,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-16 17:52:39,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 17:52:39,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:52:39,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 17:52:39,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:39,769 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:52:39,769 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:39,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:39,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1185160255] [2023-12-16 17:52:39,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1185160255] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:39,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:39,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 17:52:39,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843382103] [2023-12-16 17:52:39,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:39,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 17:52:39,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:39,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 17:52:39,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:39,771 INFO L87 Difference]: Start difference. First operand 5851 states and 7378 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 17:52:39,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:39,995 INFO L93 Difference]: Finished difference Result 8822 states and 11234 transitions. [2023-12-16 17:52:39,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 17:52:39,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 70 [2023-12-16 17:52:39,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:40,008 INFO L225 Difference]: With dead ends: 8822 [2023-12-16 17:52:40,009 INFO L226 Difference]: Without dead ends: 3519 [2023-12-16 17:52:40,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:40,020 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 93 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 276 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-16 17:52:40,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 276 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:52:40,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3519 states. [2023-12-16 17:52:40,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3519 to 3495. [2023-12-16 17:52:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3495 states, 2630 states have (on average 1.2581749049429658) internal successors, (3309), 2718 states have internal predecessors, (3309), 408 states have call successors, (408), 337 states have call predecessors, (408), 456 states have return successors, (605), 443 states have call predecessors, (605), 407 states have call successors, (605) [2023-12-16 17:52:40,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3495 states to 3495 states and 4322 transitions. [2023-12-16 17:52:40,260 INFO L78 Accepts]: Start accepts. Automaton has 3495 states and 4322 transitions. Word has length 70 [2023-12-16 17:52:40,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:40,260 INFO L495 AbstractCegarLoop]: Abstraction has 3495 states and 4322 transitions. [2023-12-16 17:52:40,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-16 17:52:40,261 INFO L276 IsEmpty]: Start isEmpty. Operand 3495 states and 4322 transitions. [2023-12-16 17:52:40,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-16 17:52:40,262 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:40,262 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:52:40,265 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-16 17:52:40,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:40,465 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:40,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:40,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1706112077, now seen corresponding path program 1 times [2023-12-16 17:52:40,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:40,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469238994] [2023-12-16 17:52:40,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:40,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:40,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:40,466 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:52:40,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-16 17:52:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:40,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 17:52:40,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:40,545 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-16 17:52:40,545 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:40,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:40,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469238994] [2023-12-16 17:52:40,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469238994] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:40,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:40,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 17:52:40,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894135131] [2023-12-16 17:52:40,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:40,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 17:52:40,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:40,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 17:52:40,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:40,547 INFO L87 Difference]: Start difference. First operand 3495 states and 4322 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 17:52:40,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:40,859 INFO L93 Difference]: Finished difference Result 7268 states and 9039 transitions. [2023-12-16 17:52:40,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 17:52:40,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2023-12-16 17:52:40,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:40,881 INFO L225 Difference]: With dead ends: 7268 [2023-12-16 17:52:40,881 INFO L226 Difference]: Without dead ends: 5143 [2023-12-16 17:52:40,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:40,886 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 77 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:40,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 285 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:52:40,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5143 states. [2023-12-16 17:52:41,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5143 to 5143. [2023-12-16 17:52:41,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5143 states, 3840 states have (on average 1.2453125) internal successors, (4782), 3973 states have internal predecessors, (4782), 606 states have call successors, (606), 505 states have call predecessors, (606), 696 states have return successors, (929), 668 states have call predecessors, (929), 605 states have call successors, (929) [2023-12-16 17:52:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5143 states to 5143 states and 6317 transitions. [2023-12-16 17:52:41,265 INFO L78 Accepts]: Start accepts. Automaton has 5143 states and 6317 transitions. Word has length 75 [2023-12-16 17:52:41,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:41,265 INFO L495 AbstractCegarLoop]: Abstraction has 5143 states and 6317 transitions. [2023-12-16 17:52:41,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 17:52:41,265 INFO L276 IsEmpty]: Start isEmpty. Operand 5143 states and 6317 transitions. [2023-12-16 17:52:41,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-16 17:52:41,267 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:41,267 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:52:41,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-16 17:52:41,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:41,470 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:41,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:41,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1738362806, now seen corresponding path program 1 times [2023-12-16 17:52:41,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:41,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607152331] [2023-12-16 17:52:41,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:41,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:41,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:41,472 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:52:41,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-16 17:52:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:41,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 17:52:41,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:41,563 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 17:52:41,563 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:41,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:41,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607152331] [2023-12-16 17:52:41,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [607152331] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:41,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:41,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 17:52:41,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611727354] [2023-12-16 17:52:41,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:41,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 17:52:41,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:41,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 17:52:41,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 17:52:41,565 INFO L87 Difference]: Start difference. First operand 5143 states and 6317 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-16 17:52:42,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:42,018 INFO L93 Difference]: Finished difference Result 10290 states and 12649 transitions. [2023-12-16 17:52:42,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 17:52:42,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 84 [2023-12-16 17:52:42,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:42,030 INFO L225 Difference]: With dead ends: 10290 [2023-12-16 17:52:42,030 INFO L226 Difference]: Without dead ends: 5173 [2023-12-16 17:52:42,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:52:42,038 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 137 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:42,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 161 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:52:42,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5173 states. [2023-12-16 17:52:42,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5173 to 5173. [2023-12-16 17:52:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5173 states, 3855 states have (on average 1.2272373540856032) internal successors, (4731), 4003 states have internal predecessors, (4731), 606 states have call successors, (606), 505 states have call predecessors, (606), 711 states have return successors, (929), 668 states have call predecessors, (929), 605 states have call successors, (929) [2023-12-16 17:52:42,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5173 states to 5173 states and 6266 transitions. [2023-12-16 17:52:42,393 INFO L78 Accepts]: Start accepts. Automaton has 5173 states and 6266 transitions. Word has length 84 [2023-12-16 17:52:42,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:42,393 INFO L495 AbstractCegarLoop]: Abstraction has 5173 states and 6266 transitions. [2023-12-16 17:52:42,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-16 17:52:42,393 INFO L276 IsEmpty]: Start isEmpty. Operand 5173 states and 6266 transitions. [2023-12-16 17:52:42,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-16 17:52:42,395 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:42,395 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:52:42,400 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 (15)] Ended with exit code 0 [2023-12-16 17:52:42,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:42,599 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:42,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:42,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1385832991, now seen corresponding path program 1 times [2023-12-16 17:52:42,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:42,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473622255] [2023-12-16 17:52:42,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:42,599 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:42,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:42,600 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:52:42,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-16 17:52:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:42,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 17:52:42,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:42,656 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 17:52:42,656 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:42,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:42,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473622255] [2023-12-16 17:52:42,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473622255] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:42,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:42,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 17:52:42,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663666788] [2023-12-16 17:52:42,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:42,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 17:52:42,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:42,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 17:52:42,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:42,657 INFO L87 Difference]: Start difference. First operand 5173 states and 6266 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 17:52:42,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:42,970 INFO L93 Difference]: Finished difference Result 10079 states and 12204 transitions. [2023-12-16 17:52:42,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 17:52:42,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 85 [2023-12-16 17:52:42,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:42,989 INFO L225 Difference]: With dead ends: 10079 [2023-12-16 17:52:42,990 INFO L226 Difference]: Without dead ends: 4922 [2023-12-16 17:52:43,000 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-16 17:52:43,000 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 95 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:43,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 281 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:52:43,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4922 states. [2023-12-16 17:52:43,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4922 to 4919. [2023-12-16 17:52:43,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4919 states, 3671 states have (on average 1.213020975211114) internal successors, (4453), 3813 states have internal predecessors, (4453), 568 states have call successors, (568), 477 states have call predecessors, (568), 679 states have return successors, (812), 630 states have call predecessors, (812), 567 states have call successors, (812) [2023-12-16 17:52:43,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4919 states to 4919 states and 5833 transitions. [2023-12-16 17:52:43,364 INFO L78 Accepts]: Start accepts. Automaton has 4919 states and 5833 transitions. Word has length 85 [2023-12-16 17:52:43,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:43,364 INFO L495 AbstractCegarLoop]: Abstraction has 4919 states and 5833 transitions. [2023-12-16 17:52:43,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 17:52:43,364 INFO L276 IsEmpty]: Start isEmpty. Operand 4919 states and 5833 transitions. [2023-12-16 17:52:43,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-16 17:52:43,371 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:43,371 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:52:43,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-16 17:52:43,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:43,574 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:43,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:43,574 INFO L85 PathProgramCache]: Analyzing trace with hash 758110016, now seen corresponding path program 1 times [2023-12-16 17:52:43,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:43,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2070090026] [2023-12-16 17:52:43,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:43,575 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:43,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:43,576 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:52:43,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-16 17:52:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:43,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 17:52:43,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:43,654 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-12-16 17:52:43,654 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:43,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:43,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2070090026] [2023-12-16 17:52:43,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2070090026] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:43,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:43,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 17:52:43,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380214525] [2023-12-16 17:52:43,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:43,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:52:43,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:43,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:52:43,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:52:43,656 INFO L87 Difference]: Start difference. First operand 4919 states and 5833 transitions. Second operand has 5 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 17:52:44,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:44,215 INFO L93 Difference]: Finished difference Result 12170 states and 14519 transitions. [2023-12-16 17:52:44,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 17:52:44,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 144 [2023-12-16 17:52:44,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:44,231 INFO L225 Difference]: With dead ends: 12170 [2023-12-16 17:52:44,231 INFO L226 Difference]: Without dead ends: 7062 [2023-12-16 17:52:44,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-16 17:52:44,241 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 177 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:44,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 211 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 17:52:44,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7062 states. [2023-12-16 17:52:44,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7062 to 6742. [2023-12-16 17:52:44,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6742 states, 5005 states have (on average 1.2143856143856144) internal successors, (6078), 5183 states have internal predecessors, (6078), 788 states have call successors, (788), 666 states have call predecessors, (788), 948 states have return successors, (1106), 893 states have call predecessors, (1106), 787 states have call successors, (1106) [2023-12-16 17:52:44,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6742 states to 6742 states and 7972 transitions. [2023-12-16 17:52:44,643 INFO L78 Accepts]: Start accepts. Automaton has 6742 states and 7972 transitions. Word has length 144 [2023-12-16 17:52:44,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:44,643 INFO L495 AbstractCegarLoop]: Abstraction has 6742 states and 7972 transitions. [2023-12-16 17:52:44,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 17:52:44,643 INFO L276 IsEmpty]: Start isEmpty. Operand 6742 states and 7972 transitions. [2023-12-16 17:52:44,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-16 17:52:44,648 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:44,648 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:52:44,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-16 17:52:44,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:44,851 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:44,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:44,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1751602779, now seen corresponding path program 1 times [2023-12-16 17:52:44,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:44,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875159532] [2023-12-16 17:52:44,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:44,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:44,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:44,853 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:52:44,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-16 17:52:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:44,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 17:52:44,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:44,976 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2023-12-16 17:52:44,976 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:44,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:44,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875159532] [2023-12-16 17:52:44,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [875159532] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:44,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:44,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 17:52:44,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346279147] [2023-12-16 17:52:44,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:44,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 17:52:44,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:44,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 17:52:44,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 17:52:44,977 INFO L87 Difference]: Start difference. First operand 6742 states and 7972 transitions. Second operand has 6 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 17:52:45,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:45,249 INFO L93 Difference]: Finished difference Result 10574 states and 12641 transitions. [2023-12-16 17:52:45,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 17:52:45,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 216 [2023-12-16 17:52:45,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:45,258 INFO L225 Difference]: With dead ends: 10574 [2023-12-16 17:52:45,258 INFO L226 Difference]: Without dead ends: 3841 [2023-12-16 17:52:45,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 17:52:45,267 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 32 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:45,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 524 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:52:45,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3841 states. [2023-12-16 17:52:45,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3841 to 2949. [2023-12-16 17:52:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2300 states have (on average 1.2073913043478262) internal successors, (2777), 2354 states have internal predecessors, (2777), 293 states have call successors, (293), 227 states have call predecessors, (293), 355 states have return successors, (427), 367 states have call predecessors, (427), 292 states have call successors, (427) [2023-12-16 17:52:45,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3497 transitions. [2023-12-16 17:52:45,432 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 3497 transitions. Word has length 216 [2023-12-16 17:52:45,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:45,432 INFO L495 AbstractCegarLoop]: Abstraction has 2949 states and 3497 transitions. [2023-12-16 17:52:45,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 17:52:45,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 3497 transitions. [2023-12-16 17:52:45,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-12-16 17:52:45,435 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:45,436 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 17:52:45,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-16 17:52:45,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:45,649 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:45,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:45,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1819492835, now seen corresponding path program 1 times [2023-12-16 17:52:45,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:45,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620065530] [2023-12-16 17:52:45,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:45,649 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:45,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:45,666 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:52:45,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-16 17:52:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:45,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 17:52:45,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:45,923 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2023-12-16 17:52:45,923 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:45,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:45,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620065530] [2023-12-16 17:52:45,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620065530] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:45,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:45,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 17:52:45,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110812568] [2023-12-16 17:52:45,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:45,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 17:52:45,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:45,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 17:52:45,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:45,925 INFO L87 Difference]: Start difference. First operand 2949 states and 3497 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-16 17:52:46,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:46,320 INFO L93 Difference]: Finished difference Result 7719 states and 9280 transitions. [2023-12-16 17:52:46,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 17:52:46,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 228 [2023-12-16 17:52:46,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:46,326 INFO L225 Difference]: With dead ends: 7719 [2023-12-16 17:52:46,326 INFO L226 Difference]: Without dead ends: 3016 [2023-12-16 17:52:46,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:46,333 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 38 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:46,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 227 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:52:46,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2023-12-16 17:52:46,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 2949. [2023-12-16 17:52:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2300 states have (on average 1.1939130434782608) internal successors, (2746), 2354 states have internal predecessors, (2746), 293 states have call successors, (293), 227 states have call predecessors, (293), 355 states have return successors, (427), 367 states have call predecessors, (427), 292 states have call successors, (427) [2023-12-16 17:52:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3466 transitions. [2023-12-16 17:52:46,510 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 3466 transitions. Word has length 228 [2023-12-16 17:52:46,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:46,510 INFO L495 AbstractCegarLoop]: Abstraction has 2949 states and 3466 transitions. [2023-12-16 17:52:46,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-16 17:52:46,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 3466 transitions. [2023-12-16 17:52:46,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-12-16 17:52:46,513 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:46,514 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:52:46,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-16 17:52:46,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:46,717 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:46,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:46,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1143729042, now seen corresponding path program 1 times [2023-12-16 17:52:46,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:46,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274788529] [2023-12-16 17:52:46,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:46,718 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:46,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:46,733 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:52:46,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-16 17:52:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:46,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 17:52:46,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:46,875 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-16 17:52:46,875 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:46,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:46,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274788529] [2023-12-16 17:52:46,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274788529] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:46,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:46,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 17:52:46,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23024248] [2023-12-16 17:52:46,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:46,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:52:46,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:46,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:52:46,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:52:46,877 INFO L87 Difference]: Start difference. First operand 2949 states and 3466 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 3 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-12-16 17:52:47,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:47,173 INFO L93 Difference]: Finished difference Result 4413 states and 5194 transitions. [2023-12-16 17:52:47,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 17:52:47,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 3 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 229 [2023-12-16 17:52:47,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:47,176 INFO L225 Difference]: With dead ends: 4413 [2023-12-16 17:52:47,176 INFO L226 Difference]: Without dead ends: 1534 [2023-12-16 17:52:47,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 17:52:47,180 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 67 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:47,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 212 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 17:52:47,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2023-12-16 17:52:47,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1338. [2023-12-16 17:52:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1338 states, 1023 states have (on average 1.163245356793744) internal successors, (1190), 1043 states have internal predecessors, (1190), 146 states have call successors, (146), 122 states have call predecessors, (146), 168 states have return successors, (218), 172 states have call predecessors, (218), 145 states have call successors, (218) [2023-12-16 17:52:47,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1554 transitions. [2023-12-16 17:52:47,290 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1554 transitions. Word has length 229 [2023-12-16 17:52:47,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:47,290 INFO L495 AbstractCegarLoop]: Abstraction has 1338 states and 1554 transitions. [2023-12-16 17:52:47,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 3 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-12-16 17:52:47,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1554 transitions. [2023-12-16 17:52:47,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2023-12-16 17:52:47,293 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:47,293 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-16 17:52:47,296 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 (20)] Ended with exit code 0 [2023-12-16 17:52:47,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:47,496 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:47,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:47,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1367689697, now seen corresponding path program 1 times [2023-12-16 17:52:47,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:47,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282551189] [2023-12-16 17:52:47,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:47,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:47,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:47,499 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:52:47,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-16 17:52:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:47,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 17:52:47,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:47,719 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-12-16 17:52:47,719 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:47,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:47,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282551189] [2023-12-16 17:52:47,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282551189] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:47,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:47,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 17:52:47,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675523500] [2023-12-16 17:52:47,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:47,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 17:52:47,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:47,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 17:52:47,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:47,720 INFO L87 Difference]: Start difference. First operand 1338 states and 1554 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-12-16 17:52:47,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:47,816 INFO L93 Difference]: Finished difference Result 2570 states and 3032 transitions. [2023-12-16 17:52:47,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 17:52:47,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 230 [2023-12-16 17:52:47,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:47,819 INFO L225 Difference]: With dead ends: 2570 [2023-12-16 17:52:47,819 INFO L226 Difference]: Without dead ends: 1320 [2023-12-16 17:52:47,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:47,821 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 29 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:47,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 206 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:52:47,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2023-12-16 17:52:47,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1317. [2023-12-16 17:52:47,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1005 states have (on average 1.1452736318407961) internal successors, (1151), 1025 states have internal predecessors, (1151), 146 states have call successors, (146), 122 states have call predecessors, (146), 165 states have return successors, (215), 169 states have call predecessors, (215), 145 states have call successors, (215) [2023-12-16 17:52:47,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1512 transitions. [2023-12-16 17:52:47,913 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1512 transitions. Word has length 230 [2023-12-16 17:52:47,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:47,913 INFO L495 AbstractCegarLoop]: Abstraction has 1317 states and 1512 transitions. [2023-12-16 17:52:47,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-12-16 17:52:47,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1512 transitions. [2023-12-16 17:52:47,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2023-12-16 17:52:47,916 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:47,916 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-16 17:52:47,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-16 17:52:48,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:48,120 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:48,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:48,120 INFO L85 PathProgramCache]: Analyzing trace with hash 154144537, now seen corresponding path program 1 times [2023-12-16 17:52:48,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:48,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848488056] [2023-12-16 17:52:48,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:48,120 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:48,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:48,121 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:52:48,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-16 17:52:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:48,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 17:52:48,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2023-12-16 17:52:48,252 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:48,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:48,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [848488056] [2023-12-16 17:52:48,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [848488056] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:48,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:48,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 17:52:48,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47162092] [2023-12-16 17:52:48,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:48,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:52:48,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:48,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:52:48,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:52:48,253 INFO L87 Difference]: Start difference. First operand 1317 states and 1512 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 3 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-12-16 17:52:48,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:48,441 INFO L93 Difference]: Finished difference Result 1666 states and 1899 transitions. [2023-12-16 17:52:48,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 17:52:48,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 3 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 232 [2023-12-16 17:52:48,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:48,443 INFO L225 Difference]: With dead ends: 1666 [2023-12-16 17:52:48,443 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 17:52:48,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 17:52:48,445 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 49 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:48,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 247 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:52:48,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 17:52:48,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 17:52:48,447 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-16 17:52:48,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 17:52:48,447 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 232 [2023-12-16 17:52:48,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:48,447 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 17:52:48,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 3 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-12-16 17:52:48,447 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 17:52:48,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 17:52:48,449 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 17:52:48,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-12-16 17:52:48,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:48,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 17:53:07,178 INFO L899 garLoopResultBuilder]: For program point L321(line 321) no Hoare annotation was computed. [2023-12-16 17:53:07,179 INFO L899 garLoopResultBuilder]: For program point L323-2(lines 307 331) no Hoare annotation was computed. [2023-12-16 17:53:07,179 INFO L899 garLoopResultBuilder]: For program point L315(lines 315 319) no Hoare annotation was computed. [2023-12-16 17:53:07,180 INFO L895 garLoopResultBuilder]: At program point L313(line 313) the Hoare annotation is: (let ((.cse15 (= ~p_dw_st~0 (_ bv2 32)))) (let ((.cse2 (not (= ~p_dw_pc~0 (_ bv1 32)))) (.cse4 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))))) (.cse3 (not (= ~q_free~0 (_ bv0 32)))) (.cse10 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse14 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse17 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse18 (not (= |old(~c_dr_st~0)| (_ bv0 32)))) (.cse19 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse16 (= ~c_dr_st~0 (_ bv0 32))) (.cse5 (not (= (_ bv2 32) ~q_read_ev~0))) (.cse6 (not (= (_ bv2 32) ~q_write_ev~0))) (.cse20 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse0 (and .cse15 (= (_ bv2 32) ~c_dr_st~0))) (.cse1 (not (= ~c_dr_i~0 (_ bv1 32)))) (.cse11 (not (= ~p_num_write~0 ~c_num_read~0))) (.cse21 (= ~c_dr_pc~0 (_ bv1 32))) (.cse7 (not (= |old(~c_dr_st~0)| (_ bv2 32)))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (= (_ bv2 32) |old(~p_dw_st~0)|))) (.cse12 (not (= ~q_free~0 (_ bv1 32)))) (.cse13 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse1 .cse2 .cse11 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse11 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9) (or .cse1 .cse14 (and .cse15 .cse16) .cse17 .cse18 .cse19 .cse6 .cse20 .cse8 .cse9 .cse12 .cse13) (or .cse0 .cse1 .cse14 .cse11 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13) (or .cse0 .cse1 .cse3 .cse21 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse1 .cse11 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13) (or .cse10 .cse1 .cse14 (not (= |old(~p_dw_st~0)| (_ bv0 32))) .cse17 .cse18 .cse19 (and (= ~p_dw_st~0 (_ bv0 32)) .cse16) .cse5 .cse6 .cse20 .cse8 .cse12 .cse13) (or .cse0 .cse1 .cse11 .cse21 .cse7 .cse8 .cse9 .cse12 .cse13)))) [2023-12-16 17:53:07,181 INFO L895 garLoopResultBuilder]: At program point L315-2(lines 315 319) the Hoare annotation is: (let ((.cse15 (= ~p_dw_st~0 (_ bv0 32))) (.cse31 (= ~p_last_write~0 ~q_buf_0~0)) (.cse34 (= (_ bv2 32) ~q_write_ev~0)) (.cse35 (= (_ bv2 32) ~q_read_ev~0)) (.cse14 (= activate_threads_~tmp~1 (_ bv0 32))) (.cse25 (= ~p_dw_st~0 (_ bv2 32))) (.cse29 (= ~p_last_write~0 ~c_last_read~0)) (.cse30 (= ~q_free~0 (_ bv1 32))) (.cse28 (= (_ bv2 32) ~c_dr_st~0)) (.cse33 (= ~c_dr_i~0 (_ bv1 32))) (.cse32 (= ~p_num_write~0 ~c_num_read~0))) (let ((.cse24 (and .cse31 .cse34 .cse35 .cse14 .cse25 .cse29 .cse30 .cse28 .cse33 .cse32)) (.cse16 (= ~c_dr_st~0 (_ bv0 32))) (.cse11 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse12 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse13 (not (= |old(~c_dr_st~0)| (_ bv0 32)))) (.cse17 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse18 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse3 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))))) (.cse7 (and .cse14 .cse25 .cse28)) (.cse21 (and .cse14 .cse25)) (.cse4 (not .cse35)) (.cse2 (not (= ~q_free~0 (_ bv0 32)))) (.cse10 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse1 (not (= ~p_dw_pc~0 (_ bv1 32)))) (.cse5 (not .cse34)) (.cse26 (and .cse25 .cse28)) (.cse0 (not .cse33)) (.cse23 (not .cse32)) (.cse27 (and .cse15 .cse28)) (.cse22 (= ~c_dr_pc~0 (_ bv1 32))) (.cse6 (not (= |old(~c_dr_st~0)| (_ bv2 32)))) (.cse8 (not .cse31)) (.cse9 (not (= (_ bv2 32) |old(~p_dw_st~0)|))) (.cse19 (not .cse30)) (.cse20 (not .cse29))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse11 (not (= |old(~p_dw_st~0)| (_ bv0 32))) .cse12 .cse13 (and .cse14 .cse15 .cse16) .cse17 .cse4 .cse5 .cse18 .cse8 .cse19 .cse20) (or .cse0 .cse21 .cse2 .cse22 .cse4 .cse6 .cse8 .cse9) (or .cse0 .cse11 .cse23 .cse14 .cse4 .cse5 .cse6 .cse8 .cse9 .cse19 .cse20) (or .cse0 .cse1 .cse23 .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse19 .cse20) (or .cse10 .cse0 .cse23 .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse19 .cse20) (or .cse0 .cse11 (and .cse25 .cse16) .cse12 .cse13 .cse17 .cse5 .cse18 .cse8 .cse9 .cse19 .cse20) (or .cse26 .cse0 .cse11 .cse23 .cse5 .cse6 .cse8 .cse9 .cse19 .cse20) (or .cse0 .cse11 .cse14 .cse12 .cse13 .cse17 .cse4 .cse5 .cse18 .cse8 .cse9 .cse19 .cse20) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse21 .cse23 .cse22 .cse4 .cse6 .cse8 .cse9 .cse19 .cse20) (or .cse26 .cse0 .cse27 .cse2 .cse22 .cse6 .cse8 .cse9) (or .cse10 .cse26 .cse0 .cse1 .cse23 (and .cse15 .cse28 (= (_ bv1 32) ~q_read_ev~0)) .cse5 .cse6 .cse8 .cse9 .cse19 .cse20) (or .cse26 .cse0 .cse23 .cse27 .cse22 .cse6 .cse8 .cse9 .cse19 .cse20)))) [2023-12-16 17:53:07,181 INFO L899 garLoopResultBuilder]: For program point L313-1(line 313) no Hoare annotation was computed. [2023-12-16 17:53:07,181 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 307 331) no Hoare annotation was computed. [2023-12-16 17:53:07,181 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 307 331) the Hoare annotation is: (let ((.cse15 (= ~p_dw_st~0 (_ bv2 32)))) (let ((.cse2 (not (= ~p_dw_pc~0 (_ bv1 32)))) (.cse4 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))))) (.cse3 (not (= ~q_free~0 (_ bv0 32)))) (.cse10 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse14 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse17 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse18 (not (= |old(~c_dr_st~0)| (_ bv0 32)))) (.cse19 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse16 (= ~c_dr_st~0 (_ bv0 32))) (.cse5 (not (= (_ bv2 32) ~q_read_ev~0))) (.cse6 (not (= (_ bv2 32) ~q_write_ev~0))) (.cse20 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse0 (and .cse15 (= (_ bv2 32) ~c_dr_st~0))) (.cse1 (not (= ~c_dr_i~0 (_ bv1 32)))) (.cse11 (not (= ~p_num_write~0 ~c_num_read~0))) (.cse21 (= ~c_dr_pc~0 (_ bv1 32))) (.cse7 (not (= |old(~c_dr_st~0)| (_ bv2 32)))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (= (_ bv2 32) |old(~p_dw_st~0)|))) (.cse12 (not (= ~q_free~0 (_ bv1 32)))) (.cse13 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse1 .cse2 .cse11 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse11 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9) (or .cse1 .cse14 (and .cse15 .cse16) .cse17 .cse18 .cse19 .cse6 .cse20 .cse8 .cse9 .cse12 .cse13) (or .cse0 .cse1 .cse14 .cse11 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13) (or .cse0 .cse1 .cse3 .cse21 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse1 .cse11 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13) (or .cse10 .cse1 .cse14 (not (= |old(~p_dw_st~0)| (_ bv0 32))) .cse17 .cse18 .cse19 (and (= ~p_dw_st~0 (_ bv0 32)) .cse16) .cse5 .cse6 .cse20 .cse8 .cse12 .cse13) (or .cse0 .cse1 .cse11 .cse21 .cse7 .cse8 .cse9 .cse12 .cse13)))) [2023-12-16 17:53:07,181 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2023-12-16 17:53:07,181 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 265) no Hoare annotation was computed. [2023-12-16 17:53:07,182 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 251 270) no Hoare annotation was computed. [2023-12-16 17:53:07,182 INFO L899 garLoopResultBuilder]: For program point L267(lines 254 269) no Hoare annotation was computed. [2023-12-16 17:53:07,182 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 251 270) the Hoare annotation is: true [2023-12-16 17:53:07,182 INFO L899 garLoopResultBuilder]: For program point L259(lines 259 264) no Hoare annotation was computed. [2023-12-16 17:53:07,182 INFO L899 garLoopResultBuilder]: For program point L95(lines 83 97) no Hoare annotation was computed. [2023-12-16 17:53:07,182 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2023-12-16 17:53:07,182 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 93) no Hoare annotation was computed. [2023-12-16 17:53:07,182 INFO L899 garLoopResultBuilder]: For program point L84-2(lines 84 93) no Hoare annotation was computed. [2023-12-16 17:53:07,182 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 80 98) the Hoare annotation is: true [2023-12-16 17:53:07,182 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 80 98) no Hoare annotation was computed. [2023-12-16 17:53:07,182 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 271 288) the Hoare annotation is: (let ((.cse23 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse25 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse24 (= (_ bv2 32) ~q_write_ev~0)) (.cse22 (= (_ bv2 32) ~q_read_ev~0))) (let ((.cse3 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse4 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse5 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse6 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse21 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))))) (.cse13 (not (= (_ bv2 32) |old(~q_read_ev~0)|))) (.cse14 (and .cse24 .cse22)) (.cse20 (not (= ~q_free~0 (_ bv0 32)))) (.cse17 (= ~c_dr_pc~0 (_ bv1 32))) (.cse18 (and .cse23 .cse25)) (.cse12 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse19 (not (= ~p_dw_pc~0 (_ bv1 32)))) (.cse0 (not (= ~c_dr_i~0 (_ bv1 32)))) (.cse1 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse15 (not (= (_ bv2 32) ~c_dr_st~0))) (.cse2 (not (= |old(~q_write_ev~0)| (_ bv2 32)))) (.cse16 (not (= ~p_num_write~0 ~c_num_read~0))) (.cse7 (not (= ~p_dw_st~0 (_ bv2 32)))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (and .cse24 .cse25)) (.cse10 (not (= ~q_free~0 (_ bv1 32)))) (.cse11 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse0 .cse1 .cse2 (not (= ~p_dw_st~0 (_ bv0 32))) .cse3 .cse4 .cse13 .cse5 .cse14 .cse6 .cse8 .cse10 .cse11) (or .cse0 .cse15 .cse16 .cse17 .cse18 .cse7 .cse8 .cse10 .cse11) (or .cse12 .cse0 .cse15 .cse2 .cse16 .cse13 .cse14 .cse7 .cse8 .cse10 .cse11) (or .cse0 .cse19 .cse15 .cse2 .cse13 .cse20 .cse14 .cse21 .cse7 .cse8) (or .cse12 .cse0 .cse15 .cse2 .cse13 .cse20 .cse14 .cse7 .cse8) (or .cse12 .cse0 .cse19 .cse15 .cse13 .cse20 (and .cse22 .cse23) .cse21 .cse7 .cse8) (or .cse0 .cse19 .cse15 .cse2 .cse16 .cse13 .cse14 .cse7 .cse8 .cse10 .cse11) (or .cse0 .cse15 .cse20 .cse17 .cse18 .cse7 .cse8) (or .cse12 .cse0 .cse19 .cse15 .cse2 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse15 .cse2 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2023-12-16 17:53:07,182 INFO L899 garLoopResultBuilder]: For program point L280-1(lines 271 288) no Hoare annotation was computed. [2023-12-16 17:53:07,182 INFO L899 garLoopResultBuilder]: For program point L275-1(lines 274 287) no Hoare annotation was computed. [2023-12-16 17:53:07,183 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 271 288) no Hoare annotation was computed. [2023-12-16 17:53:07,183 INFO L899 garLoopResultBuilder]: For program point L35-2(lines 34 49) no Hoare annotation was computed. [2023-12-16 17:53:07,183 INFO L899 garLoopResultBuilder]: For program point L222-1(lines 218 232) no Hoare annotation was computed. [2023-12-16 17:53:07,183 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 218 232) no Hoare annotation was computed. [2023-12-16 17:53:07,183 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 218 232) the Hoare annotation is: (let ((.cse20 (= ~q_req_up~0 (_ bv0 32))) (.cse18 (= (_ bv2 32) ~q_write_ev~0)) (.cse26 (= (_ bv2 32) ~q_read_ev~0)) (.cse28 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse27 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse19 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (let ((.cse21 (and .cse28 .cse27 .cse19)) (.cse23 (= ~c_dr_pc~0 (_ bv1 32))) (.cse12 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse13 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse14 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse15 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse24 (and .cse18 .cse26 .cse28)) (.cse17 (not (= ~p_dw_pc~0 (_ bv1 32)))) (.cse25 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))))) (.cse4 (and .cse18 .cse26 .cse20)) (.cse5 (not (= |old(~q_req_up~0)| (_ bv0 32)))) (.cse6 (not (= (_ bv2 32) |old(~q_read_ev~0)|))) (.cse22 (not (= ~q_free~0 (_ bv0 32)))) (.cse0 (not (= ~c_dr_i~0 (_ bv1 32)))) (.cse11 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse1 (not (= (_ bv2 32) ~c_dr_st~0))) (.cse2 (not (= |old(~q_write_ev~0)| (_ bv2 32)))) (.cse3 (not (= ~p_num_write~0 ~c_num_read~0))) (.cse7 (not (= ~p_dw_st~0 (_ bv2 32)))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse16 (and .cse18 .cse19)) (.cse9 (not (= ~q_free~0 (_ bv1 32)))) (.cse10 (not (= ~p_last_write~0 ~c_last_read~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse2 .cse12 .cse13 .cse14 .cse15 .cse7 .cse8 .cse16 .cse9 .cse10) (or .cse0 .cse17 .cse1 .cse2 (and .cse18 .cse19 .cse20) .cse3 .cse5 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse21 .cse22 .cse23 .cse7 .cse8) (or .cse0 .cse1 .cse21 .cse3 .cse23 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse2 (not (= ~p_dw_st~0 (_ bv0 32))) .cse12 .cse13 .cse4 .cse5 .cse6 .cse14 .cse15 .cse8 .cse9 .cse10) (or .cse0 .cse17 .cse1 .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse17 .cse1 .cse2 .cse24 .cse6 .cse22 .cse25 .cse7 .cse8) (or .cse0 .cse17 .cse1 .cse5 .cse6 .cse22 (and .cse26 .cse27 .cse20) .cse25 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse22 .cse7 .cse8) (or .cse0 .cse11 .cse1 .cse2 .cse3 .cse7 .cse8 .cse16 .cse9 .cse10)))) [2023-12-16 17:53:07,183 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 40 44) no Hoare annotation was computed. [2023-12-16 17:53:07,183 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 39) no Hoare annotation was computed. [2023-12-16 17:53:07,183 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 289 306) no Hoare annotation was computed. [2023-12-16 17:53:07,183 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 289 306) the Hoare annotation is: (let ((.cse25 (= ~p_last_write~0 ~q_buf_0~0)) (.cse28 (= ~p_dw_st~0 (_ bv2 32))) (.cse32 (= ~c_dr_i~0 (_ bv1 32))) (.cse30 (= ~p_last_write~0 ~c_last_read~0)) (.cse31 (= ~q_free~0 (_ bv1 32))) (.cse33 (= ~p_num_write~0 ~c_num_read~0)) (.cse27 (= |old(~q_write_ev~0)| (_ bv2 32))) (.cse24 (= |old(~q_write_ev~0)| ~q_write_ev~0)) (.cse29 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse26 (= (_ bv2 32) ~q_write_ev~0)) (.cse23 (= (_ bv2 32) ~q_read_ev~0))) (let ((.cse4 (not (= ~c_num_read~0 (_ bv0 32)))) (.cse5 (not (= ~p_num_write~0 (_ bv0 32)))) (.cse6 (not (= ~c_dr_pc~0 (_ bv0 32)))) (.cse15 (and .cse26 .cse23)) (.cse18 (= ~c_dr_pc~0 (_ bv1 32))) (.cse19 (and .cse24 .cse29)) (.cse12 (not (= ~q_req_up~0 (_ bv0 32)))) (.cse1 (not (= ~p_dw_pc~0 (_ bv0 32)))) (.cse9 (and .cse26 .cse29)) (.cse16 (not (= (_ bv2 32) ~c_dr_st~0))) (.cse2 (not .cse27)) (.cse13 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse17 (not .cse33)) (.cse35 (= (_ bv1 32) ~q_read_ev~0)) (.cse34 (not (= |old(~q_read_ev~0)| (_ bv1 32)))) (.cse10 (not .cse31)) (.cse11 (not .cse30)) (.cse0 (not .cse32)) (.cse20 (not (= ~p_dw_pc~0 (_ bv1 32)))) (.cse3 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse14 (not (= (_ bv2 32) |old(~q_read_ev~0)|))) (.cse21 (not (= ~q_free~0 (_ bv0 32)))) (.cse22 (not (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))))) (.cse7 (not .cse28)) (.cse8 (not .cse25))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse15 .cse6 .cse8 .cse10 .cse11) (or .cse0 .cse16 .cse17 .cse18 .cse19 .cse7 .cse8 .cse10 .cse11) (or .cse12 .cse0 .cse16 .cse2 .cse17 .cse14 .cse15 .cse7 .cse8 .cse10 .cse11) (or .cse0 .cse20 .cse16 .cse2 .cse14 .cse21 .cse15 .cse22 .cse7 .cse8) (or .cse0 .cse16 .cse13 .cse17 .cse18 .cse19 .cse8 .cse10 .cse11) (or .cse12 .cse0 .cse16 .cse2 .cse14 .cse21 .cse15 .cse7 .cse8) (or .cse12 .cse0 .cse20 .cse16 .cse14 .cse21 (and .cse23 .cse24) .cse22 .cse7 .cse8) (or .cse0 .cse20 .cse16 .cse2 .cse17 .cse14 .cse15 .cse7 .cse8 .cse10 .cse11) (or .cse0 .cse16 .cse13 .cse21 .cse18 .cse19 .cse8) (or .cse0 .cse16 .cse21 .cse18 .cse19 .cse7 .cse8) (or .cse12 .cse0 .cse20 .cse16 .cse2 .cse17 (and .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) .cse7 .cse8 .cse10 .cse11) (or .cse12 .cse0 .cse16 .cse2 .cse17 .cse34 (and .cse25 .cse26 .cse27 .cse28 .cse30 .cse31 .cse32 .cse33 .cse35) .cse7 .cse8 .cse10 .cse11) (or .cse0 .cse1 .cse16 .cse2 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse20 .cse16 .cse2 .cse13 .cse17 (and .cse24 .cse35) .cse34 .cse8 .cse10 .cse11) (or .cse0 .cse20 .cse3 .cse14 .cse21 .cse22 (and .cse29 (= (_ bv1 32) ~q_write_ev~0)) (not (= |old(~q_write_ev~0)| (_ bv1 32))) .cse7 .cse8)))) [2023-12-16 17:53:07,183 INFO L899 garLoopResultBuilder]: For program point L298-1(lines 289 306) no Hoare annotation was computed. [2023-12-16 17:53:07,183 INFO L899 garLoopResultBuilder]: For program point L293-1(lines 292 305) no Hoare annotation was computed. [2023-12-16 17:53:07,184 INFO L895 garLoopResultBuilder]: At program point L415(line 415) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~q_write_ev~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~p_last_write~0 ~c_last_read~0)) (.cse5 (= ~c_dr_pc~0 (_ bv0 32))) (.cse6 (= ~q_free~0 (_ bv1 32))) (.cse7 (= ~c_dr_i~0 (_ bv1 32))) (.cse8 (= ~c_dr_st~0 (_ bv0 32))) (.cse9 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~p_dw_st~0 (_ bv2 32)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= (_ bv2 32) ~q_read_ev~0) .cse2 .cse3 .cse4 (= ~p_dw_st~0 (_ bv0 32)) .cse5 (= ~q_req_up~0 (_ bv0 32)) .cse6 .cse7 .cse8 .cse9))) [2023-12-16 17:53:07,184 INFO L899 garLoopResultBuilder]: For program point L349(lines 339 379) no Hoare annotation was computed. [2023-12-16 17:53:07,184 INFO L899 garLoopResultBuilder]: For program point L242-1(lines 233 250) no Hoare annotation was computed. [2023-12-16 17:53:07,184 INFO L895 garLoopResultBuilder]: At program point L432(line 432) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 (_ bv0 32))) (.cse17 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse15 (= ~p_dw_st~0 (_ bv0 32))) (.cse16 (= (_ bv1 32) ~q_read_ev~0)) (.cse9 (= (_ bv2 32) ~q_write_ev~0)) (.cse10 (= ~p_last_write~0 ~c_last_read~0)) (.cse6 (= ~q_req_up~0 (_ bv0 32))) (.cse11 (= ~q_free~0 (_ bv1 32))) (.cse7 (= (_ bv2 32) ~c_dr_st~0)) (.cse12 (= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= ~p_dw_pc~0 (_ bv1 32))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= (_ bv2 32) ~q_read_ev~0)) (.cse3 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse5 (= ~p_dw_st~0 (_ bv2 32))) (.cse8 (= ~c_dr_i~0 (_ bv1 32))) (.cse14 (= ~c_dr_st~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse5 .cse10 .cse11 .cse7 .cse8 .cse12 .cse13) (and .cse1 .cse9 (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) .cse5 .cse10 (= ~c_dr_pc~0 (_ bv0 32)) .cse11 .cse8 .cse14 .cse13) (and .cse0 .cse1 .cse9 .cse10 .cse15 .cse11 .cse7 .cse8 .cse12 .cse16) (and .cse1 .cse9 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse17 .cse5 .cse10 .cse11 .cse7 .cse8 .cse12) (and .cse1 .cse17 .cse4 .cse5 .cse7 .cse8) (and .cse1 .cse17 .cse10 .cse15 .cse11 .cse7 .cse8 .cse12) (and .cse0 .cse1 .cse9 .cse2 .cse5 .cse10 .cse11 .cse7 .cse8 .cse12) (and .cse1 .cse9 .cse2 .cse5 .cse10 .cse6 .cse11 .cse7 .cse8 .cse12) (and .cse1 .cse17 .cse4 .cse15 .cse7 .cse8) (and .cse1 .cse9 .cse5 .cse10 .cse6 .cse11 .cse7 .cse8 .cse12 .cse16) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse5 .cse10 .cse6 .cse11 .cse7 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (_ bv1 32) ~q_write_ev~0) .cse8 .cse14))) [2023-12-16 17:53:07,184 INFO L899 garLoopResultBuilder]: For program point do_write_p_returnLabel#1(lines 124 163) no Hoare annotation was computed. [2023-12-16 17:53:07,184 INFO L899 garLoopResultBuilder]: For program point start_simulation_returnLabel#1(lines 405 447) no Hoare annotation was computed. [2023-12-16 17:53:07,184 INFO L899 garLoopResultBuilder]: For program point L342(line 342) no Hoare annotation was computed. [2023-12-16 17:53:07,184 INFO L899 garLoopResultBuilder]: For program point L433(line 433) no Hoare annotation was computed. [2023-12-16 17:53:07,184 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 177) no Hoare annotation was computed. [2023-12-16 17:53:07,184 INFO L895 garLoopResultBuilder]: At program point L392(line 392) the Hoare annotation is: (let ((.cse14 (= ~p_dw_pc~0 (_ bv0 32))) (.cse15 (= ~c_dr_st~0 (_ bv0 32))) (.cse16 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse11 (= ~p_dw_st~0 (_ bv0 32))) (.cse2 (= (_ bv2 32) ~q_read_ev~0)) (.cse3 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse0 (= ~p_dw_pc~0 (_ bv1 32))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (= (_ bv2 32) ~q_write_ev~0)) (.cse5 (= ~p_dw_st~0 (_ bv2 32))) (.cse10 (= ~p_last_write~0 ~c_last_read~0)) (.cse6 (= ~q_req_up~0 (_ bv0 32))) (.cse12 (= ~q_free~0 (_ bv1 32))) (.cse7 (= (_ bv2 32) ~c_dr_st~0)) (.cse8 (= ~c_dr_i~0 (_ bv1 32))) (.cse13 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse12 .cse7 .cse8 .cse13) (and .cse1 .cse9 .cse5 .cse10 .cse12 .cse7 .cse8 .cse13 .cse14) (and .cse1 .cse9 (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) .cse5 .cse10 (= ~c_dr_pc~0 (_ bv0 32)) .cse12 .cse8 .cse15 .cse14) (and .cse1 .cse9 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse8 .cse15) (and .cse1 .cse16 .cse5 .cse10 .cse12 .cse7 .cse8 .cse13) (and .cse1 .cse16 .cse4 .cse5 .cse7 .cse8) (and .cse1 .cse16 .cse10 .cse11 .cse12 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse9 .cse2 .cse5 .cse10 .cse12 .cse7 .cse8 .cse13) (and .cse1 .cse9 .cse2 .cse5 .cse10 .cse6 .cse12 .cse7 .cse8 .cse13) (and .cse1 .cse16 .cse4 .cse11 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse5 .cse10 .cse6 .cse12 .cse7 .cse8 .cse13))) [2023-12-16 17:53:07,184 INFO L899 garLoopResultBuilder]: For program point L392-1(line 392) no Hoare annotation was computed. [2023-12-16 17:53:07,184 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 136) no Hoare annotation was computed. [2023-12-16 17:53:07,184 INFO L899 garLoopResultBuilder]: For program point do_read_c_returnLabel#1(lines 165 217) no Hoare annotation was computed. [2023-12-16 17:53:07,184 INFO L899 garLoopResultBuilder]: For program point L401(lines 390 403) no Hoare annotation was computed. [2023-12-16 17:53:07,184 INFO L899 garLoopResultBuilder]: For program point L368(lines 368 375) no Hoare annotation was computed. [2023-12-16 17:53:07,185 INFO L895 garLoopResultBuilder]: At program point L203(line 203) the Hoare annotation is: false [2023-12-16 17:53:07,185 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 17:53:07,185 INFO L899 garLoopResultBuilder]: For program point L344(lines 344 348) no Hoare annotation was computed. [2023-12-16 17:53:07,185 INFO L899 garLoopResultBuilder]: For program point L344-1(lines 339 379) no Hoare annotation was computed. [2023-12-16 17:53:07,185 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 241) no Hoare annotation was computed. [2023-12-16 17:53:07,185 INFO L899 garLoopResultBuilder]: For program point L237-2(lines 236 249) no Hoare annotation was computed. [2023-12-16 17:53:07,185 INFO L895 garLoopResultBuilder]: At program point L427(line 427) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 (_ bv0 32))) (.cse14 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse2 (= (_ bv2 32) ~q_read_ev~0)) (.cse3 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse0 (= ~p_dw_pc~0 (_ bv1 32))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (= (_ bv2 32) ~q_write_ev~0)) (.cse5 (= ~p_dw_st~0 (_ bv2 32))) (.cse10 (= ~p_last_write~0 ~c_last_read~0)) (.cse6 (= ~q_req_up~0 (_ bv0 32))) (.cse11 (= ~q_free~0 (_ bv1 32))) (.cse7 (= (_ bv2 32) ~c_dr_st~0)) (.cse8 (= ~c_dr_i~0 (_ bv1 32))) (.cse12 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse5 .cse10 .cse11 .cse7 .cse8 .cse12 .cse13) (and .cse1 .cse9 (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) .cse5 .cse10 (= ~c_dr_pc~0 (_ bv0 32)) .cse11 .cse8 (= ~c_dr_st~0 (_ bv0 32)) .cse13) (and .cse1 .cse9 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse14 .cse5 .cse10 .cse11 .cse7 .cse8 .cse12) (and .cse1 .cse14 .cse4 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse5 .cse10 .cse11 .cse7 .cse8 .cse12) (and .cse1 .cse9 .cse2 .cse5 .cse10 .cse6 .cse11 .cse7 .cse8 .cse12) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse5 .cse10 .cse6 .cse11 .cse7 .cse8 .cse12))) [2023-12-16 17:53:07,185 INFO L899 garLoopResultBuilder]: For program point L427-1(line 427) no Hoare annotation was computed. [2023-12-16 17:53:07,185 INFO L899 garLoopResultBuilder]: For program point L394(lines 394 399) no Hoare annotation was computed. [2023-12-16 17:53:07,185 INFO L895 garLoopResultBuilder]: At program point L419-1(lines 419 441) the Hoare annotation is: (let ((.cse19 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse3 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse0 (= ~p_dw_pc~0 (_ bv1 32))) (.cse5 (= ~p_dw_st~0 (_ bv2 32))) (.cse7 (= (_ bv2 32) ~c_dr_st~0)) (.cse13 (= ~p_num_write~0 ~c_num_read~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (= (_ bv2 32) ~q_write_ev~0)) (.cse2 (= (_ bv2 32) ~q_read_ev~0)) (.cse15 (= ~c_num_read~0 (_ bv0 32))) (.cse16 (= ~p_num_write~0 (_ bv0 32))) (.cse10 (= ~p_last_write~0 ~c_last_read~0)) (.cse11 (= ~p_dw_st~0 (_ bv0 32))) (.cse17 (= ~c_dr_pc~0 (_ bv0 32))) (.cse6 (= ~q_req_up~0 (_ bv0 32))) (.cse12 (= ~q_free~0 (_ bv1 32))) (.cse8 (= ~c_dr_i~0 (_ bv1 32))) (.cse18 (= ~c_dr_st~0 (_ bv0 32))) (.cse14 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse12 .cse7 .cse8 .cse13) (and .cse1 .cse9 .cse5 .cse10 .cse12 .cse7 .cse8 .cse13 .cse14) (and .cse1 .cse9 .cse15 .cse16 .cse5 .cse10 .cse17 .cse12 .cse8 .cse18 .cse14) (and .cse1 .cse9 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse8 .cse18) (and .cse1 .cse19 .cse5 .cse10 .cse12 .cse7 .cse8 .cse13) (and .cse1 .cse19 .cse4 .cse5 .cse7 .cse8) (and .cse1 .cse19 .cse10 .cse11 .cse12 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse9 .cse2 .cse5 .cse10 .cse12 .cse7 .cse8 .cse13) (and .cse1 .cse9 .cse2 .cse5 .cse10 .cse6 .cse12 .cse7 .cse8 .cse13) (and .cse1 .cse19 .cse4 .cse11 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse5 .cse10 .cse6 .cse12 .cse7 .cse8 .cse13) (and .cse1 .cse9 .cse2 .cse15 .cse16 .cse10 .cse11 .cse17 .cse6 .cse12 .cse8 .cse18 .cse14))) [2023-12-16 17:53:07,185 INFO L899 garLoopResultBuilder]: For program point L353(lines 353 360) no Hoare annotation was computed. [2023-12-16 17:53:07,185 INFO L899 garLoopResultBuilder]: For program point eval_returnLabel#1(lines 332 385) no Hoare annotation was computed. [2023-12-16 17:53:07,185 INFO L899 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2023-12-16 17:53:07,185 INFO L899 garLoopResultBuilder]: For program point L172(lines 172 176) no Hoare annotation was computed. [2023-12-16 17:53:07,185 INFO L895 garLoopResultBuilder]: At program point L139-1(lines 139 157) the Hoare annotation is: (let ((.cse7 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse10 (= ~q_req_up~0 (_ bv0 32))) (.cse8 (= ~q_free~0 (_ bv1 32))) (.cse5 (= (_ bv2 32) ~c_dr_st~0)) (.cse9 (= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv1 32) |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse2 (= (_ bv2 32) ~q_write_ev~0)) (.cse3 (= (_ bv2 32) ~q_read_ev~0)) (.cse11 (= ~c_num_read~0 (_ bv0 32))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse12 (= ~c_dr_pc~0 (_ bv0 32))) (.cse6 (= ~c_dr_i~0 (_ bv1 32))) (.cse13 (= ~c_dr_st~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse5 .cse6 .cse9) (and .cse0 .cse1 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse11 (= ~p_num_write~0 (_ bv0 32)) .cse12 .cse10 .cse8 .cse6 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6 .cse9) (and .cse0 .cse1 .cse2 (= ~p_num_write~0 (_ bv1 32)) .cse3 .cse11 .cse4 .cse12 .cse6 .cse13))) [2023-12-16 17:53:07,186 INFO L899 garLoopResultBuilder]: For program point L131(lines 131 135) no Hoare annotation was computed. [2023-12-16 17:53:07,186 INFO L895 garLoopResultBuilder]: At program point L412(line 412) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= (_ bv2 32) ~q_write_ev~0) (= (_ bv2 32) ~q_read_ev~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= ~c_dr_pc~0 (_ bv0 32)) (= ~q_req_up~0 (_ bv0 32)) (= ~q_free~0 (_ bv1 32)) (= ~c_dr_i~0 (_ bv1 32)) (= ~c_dr_st~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2023-12-16 17:53:07,186 INFO L899 garLoopResultBuilder]: For program point L412-1(line 412) no Hoare annotation was computed. [2023-12-16 17:53:07,186 INFO L899 garLoopResultBuilder]: For program point L181(lines 180 211) no Hoare annotation was computed. [2023-12-16 17:53:07,186 INFO L899 garLoopResultBuilder]: For program point L140(lines 139 157) no Hoare annotation was computed. [2023-12-16 17:53:07,186 INFO L899 garLoopResultBuilder]: For program point L198(lines 198 210) no Hoare annotation was computed. [2023-12-16 17:53:07,186 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 17:53:07,186 INFO L899 garLoopResultBuilder]: For program point L182-1(lines 182 192) no Hoare annotation was computed. [2023-12-16 17:53:07,186 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 149) no Hoare annotation was computed. [2023-12-16 17:53:07,186 INFO L895 garLoopResultBuilder]: At program point L364(lines 339 379) the Hoare annotation is: (let ((.cse19 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse3 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse0 (= ~p_dw_pc~0 (_ bv1 32))) (.cse5 (= ~p_dw_st~0 (_ bv2 32))) (.cse7 (= (_ bv2 32) ~c_dr_st~0)) (.cse13 (= ~p_num_write~0 ~c_num_read~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (= (_ bv2 32) ~q_write_ev~0)) (.cse2 (= (_ bv2 32) ~q_read_ev~0)) (.cse15 (= ~c_num_read~0 (_ bv0 32))) (.cse16 (= ~p_num_write~0 (_ bv0 32))) (.cse10 (= ~p_last_write~0 ~c_last_read~0)) (.cse11 (= ~p_dw_st~0 (_ bv0 32))) (.cse17 (= ~c_dr_pc~0 (_ bv0 32))) (.cse6 (= ~q_req_up~0 (_ bv0 32))) (.cse12 (= ~q_free~0 (_ bv1 32))) (.cse8 (= ~c_dr_i~0 (_ bv1 32))) (.cse18 (= ~c_dr_st~0 (_ bv0 32))) (.cse14 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse12 .cse7 .cse8 .cse13) (and .cse1 .cse9 .cse5 .cse10 .cse12 .cse7 .cse8 .cse13 .cse14) (and .cse1 (= (_ bv1 32) |ULTIMATE.start_eval_~tmp___1~0#1|) .cse9 .cse2 .cse10 .cse11 .cse6 .cse12 .cse7 .cse8 .cse13 .cse14) (and .cse1 .cse9 .cse15 .cse16 .cse5 .cse10 .cse17 .cse12 .cse8 .cse18 .cse14) (and .cse1 .cse9 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse8 .cse18) (and .cse1 .cse19 .cse5 .cse10 .cse12 .cse7 .cse8 .cse13) (and .cse1 .cse19 .cse4 .cse5 .cse7 .cse8) (and .cse1 .cse19 .cse10 .cse11 .cse12 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse9 .cse2 .cse5 .cse10 .cse12 .cse7 .cse8 .cse13) (and .cse1 .cse9 .cse2 .cse5 .cse10 .cse6 .cse12 .cse7 .cse8 .cse13) (and .cse1 .cse19 .cse4 .cse11 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse5 .cse10 .cse6 .cse12 .cse7 .cse8 .cse13) (and .cse1 .cse9 .cse2 .cse15 .cse16 .cse10 .cse11 .cse17 .cse6 .cse12 .cse8 .cse18 .cse14))) [2023-12-16 17:53:07,186 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2023-12-16 17:53:07,186 INFO L895 garLoopResultBuilder]: At program point L414(line 414) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~q_write_ev~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~p_last_write~0 ~c_last_read~0)) (.cse5 (= ~c_dr_pc~0 (_ bv0 32))) (.cse6 (= ~q_free~0 (_ bv1 32))) (.cse7 (= ~c_dr_i~0 (_ bv1 32))) (.cse8 (= ~c_dr_st~0 (_ bv0 32))) (.cse9 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~p_dw_st~0 (_ bv2 32)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= (_ bv2 32) ~q_read_ev~0) .cse2 .cse3 .cse4 (= ~p_dw_st~0 (_ bv0 32)) .cse5 (= ~q_req_up~0 (_ bv0 32)) .cse6 .cse7 .cse8 .cse9))) [2023-12-16 17:53:07,187 INFO L895 garLoopResultBuilder]: At program point L414-1(line 414) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= (_ bv2 32) ~q_write_ev~0)) (.cse2 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~p_last_write~0 ~c_last_read~0)) (.cse5 (= ~c_dr_pc~0 (_ bv0 32))) (.cse6 (= ~q_free~0 (_ bv1 32))) (.cse7 (= ~c_dr_i~0 (_ bv1 32))) (.cse8 (= ~c_dr_st~0 (_ bv0 32))) (.cse9 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~p_dw_st~0 (_ bv2 32)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= (_ bv2 32) ~q_read_ev~0) .cse2 .cse3 .cse4 (= ~p_dw_st~0 (_ bv0 32)) .cse5 (= ~q_req_up~0 (_ bv0 32)) .cse6 .cse7 .cse8 .cse9))) [2023-12-16 17:53:07,187 INFO L895 garLoopResultBuilder]: At program point L340(line 340) the Hoare annotation is: (let ((.cse19 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse3 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse0 (= ~p_dw_pc~0 (_ bv1 32))) (.cse5 (= ~p_dw_st~0 (_ bv2 32))) (.cse7 (= (_ bv2 32) ~c_dr_st~0)) (.cse13 (= ~p_num_write~0 ~c_num_read~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (= (_ bv2 32) ~q_write_ev~0)) (.cse2 (= (_ bv2 32) ~q_read_ev~0)) (.cse15 (= ~c_num_read~0 (_ bv0 32))) (.cse16 (= ~p_num_write~0 (_ bv0 32))) (.cse10 (= ~p_last_write~0 ~c_last_read~0)) (.cse11 (= ~p_dw_st~0 (_ bv0 32))) (.cse17 (= ~c_dr_pc~0 (_ bv0 32))) (.cse6 (= ~q_req_up~0 (_ bv0 32))) (.cse12 (= ~q_free~0 (_ bv1 32))) (.cse8 (= ~c_dr_i~0 (_ bv1 32))) (.cse18 (= ~c_dr_st~0 (_ bv0 32))) (.cse14 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse12 .cse7 .cse8 .cse13) (and .cse1 .cse9 .cse5 .cse10 .cse12 .cse7 .cse8 .cse13 .cse14) (and .cse1 (= (_ bv1 32) |ULTIMATE.start_eval_~tmp___1~0#1|) .cse9 .cse2 .cse10 .cse11 .cse6 .cse12 .cse7 .cse8 .cse13 .cse14) (and .cse1 .cse9 .cse15 .cse16 .cse5 .cse10 .cse17 .cse12 .cse8 .cse18 .cse14) (and .cse1 .cse9 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse8 .cse18) (and .cse1 .cse19 .cse5 .cse10 .cse12 .cse7 .cse8 .cse13) (and .cse1 .cse19 .cse4 .cse5 .cse7 .cse8) (and .cse1 .cse19 .cse10 .cse11 .cse12 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse9 .cse2 .cse5 .cse10 .cse12 .cse7 .cse8 .cse13) (and .cse1 .cse9 .cse2 .cse5 .cse10 .cse6 .cse12 .cse7 .cse8 .cse13) (and .cse1 .cse19 .cse4 .cse11 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse5 .cse10 .cse6 .cse12 .cse7 .cse8 .cse13) (and .cse1 .cse9 .cse2 .cse15 .cse16 .cse10 .cse11 .cse17 .cse6 .cse12 .cse8 .cse18 .cse14))) [2023-12-16 17:53:07,187 INFO L895 garLoopResultBuilder]: At program point L208(line 208) the Hoare annotation is: false [2023-12-16 17:53:07,187 INFO L895 garLoopResultBuilder]: At program point L208-1(lines 180 211) the Hoare annotation is: (let ((.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse11 (= ~q_req_up~0 (_ bv0 32))) (.cse7 (= ~q_free~0 (_ bv1 32))) (.cse9 (= ~p_num_write~0 ~c_num_read~0)) (.cse10 (= ~p_dw_pc~0 (_ bv0 32))) (.cse0 (= ~p_dw_pc~0 (_ bv1 32))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= (_ bv1 32) |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse3 (= (_ bv2 32) ~q_write_ev~0)) (.cse4 (= (_ bv2 32) ~q_read_ev~0)) (.cse12 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse5 (= ~p_dw_st~0 (_ bv2 32))) (.cse8 (= ~c_dr_i~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse11 .cse7 .cse8 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse12 .cse6 (= ~p_dw_st~0 (_ bv0 32)) .cse11 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) (= ~q_free~0 (_ bv0 32)) .cse5 .cse8))) [2023-12-16 17:53:07,187 INFO L895 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 (_ bv0 32))) (.cse14 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse2 (= (_ bv2 32) ~q_read_ev~0)) (.cse3 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse0 (= ~p_dw_pc~0 (_ bv1 32))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (= (_ bv2 32) ~q_write_ev~0)) (.cse5 (= ~p_dw_st~0 (_ bv2 32))) (.cse10 (= ~p_last_write~0 ~c_last_read~0)) (.cse6 (= ~q_req_up~0 (_ bv0 32))) (.cse11 (= ~q_free~0 (_ bv1 32))) (.cse7 (= (_ bv2 32) ~c_dr_st~0)) (.cse8 (= ~c_dr_i~0 (_ bv1 32))) (.cse12 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse5 .cse10 .cse11 .cse7 .cse8 .cse12 .cse13) (and .cse1 .cse9 (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) .cse5 .cse10 (= ~c_dr_pc~0 (_ bv0 32)) .cse11 .cse8 (= ~c_dr_st~0 (_ bv0 32)) .cse13) (and .cse1 .cse9 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse14 .cse5 .cse10 .cse11 .cse7 .cse8 .cse12) (and .cse1 .cse14 .cse4 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse5 .cse10 .cse11 .cse7 .cse8 .cse12) (and .cse1 .cse9 .cse2 .cse5 .cse10 .cse6 .cse11 .cse7 .cse8 .cse12) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse5 .cse10 .cse6 .cse11 .cse7 .cse8 .cse12))) [2023-12-16 17:53:07,187 INFO L895 garLoopResultBuilder]: At program point L431-1(line 431) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 (_ bv0 32))) (.cse14 (not (= ~c_dr_pc~0 (_ bv1 32)))) (.cse2 (= (_ bv2 32) ~q_read_ev~0)) (.cse3 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32)))) (.cse4 (= ~q_free~0 (_ bv0 32))) (.cse0 (= ~p_dw_pc~0 (_ bv1 32))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (= (_ bv2 32) ~q_write_ev~0)) (.cse5 (= ~p_dw_st~0 (_ bv2 32))) (.cse10 (= ~p_last_write~0 ~c_last_read~0)) (.cse6 (= ~q_req_up~0 (_ bv0 32))) (.cse11 (= ~q_free~0 (_ bv1 32))) (.cse7 (= (_ bv2 32) ~c_dr_st~0)) (.cse8 (= ~c_dr_i~0 (_ bv1 32))) (.cse12 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse5 .cse10 .cse11 .cse7 .cse8 .cse12 .cse13) (and .cse1 .cse9 (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) .cse5 .cse10 (= ~c_dr_pc~0 (_ bv0 32)) .cse11 .cse8 (= ~c_dr_st~0 (_ bv0 32)) .cse13) (and .cse1 .cse9 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse14 .cse5 .cse10 .cse11 .cse7 .cse8 .cse12) (and .cse1 .cse14 .cse4 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse5 .cse10 .cse11 .cse7 .cse8 .cse12) (and .cse1 .cse9 .cse2 .cse5 .cse10 .cse6 .cse11 .cse7 .cse8 .cse12) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse5 .cse10 .cse6 .cse11 .cse7 .cse8 .cse12))) [2023-12-16 17:53:07,187 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 74) no Hoare annotation was computed. [2023-12-16 17:53:07,187 INFO L899 garLoopResultBuilder]: For program point L65-2(lines 65 74) no Hoare annotation was computed. [2023-12-16 17:53:07,187 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 61 79) no Hoare annotation was computed. [2023-12-16 17:53:07,187 INFO L899 garLoopResultBuilder]: For program point L76(lines 64 78) no Hoare annotation was computed. [2023-12-16 17:53:07,187 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 61 79) the Hoare annotation is: true [2023-12-16 17:53:07,187 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 71) no Hoare annotation was computed. [2023-12-16 17:53:07,187 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2023-12-16 17:53:07,188 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 16 23) the Hoare annotation is: true [2023-12-16 17:53:07,188 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2023-12-16 17:53:07,190 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] [2023-12-16 17:53:07,191 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 17:53:07,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 05:53:07 BoogieIcfgContainer [2023-12-16 17:53:07,209 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 17:53:07,210 INFO L158 Benchmark]: Toolchain (without parser) took 35162.13ms. Allocated memory was 290.5MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 238.5MB in the beginning and 907.3MB in the end (delta: -668.8MB). Peak memory consumption was 935.4MB. Max. memory is 8.0GB. [2023-12-16 17:53:07,210 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 165.7MB. Free memory was 114.2MB in the beginning and 114.0MB in the end (delta: 180.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 17:53:07,210 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.67ms. Allocated memory is still 290.5MB. Free memory was 238.5MB in the beginning and 224.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 17:53:07,210 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.70ms. Allocated memory is still 290.5MB. Free memory was 224.9MB in the beginning and 222.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 17:53:07,210 INFO L158 Benchmark]: Boogie Preprocessor took 31.35ms. Allocated memory is still 290.5MB. Free memory was 222.8MB in the beginning and 220.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 17:53:07,210 INFO L158 Benchmark]: RCFGBuilder took 492.45ms. Allocated memory is still 290.5MB. Free memory was 220.1MB in the beginning and 196.5MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-16 17:53:07,210 INFO L158 Benchmark]: TraceAbstraction took 34360.55ms. Allocated memory was 290.5MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 196.0MB in the beginning and 907.3MB in the end (delta: -711.2MB). Peak memory consumption was 893.5MB. Max. memory is 8.0GB. [2023-12-16 17:53:07,211 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.12ms. Allocated memory is still 165.7MB. Free memory was 114.2MB in the beginning and 114.0MB in the end (delta: 180.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 236.67ms. Allocated memory is still 290.5MB. Free memory was 238.5MB in the beginning and 224.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.70ms. Allocated memory is still 290.5MB. Free memory was 224.9MB in the beginning and 222.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.35ms. Allocated memory is still 290.5MB. Free memory was 222.8MB in the beginning and 220.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 492.45ms. Allocated memory is still 290.5MB. Free memory was 220.1MB in the beginning and 196.5MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 34360.55ms. Allocated memory was 290.5MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 196.0MB in the beginning and 907.3MB in the end (delta: -711.2MB). Peak memory consumption was 893.5MB. 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: 20]: 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 9 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.3s, OverallIterations: 21, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 18.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2426 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2386 mSDsluCounter, 6262 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3676 mSDsCounter, 298 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2009 IncrementalHoareTripleChecker+Invalid, 2307 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 298 mSolverCounterUnsat, 2586 mSDtfsCounter, 2009 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2314 GetRequests, 2253 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6742occurred in iteration=16, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 3874 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 6357 PreInvPairs, 6799 NumberOfFragments, 7224 HoareAnnotationTreeSize, 6357 FormulaSimplifications, 566 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 26 FormulaSimplificationsInter, 61558 FormulaSimplificationTreeSizeReductionInter, 16.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2250 NumberOfCodeBlocks, 2250 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2295 ConstructedInterpolants, 0 QuantifiedInterpolants, 4089 SizeOfPredicates, 7 NumberOfNonLiveVariables, 4285 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 1573/1577 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 1 specifications checked. All of them hold - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (q_free == 1)) && (c_dr_i == 1)) && (p_num_write == c_num_read)) || ((((((((p_last_write == q_buf_0) && (2 == q_write_ev)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (q_free == 1)) && (c_dr_i == 1)) && (p_num_write == c_num_read)) && (p_dw_pc == 0))) || (((((((((p_last_write == q_buf_0) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (q_req_up == 0)) && (q_free == 1)) && (c_dr_i == 1)) && (p_num_write == c_num_read))) || (((((((((((p_last_write == q_buf_0) && (2 == q_write_ev)) && (2 == q_read_ev)) && !((c_dr_pc == 1))) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (q_req_up == 0)) && (q_free == 1)) && (c_dr_i == 1)) && (p_num_write == c_num_read)) && (p_dw_pc == 0))) || (((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == q_write_ev)) && (2 == q_read_ev)) && !((c_dr_pc == 1))) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (q_free == 0)) && (p_dw_st == 2)) && (c_dr_i == 1))) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (((((((((((((p_last_write == q_buf_0) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (q_free == 0)) && (2 == c_dr_st)) && (c_dr_i == 1)) || ((((((p_last_write == q_buf_0) && !((c_dr_pc == 1))) && (q_free == 1)) && (2 == c_dr_st)) && (c_dr_i == 1)) && (p_num_write == c_num_read))) || (((((p_last_write == q_buf_0) && !((c_dr_pc == 1))) && (q_free == 0)) && (2 == c_dr_st)) && (c_dr_i == 1))) || (((((((p_last_write == q_buf_0) && (2 == q_write_ev)) && (2 == q_read_ev)) && (q_free == 0)) && (q_req_up == 0)) && (2 == c_dr_st)) && (c_dr_i == 1))) || ((((((((((p_last_write == q_buf_0) && (2 == q_write_ev)) && (2 == q_read_ev)) && (c_num_read == 0)) && (p_num_write == 0)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (q_free == 1)) && (c_dr_i == 1)) && (c_dr_st == 0))) || (((((((p_last_write == q_buf_0) && (2 == q_write_ev)) && (2 == q_read_ev)) && (q_free == 1)) && (2 == c_dr_st)) && (c_dr_i == 1)) && (p_num_write == c_num_read))) || (((((((((p_last_write == q_buf_0) && (2 == q_write_ev)) && (p_num_write == 1)) && (2 == q_read_ev)) && (c_num_read == 0)) && (q_free == 0)) && (c_dr_pc == 0)) && (c_dr_i == 1)) && (c_dr_st == 0))) - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == q_read_ev)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (q_free == 0)) && (p_dw_st == 2)) && (q_req_up == 0)) && (2 == c_dr_st)) && (c_dr_i == 1)) || ((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (q_free == 1)) && (2 == c_dr_st)) && (c_dr_i == 1)) && (p_num_write == c_num_read))) || (((((((((p_last_write == q_buf_0) && (2 == q_write_ev)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (q_free == 1)) && (2 == c_dr_st)) && (c_dr_i == 1)) && (p_num_write == c_num_read)) && (p_dw_pc == 0))) || (((((((((((p_last_write == q_buf_0) && (2 == q_write_ev)) && (c_num_read == 0)) && (p_num_write == 0)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (c_dr_pc == 0)) && (q_free == 1)) && (c_dr_i == 1)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((p_last_write == q_buf_0) && (2 == q_write_ev)) && (2 == q_read_ev)) && (q_free == 0)) && (p_dw_st == 2)) && (q_req_up == 0)) && (2 == c_dr_st)) && (c_dr_i == 1))) || (((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (q_free == 0)) && (p_dw_st == 2)) && (c_dr_i == 1)) && (c_dr_st == 0))) || ((((((((p_last_write == q_buf_0) && !((c_dr_pc == 1))) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (q_free == 1)) && (2 == c_dr_st)) && (c_dr_i == 1)) && (p_num_write == c_num_read))) || ((((((p_last_write == q_buf_0) && !((c_dr_pc == 1))) && (q_free == 0)) && (p_dw_st == 2)) && (2 == c_dr_st)) && (c_dr_i == 1))) || ((((((((p_last_write == q_buf_0) && !((c_dr_pc == 1))) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (q_free == 1)) && (2 == c_dr_st)) && (c_dr_i == 1)) && (p_num_write == c_num_read))) || ((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (q_free == 1)) && (2 == c_dr_st)) && (c_dr_i == 1)) && (p_num_write == c_num_read))) || ((((((((((p_last_write == q_buf_0) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (q_req_up == 0)) && (q_free == 1)) && (2 == c_dr_st)) && (c_dr_i == 1)) && (p_num_write == c_num_read))) || ((((((p_last_write == q_buf_0) && !((c_dr_pc == 1))) && (q_free == 0)) && (p_dw_st == 0)) && (2 == c_dr_st)) && (c_dr_i == 1))) || (((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (q_free == 0)) && (p_dw_st == 2)) && (2 == c_dr_st)) && (c_dr_i == 1))) || ((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == q_write_ev)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (q_req_up == 0)) && (q_free == 1)) && (2 == c_dr_st)) && (c_dr_i == 1)) && (p_num_write == c_num_read))) || (((((((((((((p_last_write == q_buf_0) && (2 == q_write_ev)) && (2 == q_read_ev)) && (c_num_read == 0)) && (p_num_write == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (q_free == 1)) && (c_dr_i == 1)) && (c_dr_st == 0)) && (p_dw_pc == 0))) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == q_read_ev)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (q_free == 0)) && (p_dw_st == 2)) && (q_req_up == 0)) && (2 == c_dr_st)) && (c_dr_i == 1)) || ((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (q_free == 1)) && (2 == c_dr_st)) && (c_dr_i == 1)) && (p_num_write == c_num_read))) || (((((((((p_last_write == q_buf_0) && (2 == q_write_ev)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (q_free == 1)) && (2 == c_dr_st)) && (c_dr_i == 1)) && (p_num_write == c_num_read)) && (p_dw_pc == 0))) || ((((((((((((p_last_write == q_buf_0) && (1 == tmp___1)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (q_req_up == 0)) && (q_free == 1)) && (2 == c_dr_st)) && (c_dr_i == 1)) && (p_num_write == c_num_read)) && (p_dw_pc == 0))) || (((((((((((p_last_write == q_buf_0) && (2 == q_write_ev)) && (c_num_read == 0)) && (p_num_write == 0)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (c_dr_pc == 0)) && (q_free == 1)) && (c_dr_i == 1)) && (c_dr_st == 0)) && (p_dw_pc == 0))) || ((((((((p_last_write == q_buf_0) && (2 == q_write_ev)) && (2 == q_read_ev)) && (q_free == 0)) && (p_dw_st == 2)) && (q_req_up == 0)) && (2 == c_dr_st)) && (c_dr_i == 1))) || (((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (q_free == 0)) && (p_dw_st == 2)) && (c_dr_i == 1)) && (c_dr_st == 0))) || ((((((((p_last_write == q_buf_0) && !((c_dr_pc == 1))) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (q_free == 1)) && (2 == c_dr_st)) && (c_dr_i == 1)) && (p_num_write == c_num_read))) || ((((((p_last_write == q_buf_0) && !((c_dr_pc == 1))) && (q_free == 0)) && (p_dw_st == 2)) && (2 == c_dr_st)) && (c_dr_i == 1))) || ((((((((p_last_write == q_buf_0) && !((c_dr_pc == 1))) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (q_free == 1)) && (2 == c_dr_st)) && (c_dr_i == 1)) && (p_num_write == c_num_read))) || ((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (q_free == 1)) && (2 == c_dr_st)) && (c_dr_i == 1)) && (p_num_write == c_num_read))) || ((((((((((p_last_write == q_buf_0) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (q_req_up == 0)) && (q_free == 1)) && (2 == c_dr_st)) && (c_dr_i == 1)) && (p_num_write == c_num_read))) || ((((((p_last_write == q_buf_0) && !((c_dr_pc == 1))) && (q_free == 0)) && (p_dw_st == 0)) && (2 == c_dr_st)) && (c_dr_i == 1))) || (((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == q_write_ev)) && (2 == q_read_ev)) && (p_num_write == ((c_num_read + 1) % 4294967296))) && (q_free == 0)) && (p_dw_st == 2)) && (2 == c_dr_st)) && (c_dr_i == 1))) || ((((((((((p_dw_pc == 1) && (p_last_write == q_buf_0)) && (2 == q_write_ev)) && (p_dw_st == 2)) && (p_last_write == c_last_read)) && (q_req_up == 0)) && (q_free == 1)) && (2 == c_dr_st)) && (c_dr_i == 1)) && (p_num_write == c_num_read))) || (((((((((((((p_last_write == q_buf_0) && (2 == q_write_ev)) && (2 == q_read_ev)) && (c_num_read == 0)) && (p_num_write == 0)) && (p_last_write == c_last_read)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (q_req_up == 0)) && (q_free == 1)) && (c_dr_i == 1)) && (c_dr_st == 0)) && (p_dw_pc == 0))) RESULT: Ultimate proved your program to be correct! [2023-12-16 17:53:07,235 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...