/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/mem_slave_tlm.1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 17:52:12,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 17:52:12,864 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:12,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 17:52:12,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 17:52:12,890 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 17:52:12,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 17:52:12,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 17:52:12,891 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 17:52:12,894 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 17:52:12,894 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 17:52:12,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 17:52:12,895 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 17:52:12,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 17:52:12,896 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 17:52:12,896 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 17:52:12,896 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 17:52:12,897 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 17:52:12,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 17:52:12,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 17:52:12,898 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 17:52:12,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 17:52:12,898 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 17:52:12,898 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 17:52:12,898 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 17:52:12,899 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 17:52:12,899 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 17:52:12,899 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 17:52:12,899 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 17:52:12,899 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 17:52:12,900 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 17:52:12,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 17:52:12,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 17:52:12,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 17:52:12,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 17:52:12,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 17:52:12,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 17:52:12,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 17:52:12,901 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 17:52:12,901 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 17:52:12,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 17:52:12,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 17:52:12,901 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 17:52:12,901 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 17:52:12,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 17:52:12,902 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 17:52:12,902 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:13,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 17:52:13,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 17:52:13,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 17:52:13,057 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 17:52:13,057 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 17:52:13,058 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/mem_slave_tlm.1.cil.c [2023-12-16 17:52:14,082 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 17:52:14,234 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 17:52:14,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/mem_slave_tlm.1.cil.c [2023-12-16 17:52:14,245 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab7222789/3adfe4645c78404cad7dfa302afd31f6/FLAG3b05576c7 [2023-12-16 17:52:14,255 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab7222789/3adfe4645c78404cad7dfa302afd31f6 [2023-12-16 17:52:14,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 17:52:14,258 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 17:52:14,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 17:52:14,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 17:52:14,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 17:52:14,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:52:14" (1/1) ... [2023-12-16 17:52:14,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3af9e4ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:14, skipping insertion in model container [2023-12-16 17:52:14,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:52:14" (1/1) ... [2023-12-16 17:52:14,298 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 17:52:14,409 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/mem_slave_tlm.1.cil.c[646,659] [2023-12-16 17:52:14,477 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 17:52:14,492 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 17:52:14,499 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/mem_slave_tlm.1.cil.c[646,659] [2023-12-16 17:52:14,554 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 17:52:14,565 INFO L206 MainTranslator]: Completed translation [2023-12-16 17:52:14,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:14 WrapperNode [2023-12-16 17:52:14,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 17:52:14,566 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 17:52:14,566 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 17:52:14,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 17:52:14,578 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:14" (1/1) ... [2023-12-16 17:52:14,593 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:14" (1/1) ... [2023-12-16 17:52:14,626 INFO L138 Inliner]: procedures = 19, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 844 [2023-12-16 17:52:14,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 17:52:14,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 17:52:14,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 17:52:14,627 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 17:52:14,639 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:14" (1/1) ... [2023-12-16 17:52:14,640 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:14" (1/1) ... [2023-12-16 17:52:14,643 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:14" (1/1) ... [2023-12-16 17:52:14,655 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:14,655 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:14" (1/1) ... [2023-12-16 17:52:14,655 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:14" (1/1) ... [2023-12-16 17:52:14,662 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:14" (1/1) ... [2023-12-16 17:52:14,670 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:14" (1/1) ... [2023-12-16 17:52:14,684 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:14" (1/1) ... [2023-12-16 17:52:14,686 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:14" (1/1) ... [2023-12-16 17:52:14,690 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 17:52:14,691 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 17:52:14,691 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 17:52:14,691 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 17:52:14,692 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:14" (1/1) ... [2023-12-16 17:52:14,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 17:52:14,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 17:52:14,740 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:14,778 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:14,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 17:52:14,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 17:52:14,785 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-16 17:52:14,787 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-16 17:52:14,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 17:52:14,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 17:52:14,853 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 17:52:14,854 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 17:52:15,509 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 17:52:15,559 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 17:52:15,559 INFO L309 CfgBuilder]: Removed 13 assume(true) statements. [2023-12-16 17:52:15,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:52:15 BoogieIcfgContainer [2023-12-16 17:52:15,560 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 17:52:15,561 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 17:52:15,561 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 17:52:15,564 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 17:52:15,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:52:14" (1/3) ... [2023-12-16 17:52:15,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc7deba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:52:15, skipping insertion in model container [2023-12-16 17:52:15,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:14" (2/3) ... [2023-12-16 17:52:15,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc7deba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:52:15, skipping insertion in model container [2023-12-16 17:52:15,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:52:15" (3/3) ... [2023-12-16 17:52:15,566 INFO L112 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2023-12-16 17:52:15,578 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 17:52:15,579 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 17:52:15,627 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 17:52:15,631 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;@2a4d0e50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 17:52:15,632 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 17:52:15,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 247 states, 239 states have (on average 1.9372384937238494) internal successors, (463), 245 states have internal predecessors, (463), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 17:52:15,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 17:52:15,645 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:15,645 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] [2023-12-16 17:52:15,646 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:15,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:15,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1942219643, now seen corresponding path program 1 times [2023-12-16 17:52:15,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:15,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330622399] [2023-12-16 17:52:15,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:15,659 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:15,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:15,661 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:15,681 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:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:15,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 17:52:15,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:15,750 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:15,750 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:15,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:15,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1330622399] [2023-12-16 17:52:15,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1330622399] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:15,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:15,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 17:52:15,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608931840] [2023-12-16 17:52:15,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:15,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 17:52:15,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:15,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 17:52:15,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 17:52:15,786 INFO L87 Difference]: Start difference. First operand has 247 states, 239 states have (on average 1.9372384937238494) internal successors, (463), 245 states have internal predecessors, (463), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:15,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:15,921 INFO L93 Difference]: Finished difference Result 474 states and 909 transitions. [2023-12-16 17:52:15,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 17:52:15,928 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-16 17:52:15,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:15,943 INFO L225 Difference]: With dead ends: 474 [2023-12-16 17:52:15,944 INFO L226 Difference]: Without dead ends: 244 [2023-12-16 17:52:15,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 17:52:15,954 INFO L413 NwaCegarLoop]: 419 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:15,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 419 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:52:15,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-12-16 17:52:15,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2023-12-16 17:52:15,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 238 states have (on average 1.8235294117647058) internal successors, (434), 242 states have internal predecessors, (434), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:15,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 439 transitions. [2023-12-16 17:52:15,991 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 439 transitions. Word has length 26 [2023-12-16 17:52:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:15,992 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 439 transitions. [2023-12-16 17:52:15,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:15,992 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 439 transitions. [2023-12-16 17:52:15,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-16 17:52:15,993 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:15,994 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] [2023-12-16 17:52:15,997 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:16,195 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:16,196 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:16,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:16,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1969188430, now seen corresponding path program 1 times [2023-12-16 17:52:16,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:16,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348144991] [2023-12-16 17:52:16,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:16,198 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:16,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:16,199 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:16,200 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:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:16,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 17:52:16,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:16,306 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:16,307 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:16,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:16,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348144991] [2023-12-16 17:52:16,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348144991] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:16,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:16,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 17:52:16,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230389679] [2023-12-16 17:52:16,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:16,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 17:52:16,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:16,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 17:52:16,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:16,314 INFO L87 Difference]: Start difference. First operand 244 states and 439 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:16,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:16,603 INFO L93 Difference]: Finished difference Result 643 states and 1141 transitions. [2023-12-16 17:52:16,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 17:52:16,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-16 17:52:16,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:16,606 INFO L225 Difference]: With dead ends: 643 [2023-12-16 17:52:16,606 INFO L226 Difference]: Without dead ends: 403 [2023-12-16 17:52:16,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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:16,608 INFO L413 NwaCegarLoop]: 418 mSDtfsCounter, 227 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:16,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 684 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 17:52:16,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2023-12-16 17:52:16,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 396. [2023-12-16 17:52:16,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 390 states have (on average 1.6333333333333333) internal successors, (637), 394 states have internal predecessors, (637), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:16,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 642 transitions. [2023-12-16 17:52:16,634 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 642 transitions. Word has length 27 [2023-12-16 17:52:16,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:16,634 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 642 transitions. [2023-12-16 17:52:16,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:16,635 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 642 transitions. [2023-12-16 17:52:16,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-16 17:52:16,636 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:16,636 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] [2023-12-16 17:52:16,641 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 (3)] Ended with exit code 0 [2023-12-16 17:52:16,839 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:16,839 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:16,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:16,840 INFO L85 PathProgramCache]: Analyzing trace with hash -849969164, now seen corresponding path program 1 times [2023-12-16 17:52:16,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:16,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230123706] [2023-12-16 17:52:16,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:16,840 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:16,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:16,841 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:16,852 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:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:16,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 17:52:16,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:16,923 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:16,924 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:16,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:16,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230123706] [2023-12-16 17:52:16,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1230123706] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:16,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:16,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 17:52:16,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194039226] [2023-12-16 17:52:16,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:16,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 17:52:16,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:16,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 17:52:16,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:16,926 INFO L87 Difference]: Start difference. First operand 396 states and 642 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:17,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:17,074 INFO L93 Difference]: Finished difference Result 1036 states and 1704 transitions. [2023-12-16 17:52:17,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 17:52:17,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-12-16 17:52:17,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:17,077 INFO L225 Difference]: With dead ends: 1036 [2023-12-16 17:52:17,077 INFO L226 Difference]: Without dead ends: 653 [2023-12-16 17:52:17,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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:17,079 INFO L413 NwaCegarLoop]: 580 mSDtfsCounter, 304 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:17,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 916 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:52:17,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2023-12-16 17:52:17,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 646. [2023-12-16 17:52:17,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 640 states have (on average 1.6640625) internal successors, (1065), 644 states have internal predecessors, (1065), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:17,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1070 transitions. [2023-12-16 17:52:17,105 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1070 transitions. Word has length 35 [2023-12-16 17:52:17,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:17,106 INFO L495 AbstractCegarLoop]: Abstraction has 646 states and 1070 transitions. [2023-12-16 17:52:17,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:17,106 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1070 transitions. [2023-12-16 17:52:17,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 17:52:17,108 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:17,108 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] [2023-12-16 17:52:17,118 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:17,310 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:17,310 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:17,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:17,311 INFO L85 PathProgramCache]: Analyzing trace with hash 626917057, now seen corresponding path program 1 times [2023-12-16 17:52:17,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:17,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292808315] [2023-12-16 17:52:17,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:17,311 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:17,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:17,320 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:17,322 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:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:17,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 17:52:17,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:17,462 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:17,463 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:17,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:17,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292808315] [2023-12-16 17:52:17,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292808315] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:17,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:17,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 17:52:17,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954277757] [2023-12-16 17:52:17,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:17,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 17:52:17,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:17,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 17:52:17,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:17,465 INFO L87 Difference]: Start difference. First operand 646 states and 1070 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:17,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:17,564 INFO L93 Difference]: Finished difference Result 1628 states and 2703 transitions. [2023-12-16 17:52:17,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 17:52:17,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-12-16 17:52:17,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:17,568 INFO L225 Difference]: With dead ends: 1628 [2023-12-16 17:52:17,568 INFO L226 Difference]: Without dead ends: 1006 [2023-12-16 17:52:17,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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:17,570 INFO L413 NwaCegarLoop]: 398 mSDtfsCounter, 328 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:17,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 730 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:52:17,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2023-12-16 17:52:17,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 995. [2023-12-16 17:52:17,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 989 states have (on average 1.6612740141557127) internal successors, (1643), 993 states have internal predecessors, (1643), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:17,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1648 transitions. [2023-12-16 17:52:17,591 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1648 transitions. Word has length 36 [2023-12-16 17:52:17,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:17,591 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1648 transitions. [2023-12-16 17:52:17,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:17,591 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1648 transitions. [2023-12-16 17:52:17,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-16 17:52:17,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:17,592 INFO L195 NwaCegarLoop]: trace histogram [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:17,611 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:17,794 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:17,795 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:17,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:17,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1434445802, now seen corresponding path program 1 times [2023-12-16 17:52:17,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:17,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764766434] [2023-12-16 17:52:17,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:17,796 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:17,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:17,801 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:17,804 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:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:17,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 17:52:17,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:17,890 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:52:17,890 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:17,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:17,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764766434] [2023-12-16 17:52:17,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [764766434] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:17,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:17,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 17:52:17,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111818740] [2023-12-16 17:52:17,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:17,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 17:52:17,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:17,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 17:52:17,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:17,891 INFO L87 Difference]: Start difference. First operand 995 states and 1648 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:17,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:17,981 INFO L93 Difference]: Finished difference Result 2636 states and 4376 transitions. [2023-12-16 17:52:17,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 17:52:17,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2023-12-16 17:52:17,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:17,986 INFO L225 Difference]: With dead ends: 2636 [2023-12-16 17:52:17,987 INFO L226 Difference]: Without dead ends: 1665 [2023-12-16 17:52:17,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 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:17,989 INFO L413 NwaCegarLoop]: 464 mSDtfsCounter, 302 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:17,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 854 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:52:17,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2023-12-16 17:52:18,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1645. [2023-12-16 17:52:18,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1639 states have (on average 1.6601586333129956) internal successors, (2721), 1643 states have internal predecessors, (2721), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2726 transitions. [2023-12-16 17:52:18,027 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2726 transitions. Word has length 43 [2023-12-16 17:52:18,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:18,027 INFO L495 AbstractCegarLoop]: Abstraction has 1645 states and 2726 transitions. [2023-12-16 17:52:18,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:18,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2726 transitions. [2023-12-16 17:52:18,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-16 17:52:18,029 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:18,029 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-16 17:52:18,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 17:52:18,231 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:18,232 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:18,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:18,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1337588593, now seen corresponding path program 1 times [2023-12-16 17:52:18,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:18,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596071937] [2023-12-16 17:52:18,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:18,233 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:18,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:18,234 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:18,236 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:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:18,321 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 17:52:18,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:18,361 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:52:18,361 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:18,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:18,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596071937] [2023-12-16 17:52:18,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596071937] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:18,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:18,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 17:52:18,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133311967] [2023-12-16 17:52:18,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:18,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 17:52:18,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:18,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 17:52:18,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:18,363 INFO L87 Difference]: Start difference. First operand 1645 states and 2726 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:18,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:18,471 INFO L93 Difference]: Finished difference Result 3270 states and 5420 transitions. [2023-12-16 17:52:18,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 17:52:18,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-12-16 17:52:18,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:18,477 INFO L225 Difference]: With dead ends: 3270 [2023-12-16 17:52:18,477 INFO L226 Difference]: Without dead ends: 1649 [2023-12-16 17:52:18,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 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:18,480 INFO L413 NwaCegarLoop]: 630 mSDtfsCounter, 392 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:18,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 930 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:52:18,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2023-12-16 17:52:18,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1543. [2023-12-16 17:52:18,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1537 states have (on average 1.6376057254391672) internal successors, (2517), 1541 states have internal predecessors, (2517), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:18,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2522 transitions. [2023-12-16 17:52:18,522 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2522 transitions. Word has length 53 [2023-12-16 17:52:18,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:18,522 INFO L495 AbstractCegarLoop]: Abstraction has 1543 states and 2522 transitions. [2023-12-16 17:52:18,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:18,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2522 transitions. [2023-12-16 17:52:18,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-16 17:52:18,525 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:18,525 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] [2023-12-16 17:52:18,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 17:52:18,730 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:18,730 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:18,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:18,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1213623573, now seen corresponding path program 1 times [2023-12-16 17:52:18,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:18,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974964790] [2023-12-16 17:52:18,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:18,732 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:18,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:18,752 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:18,798 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:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:18,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 17:52:18,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:18,847 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:18,847 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:18,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:18,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974964790] [2023-12-16 17:52:18,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1974964790] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:18,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:18,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 17:52:18,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039871373] [2023-12-16 17:52:18,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:18,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 17:52:18,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:18,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 17:52:18,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:18,849 INFO L87 Difference]: Start difference. First operand 1543 states and 2522 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:19,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:19,030 INFO L93 Difference]: Finished difference Result 3996 states and 6494 transitions. [2023-12-16 17:52:19,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 17:52:19,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-12-16 17:52:19,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:19,038 INFO L225 Difference]: With dead ends: 3996 [2023-12-16 17:52:19,038 INFO L226 Difference]: Without dead ends: 2471 [2023-12-16 17:52:19,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:19,041 INFO L413 NwaCegarLoop]: 385 mSDtfsCounter, 345 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:19,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 727 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:52:19,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2023-12-16 17:52:19,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2428. [2023-12-16 17:52:19,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2428 states, 2422 states have (on average 1.587118084227911) internal successors, (3844), 2426 states have internal predecessors, (3844), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:19,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 3849 transitions. [2023-12-16 17:52:19,100 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 3849 transitions. Word has length 54 [2023-12-16 17:52:19,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:19,100 INFO L495 AbstractCegarLoop]: Abstraction has 2428 states and 3849 transitions. [2023-12-16 17:52:19,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:19,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 3849 transitions. [2023-12-16 17:52:19,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-16 17:52:19,102 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:19,102 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] [2023-12-16 17:52:19,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-16 17:52:19,304 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:19,304 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:19,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:19,306 INFO L85 PathProgramCache]: Analyzing trace with hash 383831093, now seen corresponding path program 1 times [2023-12-16 17:52:19,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:19,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755495538] [2023-12-16 17:52:19,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:19,306 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:19,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:19,322 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:19,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 17:52:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:19,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 17:52:19,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:19,381 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:19,381 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:19,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:19,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755495538] [2023-12-16 17:52:19,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [755495538] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:19,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:19,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 17:52:19,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478474004] [2023-12-16 17:52:19,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:19,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 17:52:19,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:19,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 17:52:19,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:19,387 INFO L87 Difference]: Start difference. First operand 2428 states and 3849 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:19,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:19,667 INFO L93 Difference]: Finished difference Result 5865 states and 9379 transitions. [2023-12-16 17:52:19,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 17:52:19,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-12-16 17:52:19,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:19,677 INFO L225 Difference]: With dead ends: 5865 [2023-12-16 17:52:19,677 INFO L226 Difference]: Without dead ends: 3502 [2023-12-16 17:52:19,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:19,681 INFO L413 NwaCegarLoop]: 513 mSDtfsCounter, 229 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:19,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 767 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 17:52:19,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3502 states. [2023-12-16 17:52:19,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3502 to 3479. [2023-12-16 17:52:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3479 states, 3473 states have (on average 1.4917938381802476) internal successors, (5181), 3477 states have internal predecessors, (5181), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:19,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3479 states to 3479 states and 5186 transitions. [2023-12-16 17:52:19,821 INFO L78 Accepts]: Start accepts. Automaton has 3479 states and 5186 transitions. Word has length 54 [2023-12-16 17:52:19,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:19,821 INFO L495 AbstractCegarLoop]: Abstraction has 3479 states and 5186 transitions. [2023-12-16 17:52:19,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:19,821 INFO L276 IsEmpty]: Start isEmpty. Operand 3479 states and 5186 transitions. [2023-12-16 17:52:19,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-16 17:52:19,822 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:19,822 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] [2023-12-16 17:52:19,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 17:52:20,024 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:20,025 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:20,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:20,026 INFO L85 PathProgramCache]: Analyzing trace with hash 78251081, now seen corresponding path program 1 times [2023-12-16 17:52:20,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:20,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714584408] [2023-12-16 17:52:20,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:20,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:20,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:20,041 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:20,065 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:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:20,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 17:52:20,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:20,146 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:20,147 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:20,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:20,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714584408] [2023-12-16 17:52:20,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1714584408] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:20,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:20,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 17:52:20,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185316426] [2023-12-16 17:52:20,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:20,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 17:52:20,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:20,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 17:52:20,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:20,148 INFO L87 Difference]: Start difference. First operand 3479 states and 5186 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:20,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:20,283 INFO L93 Difference]: Finished difference Result 6830 states and 10200 transitions. [2023-12-16 17:52:20,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 17:52:20,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2023-12-16 17:52:20,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:20,293 INFO L225 Difference]: With dead ends: 6830 [2023-12-16 17:52:20,293 INFO L226 Difference]: Without dead ends: 3416 [2023-12-16 17:52:20,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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:20,298 INFO L413 NwaCegarLoop]: 362 mSDtfsCounter, 317 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:20,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 390 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:52:20,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2023-12-16 17:52:20,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 3416. [2023-12-16 17:52:20,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3416 states, 3410 states have (on average 1.462756598240469) internal successors, (4988), 3414 states have internal predecessors, (4988), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3416 states to 3416 states and 4993 transitions. [2023-12-16 17:52:20,385 INFO L78 Accepts]: Start accepts. Automaton has 3416 states and 4993 transitions. Word has length 56 [2023-12-16 17:52:20,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:20,385 INFO L495 AbstractCegarLoop]: Abstraction has 3416 states and 4993 transitions. [2023-12-16 17:52:20,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:20,385 INFO L276 IsEmpty]: Start isEmpty. Operand 3416 states and 4993 transitions. [2023-12-16 17:52:20,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-16 17:52:20,386 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:20,387 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:20,407 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:20,589 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:20,589 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:20,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:20,590 INFO L85 PathProgramCache]: Analyzing trace with hash 268995730, now seen corresponding path program 1 times [2023-12-16 17:52:20,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:20,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526425310] [2023-12-16 17:52:20,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:20,590 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:20,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:20,594 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:20,595 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:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:20,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 17:52:20,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:20,659 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:20,659 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:20,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:20,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526425310] [2023-12-16 17:52:20,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526425310] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:20,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:20,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 17:52:20,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162609897] [2023-12-16 17:52:20,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:20,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 17:52:20,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:20,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 17:52:20,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:20,660 INFO L87 Difference]: Start difference. First operand 3416 states and 4993 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:20,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:20,806 INFO L93 Difference]: Finished difference Result 7446 states and 10885 transitions. [2023-12-16 17:52:20,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 17:52:20,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2023-12-16 17:52:20,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:20,817 INFO L225 Difference]: With dead ends: 7446 [2023-12-16 17:52:20,817 INFO L226 Difference]: Without dead ends: 4050 [2023-12-16 17:52:20,821 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:20,821 INFO L413 NwaCegarLoop]: 502 mSDtfsCounter, 217 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:20,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 873 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:52:20,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4050 states. [2023-12-16 17:52:20,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4050 to 3133. [2023-12-16 17:52:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3133 states, 3127 states have (on average 1.4681803645666773) internal successors, (4591), 3131 states have internal predecessors, (4591), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 4596 transitions. [2023-12-16 17:52:20,900 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 4596 transitions. Word has length 57 [2023-12-16 17:52:20,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:20,900 INFO L495 AbstractCegarLoop]: Abstraction has 3133 states and 4596 transitions. [2023-12-16 17:52:20,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:20,900 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 4596 transitions. [2023-12-16 17:52:20,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-16 17:52:20,901 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:20,901 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:20,912 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 (11)] Ended with exit code 0 [2023-12-16 17:52:21,103 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:21,104 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:21,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:21,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1992167834, now seen corresponding path program 1 times [2023-12-16 17:52:21,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:21,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90027631] [2023-12-16 17:52:21,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:21,105 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:21,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:21,110 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:21,160 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:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:21,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 17:52:21,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:21,234 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:21,234 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:21,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:21,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90027631] [2023-12-16 17:52:21,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90027631] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:21,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:21,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 17:52:21,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37960572] [2023-12-16 17:52:21,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:21,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:52:21,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:21,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:52:21,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:52:21,235 INFO L87 Difference]: Start difference. First operand 3133 states and 4596 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:21,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:21,524 INFO L93 Difference]: Finished difference Result 8774 states and 12988 transitions. [2023-12-16 17:52:21,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 17:52:21,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2023-12-16 17:52:21,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:21,542 INFO L225 Difference]: With dead ends: 8774 [2023-12-16 17:52:21,542 INFO L226 Difference]: Without dead ends: 6490 [2023-12-16 17:52:21,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 17:52:21,547 INFO L413 NwaCegarLoop]: 612 mSDtfsCounter, 715 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 2133 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:21,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 2133 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:52:21,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6490 states. [2023-12-16 17:52:21,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6490 to 4618. [2023-12-16 17:52:21,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4618 states, 4612 states have (on average 1.469210754553339) internal successors, (6776), 4616 states have internal predecessors, (6776), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:21,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4618 states to 4618 states and 6781 transitions. [2023-12-16 17:52:21,688 INFO L78 Accepts]: Start accepts. Automaton has 4618 states and 6781 transitions. Word has length 59 [2023-12-16 17:52:21,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:21,688 INFO L495 AbstractCegarLoop]: Abstraction has 4618 states and 6781 transitions. [2023-12-16 17:52:21,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:21,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4618 states and 6781 transitions. [2023-12-16 17:52:21,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-16 17:52:21,689 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:21,689 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] [2023-12-16 17:52:21,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-16 17:52:21,892 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:21,892 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:21,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:21,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1616535386, now seen corresponding path program 1 times [2023-12-16 17:52:21,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:21,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663492706] [2023-12-16 17:52:21,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:21,893 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:21,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:21,910 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:21,940 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:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:21,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 17:52:21,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:22,053 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:22,053 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:22,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:22,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663492706] [2023-12-16 17:52:22,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663492706] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:22,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:22,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 17:52:22,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050775368] [2023-12-16 17:52:22,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:22,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 17:52:22,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:22,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 17:52:22,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 17:52:22,054 INFO L87 Difference]: Start difference. First operand 4618 states and 6781 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:22,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:22,466 INFO L93 Difference]: Finished difference Result 8934 states and 12979 transitions. [2023-12-16 17:52:22,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 17:52:22,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-12-16 17:52:22,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:22,495 INFO L225 Difference]: With dead ends: 8934 [2023-12-16 17:52:22,495 INFO L226 Difference]: Without dead ends: 8931 [2023-12-16 17:52:22,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-12-16 17:52:22,501 INFO L413 NwaCegarLoop]: 596 mSDtfsCounter, 1087 mSDsluCounter, 2672 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 3268 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:22,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 3268 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 17:52:22,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8931 states. [2023-12-16 17:52:22,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8931 to 6236. [2023-12-16 17:52:22,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6236 states, 6230 states have (on average 1.4635634028892457) internal successors, (9118), 6234 states have internal predecessors, (9118), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:22,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6236 states to 6236 states and 9123 transitions. [2023-12-16 17:52:22,757 INFO L78 Accepts]: Start accepts. Automaton has 6236 states and 9123 transitions. Word has length 60 [2023-12-16 17:52:22,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:22,758 INFO L495 AbstractCegarLoop]: Abstraction has 6236 states and 9123 transitions. [2023-12-16 17:52:22,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:22,758 INFO L276 IsEmpty]: Start isEmpty. Operand 6236 states and 9123 transitions. [2023-12-16 17:52:22,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-16 17:52:22,763 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:22,763 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-16 17:52:22,965 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:22,965 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:22,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:22,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1992709385, now seen corresponding path program 1 times [2023-12-16 17:52:22,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:22,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385740138] [2023-12-16 17:52:22,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:22,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:22,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:22,981 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:23,008 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:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:23,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 17:52:23,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:23,071 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:52:23,071 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:23,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:23,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385740138] [2023-12-16 17:52:23,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385740138] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:23,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:23,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 17:52:23,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658808693] [2023-12-16 17:52:23,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:23,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 17:52:23,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:23,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 17:52:23,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:23,072 INFO L87 Difference]: Start difference. First operand 6236 states and 9123 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:23,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:23,264 INFO L93 Difference]: Finished difference Result 9936 states and 14722 transitions. [2023-12-16 17:52:23,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 17:52:23,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2023-12-16 17:52:23,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:23,272 INFO L225 Difference]: With dead ends: 9936 [2023-12-16 17:52:23,272 INFO L226 Difference]: Without dead ends: 3756 [2023-12-16 17:52:23,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 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:23,276 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 324 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:23,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 597 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:52:23,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3756 states. [2023-12-16 17:52:23,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3756 to 3386. [2023-12-16 17:52:23,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3380 states have (on average 1.4967455621301775) internal successors, (5059), 3384 states have internal predecessors, (5059), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:23,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 5064 transitions. [2023-12-16 17:52:23,373 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 5064 transitions. Word has length 96 [2023-12-16 17:52:23,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:23,374 INFO L495 AbstractCegarLoop]: Abstraction has 3386 states and 5064 transitions. [2023-12-16 17:52:23,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:23,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 5064 transitions. [2023-12-16 17:52:23,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-16 17:52:23,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:23,377 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:52:23,395 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:23,580 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:23,580 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:23,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:23,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1331852260, now seen corresponding path program 1 times [2023-12-16 17:52:23,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:23,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002697825] [2023-12-16 17:52:23,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:23,581 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:23,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:23,583 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:23,584 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:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:23,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 17:52:23,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:23,657 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 17:52:23,657 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:23,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:23,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002697825] [2023-12-16 17:52:23,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002697825] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:23,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:23,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 17:52:23,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528598689] [2023-12-16 17:52:23,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:23,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 17:52:23,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:23,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 17:52:23,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:23,658 INFO L87 Difference]: Start difference. First operand 3386 states and 5064 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:23,861 INFO L93 Difference]: Finished difference Result 8427 states and 12584 transitions. [2023-12-16 17:52:23,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 17:52:23,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2023-12-16 17:52:23,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:23,867 INFO L225 Difference]: With dead ends: 8427 [2023-12-16 17:52:23,868 INFO L226 Difference]: Without dead ends: 4959 [2023-12-16 17:52:23,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 130 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:23,871 INFO L413 NwaCegarLoop]: 535 mSDtfsCounter, 278 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:23,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 886 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:52:23,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2023-12-16 17:52:23,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 4895. [2023-12-16 17:52:23,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4895 states, 4889 states have (on average 1.486807118020045) internal successors, (7269), 4893 states have internal predecessors, (7269), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:23,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4895 states to 4895 states and 7274 transitions. [2023-12-16 17:52:23,996 INFO L78 Accepts]: Start accepts. Automaton has 4895 states and 7274 transitions. Word has length 132 [2023-12-16 17:52:23,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:23,996 INFO L495 AbstractCegarLoop]: Abstraction has 4895 states and 7274 transitions. [2023-12-16 17:52:23,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:23,996 INFO L276 IsEmpty]: Start isEmpty. Operand 4895 states and 7274 transitions. [2023-12-16 17:52:23,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-16 17:52:24,000 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:24,000 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,018 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:24,218 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:24,219 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:24,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:24,219 INFO L85 PathProgramCache]: Analyzing trace with hash 760510169, now seen corresponding path program 1 times [2023-12-16 17:52:24,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:24,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527822138] [2023-12-16 17:52:24,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:24,220 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:24,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:24,221 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:24,242 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:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:24,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 17:52:24,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:24,312 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 17:52:24,312 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:24,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:24,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527822138] [2023-12-16 17:52:24,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527822138] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:24,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:24,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 17:52:24,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118297090] [2023-12-16 17:52:24,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:24,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 17:52:24,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:24,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 17:52:24,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:24,314 INFO L87 Difference]: Start difference. First operand 4895 states and 7274 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:24,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:24,610 INFO L93 Difference]: Finished difference Result 12847 states and 18989 transitions. [2023-12-16 17:52:24,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 17:52:24,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2023-12-16 17:52:24,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:24,622 INFO L225 Difference]: With dead ends: 12847 [2023-12-16 17:52:24,622 INFO L226 Difference]: Without dead ends: 8053 [2023-12-16 17:52:24,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 138 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:24,630 INFO L413 NwaCegarLoop]: 637 mSDtfsCounter, 328 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:24,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 954 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:52:24,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8053 states. [2023-12-16 17:52:24,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8053 to 8004. [2023-12-16 17:52:24,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8004 states, 7998 states have (on average 1.420355088772193) internal successors, (11360), 8002 states have internal predecessors, (11360), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:24,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8004 states to 8004 states and 11365 transitions. [2023-12-16 17:52:24,971 INFO L78 Accepts]: Start accepts. Automaton has 8004 states and 11365 transitions. Word has length 140 [2023-12-16 17:52:24,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:24,971 INFO L495 AbstractCegarLoop]: Abstraction has 8004 states and 11365 transitions. [2023-12-16 17:52:24,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:24,972 INFO L276 IsEmpty]: Start isEmpty. Operand 8004 states and 11365 transitions. [2023-12-16 17:52:24,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-16 17:52:24,976 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:24,976 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,997 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 (16)] Ended with exit code 0 [2023-12-16 17:52:25,179 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:25,179 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:25,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:25,180 INFO L85 PathProgramCache]: Analyzing trace with hash -137847187, now seen corresponding path program 1 times [2023-12-16 17:52:25,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:25,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374014870] [2023-12-16 17:52:25,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:25,180 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:25,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:25,181 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:25,200 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:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:25,253 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 17:52:25,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:25,287 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 17:52:25,287 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:25,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:25,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374014870] [2023-12-16 17:52:25,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374014870] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:25,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:25,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 17:52:25,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736872923] [2023-12-16 17:52:25,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:25,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 17:52:25,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:25,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 17:52:25,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:25,288 INFO L87 Difference]: Start difference. First operand 8004 states and 11365 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:25,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:25,486 INFO L93 Difference]: Finished difference Result 11634 states and 16710 transitions. [2023-12-16 17:52:25,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 17:52:25,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2023-12-16 17:52:25,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:25,491 INFO L225 Difference]: With dead ends: 11634 [2023-12-16 17:52:25,491 INFO L226 Difference]: Without dead ends: 3579 [2023-12-16 17:52:25,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 139 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:25,496 INFO L413 NwaCegarLoop]: 402 mSDtfsCounter, 315 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:25,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 485 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:52:25,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3579 states. [2023-12-16 17:52:25,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3579 to 3524. [2023-12-16 17:52:25,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3524 states, 3518 states have (on average 1.3590108015918134) internal successors, (4781), 3522 states have internal predecessors, (4781), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3524 states to 3524 states and 4786 transitions. [2023-12-16 17:52:25,586 INFO L78 Accepts]: Start accepts. Automaton has 3524 states and 4786 transitions. Word has length 141 [2023-12-16 17:52:25,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:25,586 INFO L495 AbstractCegarLoop]: Abstraction has 3524 states and 4786 transitions. [2023-12-16 17:52:25,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:25,586 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states and 4786 transitions. [2023-12-16 17:52:25,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-16 17:52:25,587 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:25,588 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,602 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:25,791 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:25,791 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:25,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:25,792 INFO L85 PathProgramCache]: Analyzing trace with hash 631875968, now seen corresponding path program 1 times [2023-12-16 17:52:25,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:25,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2070164439] [2023-12-16 17:52:25,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:25,792 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:25,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:25,793 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:25,813 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:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:25,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 17:52:25,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:25,930 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-16 17:52:25,930 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:25,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:25,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2070164439] [2023-12-16 17:52:25,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2070164439] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:25,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:25,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 17:52:25,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550848744] [2023-12-16 17:52:25,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:25,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 17:52:25,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:25,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 17:52:25,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:25,932 INFO L87 Difference]: Start difference. First operand 3524 states and 4786 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:26,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:26,047 INFO L93 Difference]: Finished difference Result 6248 states and 8505 transitions. [2023-12-16 17:52:26,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 17:52:26,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2023-12-16 17:52:26,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:26,052 INFO L225 Difference]: With dead ends: 6248 [2023-12-16 17:52:26,052 INFO L226 Difference]: Without dead ends: 2760 [2023-12-16 17:52:26,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 145 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:26,056 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 244 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:26,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 379 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:52:26,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2023-12-16 17:52:26,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 2576. [2023-12-16 17:52:26,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2576 states, 2570 states have (on average 1.3291828793774318) internal successors, (3416), 2574 states have internal predecessors, (3416), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:26,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 3421 transitions. [2023-12-16 17:52:26,152 INFO L78 Accepts]: Start accepts. Automaton has 2576 states and 3421 transitions. Word has length 147 [2023-12-16 17:52:26,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:26,152 INFO L495 AbstractCegarLoop]: Abstraction has 2576 states and 3421 transitions. [2023-12-16 17:52:26,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:26,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 3421 transitions. [2023-12-16 17:52:26,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-16 17:52:26,154 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:26,154 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,176 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 (18)] Ended with exit code 0 [2023-12-16 17:52:26,357 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:26,357 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:26,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:26,358 INFO L85 PathProgramCache]: Analyzing trace with hash 769921568, now seen corresponding path program 1 times [2023-12-16 17:52:26,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:26,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135015178] [2023-12-16 17:52:26,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:26,358 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:26,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:26,377 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:26,440 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:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:26,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 17:52:26,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:26,536 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 17:52:26,537 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:26,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:26,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135015178] [2023-12-16 17:52:26,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135015178] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:26,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:26,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 17:52:26,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399268006] [2023-12-16 17:52:26,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:26,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 17:52:26,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:26,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 17:52:26,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 17:52:26,538 INFO L87 Difference]: Start difference. First operand 2576 states and 3421 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:26,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:26,691 INFO L93 Difference]: Finished difference Result 3177 states and 4180 transitions. [2023-12-16 17:52:26,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 17:52:26,691 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2023-12-16 17:52:26,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:26,693 INFO L225 Difference]: With dead ends: 3177 [2023-12-16 17:52:26,693 INFO L226 Difference]: Without dead ends: 685 [2023-12-16 17:52:26,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 148 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:26,696 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 127 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:26,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 350 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:52:26,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2023-12-16 17:52:26,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 677. [2023-12-16 17:52:26,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 673 states have (on average 1.1040118870728084) internal successors, (743), 675 states have internal predecessors, (743), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:26,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 746 transitions. [2023-12-16 17:52:26,719 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 746 transitions. Word has length 150 [2023-12-16 17:52:26,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:26,719 INFO L495 AbstractCegarLoop]: Abstraction has 677 states and 746 transitions. [2023-12-16 17:52:26,719 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:26,719 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 746 transitions. [2023-12-16 17:52:26,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-16 17:52:26,720 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:26,721 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,743 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 (19)] Ended with exit code 0 [2023-12-16 17:52:26,923 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:26,924 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:26,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:26,924 INFO L85 PathProgramCache]: Analyzing trace with hash 80761447, now seen corresponding path program 1 times [2023-12-16 17:52:26,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:26,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307004138] [2023-12-16 17:52:26,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:26,925 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:26,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:26,926 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:26,930 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:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:27,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 17:52:27,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-16 17:52:27,121 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:52:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-16 17:52:27,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:27,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307004138] [2023-12-16 17:52:27,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307004138] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:52:27,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:52:27,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-16 17:52:27,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351882453] [2023-12-16 17:52:27,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:52:27,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 17:52:27,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:27,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 17:52:27,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 17:52:27,332 INFO L87 Difference]: Start difference. First operand 677 states and 746 transitions. Second operand has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:27,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:27,403 INFO L93 Difference]: Finished difference Result 971 states and 1066 transitions. [2023-12-16 17:52:27,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 17:52:27,403 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2023-12-16 17:52:27,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:27,404 INFO L225 Difference]: With dead ends: 971 [2023-12-16 17:52:27,404 INFO L226 Difference]: Without dead ends: 571 [2023-12-16 17:52:27,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-16 17:52:27,405 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 391 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:27,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 604 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:52:27,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2023-12-16 17:52:27,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2023-12-16 17:52:27,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 567 states have (on average 1.1005291005291005) internal successors, (624), 569 states have internal predecessors, (624), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:27,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 627 transitions. [2023-12-16 17:52:27,425 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 627 transitions. Word has length 153 [2023-12-16 17:52:27,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:27,426 INFO L495 AbstractCegarLoop]: Abstraction has 571 states and 627 transitions. [2023-12-16 17:52:27,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:27,426 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 627 transitions. [2023-12-16 17:52:27,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-16 17:52:27,427 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:27,427 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-16 17:52:27,630 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:27,631 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:27,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:27,631 INFO L85 PathProgramCache]: Analyzing trace with hash 820333015, now seen corresponding path program 1 times [2023-12-16 17:52:27,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:27,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089684333] [2023-12-16 17:52:27,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:27,631 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:27,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:27,632 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:27,638 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:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:27,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 17:52:27,708 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:27,779 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 17:52:27,780 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:27,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:27,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089684333] [2023-12-16 17:52:27,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089684333] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:27,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:27,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 17:52:27,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025370349] [2023-12-16 17:52:27,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:27,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 17:52:27,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:27,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 17:52:27,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 17:52:27,781 INFO L87 Difference]: Start difference. First operand 571 states and 627 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:27,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:27,897 INFO L93 Difference]: Finished difference Result 582 states and 637 transitions. [2023-12-16 17:52:27,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 17:52:27,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2023-12-16 17:52:27,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:27,898 INFO L225 Difference]: With dead ends: 582 [2023-12-16 17:52:27,898 INFO L226 Difference]: Without dead ends: 579 [2023-12-16 17:52:27,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-16 17:52:27,899 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 205 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:27,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1151 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:52:27,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2023-12-16 17:52:27,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 570. [2023-12-16 17:52:27,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 567 states have (on average 1.0970017636684304) internal successors, (622), 568 states have internal predecessors, (622), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:27,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 624 transitions. [2023-12-16 17:52:27,921 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 624 transitions. Word has length 155 [2023-12-16 17:52:27,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:27,921 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 624 transitions. [2023-12-16 17:52:27,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:27,921 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 624 transitions. [2023-12-16 17:52:27,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-16 17:52:27,922 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:27,922 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,927 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:28,122 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:28,123 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:28,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:28,123 INFO L85 PathProgramCache]: Analyzing trace with hash -328354987, now seen corresponding path program 1 times [2023-12-16 17:52:28,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:28,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367602311] [2023-12-16 17:52:28,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:28,124 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:28,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:28,125 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:28,126 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:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:28,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 17:52:28,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 17:52:28,249 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:52:28,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:28,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367602311] [2023-12-16 17:52:28,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367602311] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:52:28,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:52:28,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 17:52:28,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516643532] [2023-12-16 17:52:28,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:52:28,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:52:28,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:28,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:52:28,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:52:28,250 INFO L87 Difference]: Start difference. First operand 570 states and 624 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:28,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:28,328 INFO L93 Difference]: Finished difference Result 668 states and 725 transitions. [2023-12-16 17:52:28,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 17:52:28,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2023-12-16 17:52:28,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:28,329 INFO L225 Difference]: With dead ends: 668 [2023-12-16 17:52:28,329 INFO L226 Difference]: Without dead ends: 566 [2023-12-16 17:52:28,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 17:52:28,330 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 152 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:28,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 725 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 17:52:28,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2023-12-16 17:52:28,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 563. [2023-12-16 17:52:28,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 561 states have (on average 1.0873440285204992) internal successors, (610), 561 states have internal predecessors, (610), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 611 transitions. [2023-12-16 17:52:28,348 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 611 transitions. Word has length 156 [2023-12-16 17:52:28,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:28,348 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 611 transitions. [2023-12-16 17:52:28,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:28,349 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 611 transitions. [2023-12-16 17:52:28,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-12-16 17:52:28,350 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:52:28,350 INFO L195 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,368 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:28,553 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:28,553 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:52:28,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:52:28,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1134668779, now seen corresponding path program 1 times [2023-12-16 17:52:28,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:52:28,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731051425] [2023-12-16 17:52:28,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:52:28,554 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:28,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:52:28,568 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 17:52:28,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-16 17:52:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:52:28,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-16 17:52:28,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:52:29,092 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:52:29,092 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:52:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 17:52:29,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:52:29,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731051425] [2023-12-16 17:52:29,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731051425] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:52:29,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:52:29,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2023-12-16 17:52:29,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271790316] [2023-12-16 17:52:29,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:52:29,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-16 17:52:29,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:52:29,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-16 17:52:29,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2023-12-16 17:52:29,523 INFO L87 Difference]: Start difference. First operand 563 states and 611 transitions. Second operand has 24 states, 24 states have (on average 13.041666666666666) internal successors, (313), 24 states have internal predecessors, (313), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:30,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:52:30,126 INFO L93 Difference]: Finished difference Result 572 states and 620 transitions. [2023-12-16 17:52:30,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 17:52:30,152 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 13.041666666666666) internal successors, (313), 24 states have internal predecessors, (313), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 213 [2023-12-16 17:52:30,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:52:30,153 INFO L225 Difference]: With dead ends: 572 [2023-12-16 17:52:30,153 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 17:52:30,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=1516, Unknown=0, NotChecked=0, Total=1722 [2023-12-16 17:52:30,154 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 651 mSDsluCounter, 4496 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 4820 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 17:52:30,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 4820 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 17:52:30,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 17:52:30,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 17:52:30,155 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:30,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 17:52:30,155 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 213 [2023-12-16 17:52:30,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:52:30,155 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 17:52:30,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 13.041666666666666) internal successors, (313), 24 states have internal predecessors, (313), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 17:52:30,155 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 17:52:30,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 17:52:30,157 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 17:52:30,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-12-16 17:52:30,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:52:30,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 17:52:36,382 INFO L899 garLoopResultBuilder]: For program point $Ultimate##406(lines 764 808) no Hoare annotation was computed. [2023-12-16 17:52:36,382 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 617) no Hoare annotation was computed. [2023-12-16 17:52:36,382 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 130) no Hoare annotation was computed. [2023-12-16 17:52:36,382 INFO L899 garLoopResultBuilder]: For program point $Ultimate##412(lines 772 807) no Hoare annotation was computed. [2023-12-16 17:52:36,382 INFO L899 garLoopResultBuilder]: For program point L829(lines 829 835) no Hoare annotation was computed. [2023-12-16 17:52:36,382 INFO L899 garLoopResultBuilder]: For program point L829-1(lines 829 835) no Hoare annotation was computed. [2023-12-16 17:52:36,382 INFO L899 garLoopResultBuilder]: For program point $Ultimate##418(lines 780 806) no Hoare annotation was computed. [2023-12-16 17:52:36,382 INFO L899 garLoopResultBuilder]: For program point L565(lines 565 569) no Hoare annotation was computed. [2023-12-16 17:52:36,382 INFO L899 garLoopResultBuilder]: For program point $Ultimate##424(lines 788 805) no Hoare annotation was computed. [2023-12-16 17:52:36,382 INFO L899 garLoopResultBuilder]: For program point s_run_returnLabel#1(lines 851 1112) no Hoare annotation was computed. [2023-12-16 17:52:36,382 INFO L899 garLoopResultBuilder]: For program point $Ultimate##430(lines 796 804) no Hoare annotation was computed. [2023-12-16 17:52:36,382 INFO L899 garLoopResultBuilder]: For program point L1095(lines 1087 1104) no Hoare annotation was computed. [2023-12-16 17:52:36,383 INFO L895 garLoopResultBuilder]: At program point L831(line 831) the Hoare annotation is: false [2023-12-16 17:52:36,383 INFO L899 garLoopResultBuilder]: For program point L765(lines 765 769) no Hoare annotation was computed. [2023-12-16 17:52:36,383 INFO L899 garLoopResultBuilder]: For program point L699(lines 699 703) no Hoare annotation was computed. [2023-12-16 17:52:36,383 INFO L899 garLoopResultBuilder]: For program point L105(lines 105 129) no Hoare annotation was computed. [2023-12-16 17:52:36,383 INFO L899 garLoopResultBuilder]: For program point L1096(lines 1096 1100) no Hoare annotation was computed. [2023-12-16 17:52:36,383 INFO L899 garLoopResultBuilder]: For program point $Ultimate##200(lines 364 372) no Hoare annotation was computed. [2023-12-16 17:52:36,383 INFO L899 garLoopResultBuilder]: For program point $Ultimate##442(lines 818 826) no Hoare annotation was computed. [2023-12-16 17:52:36,383 INFO L899 garLoopResultBuilder]: For program point $Ultimate##600(lines 1271 1315) no Hoare annotation was computed. [2023-12-16 17:52:36,383 INFO L899 garLoopResultBuilder]: For program point $Ultimate##606(lines 1279 1314) no Hoare annotation was computed. [2023-12-16 17:52:36,383 INFO L899 garLoopResultBuilder]: For program point $Ultimate##612(lines 1287 1313) no Hoare annotation was computed. [2023-12-16 17:52:36,383 INFO L899 garLoopResultBuilder]: For program point $Ultimate##618(lines 1295 1312) no Hoare annotation was computed. [2023-12-16 17:52:36,383 INFO L899 garLoopResultBuilder]: For program point L1296(lines 1296 1300) no Hoare annotation was computed. [2023-12-16 17:52:36,383 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 243) no Hoare annotation was computed. [2023-12-16 17:52:36,383 INFO L899 garLoopResultBuilder]: For program point L966(lines 966 970) no Hoare annotation was computed. [2023-12-16 17:52:36,383 INFO L899 garLoopResultBuilder]: For program point $Ultimate##624(lines 1303 1311) no Hoare annotation was computed. [2023-12-16 17:52:36,383 INFO L899 garLoopResultBuilder]: For program point m_run_returnLabel#1(lines 85 844) no Hoare annotation was computed. [2023-12-16 17:52:36,383 INFO L899 garLoopResultBuilder]: For program point L174(lines 144 175) no Hoare annotation was computed. [2023-12-16 17:52:36,383 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 128) no Hoare annotation was computed. [2023-12-16 17:52:36,383 INFO L899 garLoopResultBuilder]: For program point L1033(lines 1033 1086) no Hoare annotation was computed. [2023-12-16 17:52:36,383 INFO L899 garLoopResultBuilder]: For program point $Ultimate##636(lines 1325 1333) no Hoare annotation was computed. [2023-12-16 17:52:36,383 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 443) no Hoare annotation was computed. [2023-12-16 17:52:36,383 INFO L899 garLoopResultBuilder]: For program point L1034(lines 1034 1038) no Hoare annotation was computed. [2023-12-16 17:52:36,384 INFO L895 garLoopResultBuilder]: At program point L638-2(lines 638 666) the Hoare annotation is: (let ((.cse7 (= ~c_empty_req~0 (_ bv1 32))) (.cse8 (= (_ bv6 32) ~m_run_pc~0)) (.cse1 (= ~c_req_a~0 (_ bv0 32))) (.cse2 (= ~c_req_type~0 (_ bv0 32))) (.cse3 (= |ULTIMATE.start_m_run_~a~0#1| (_ bv0 32))) (.cse5 (= |ULTIMATE.start_m_run_~req_a___0~0#1| (_ bv0 32))) (.cse10 (= (_ bv0 32) ~a_t~0)) (.cse12 (= ~s_memory0~0 (_ bv50 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse9 (= ~c_m_lock~0 (_ bv1 32))) (.cse11 (= ~s_run_st~0 (_ bv2 32))) (.cse13 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (_ bv0 32) ~req_tt_a~0) .cse7 .cse8 (= ~c_rsp_d~0 (_ bv50 32)) .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse4 .cse6 .cse7 .cse8 .cse11 (= ~c_m_lock~0 (_ bv0 32)) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse12 .cse13) (and .cse0 .cse4 .cse6 .cse9 .cse11 .cse13))) [2023-12-16 17:52:36,384 INFO L899 garLoopResultBuilder]: For program point L639(lines 638 666) no Hoare annotation was computed. [2023-12-16 17:52:36,384 INFO L899 garLoopResultBuilder]: For program point L573(lines 573 577) no Hoare annotation was computed. [2023-12-16 17:52:36,384 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 127) no Hoare annotation was computed. [2023-12-16 17:52:36,384 INFO L899 garLoopResultBuilder]: For program point L904(lines 878 905) no Hoare annotation was computed. [2023-12-16 17:52:36,384 INFO L895 garLoopResultBuilder]: At program point L178-2(lines 178 206) the Hoare annotation is: (let ((.cse10 (= ~s_run_st~0 (_ bv2 32))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse1 (= ~c_req_type~0 (_ bv0 32))) (.cse2 (= |ULTIMATE.start_m_run_~req_a~0#1| (_ bv0 32))) (.cse3 (= |ULTIMATE.start_m_run_~a~0#1| (_ bv0 32))) (.cse4 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse5 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_req~0 (_ bv1 32))) (.cse7 (= ~c_m_lock~0 (_ bv1 32))) (.cse14 (= ~s_run_pc~0 (_ bv0 32))) (.cse8 (= (_ bv0 32) ~a_t~0)) (.cse9 (= |ULTIMATE.start_m_run_~req_type~0#1| (_ bv1 32))) (.cse11 (= |ULTIMATE.start_m_run_~req_d~0#1| (_ bv50 32))) (.cse12 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse13 (= ~m_run_pc~0 (_ bv0 32)))) (or (and (= ~s_run_pc~0 (_ bv2 32)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse9 .cse10 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse9 .cse11 .cse12 .cse13))) [2023-12-16 17:52:36,384 INFO L899 garLoopResultBuilder]: For program point L773(lines 773 777) no Hoare annotation was computed. [2023-12-16 17:52:36,384 INFO L899 garLoopResultBuilder]: For program point L707(lines 707 711) no Hoare annotation was computed. [2023-12-16 17:52:36,384 INFO L899 garLoopResultBuilder]: For program point L179(lines 178 206) no Hoare annotation was computed. [2023-12-16 17:52:36,384 INFO L899 garLoopResultBuilder]: For program point L1303(lines 1255 1344) no Hoare annotation was computed. [2023-12-16 17:52:36,384 INFO L899 garLoopResultBuilder]: For program point L1237(lines 1237 1241) no Hoare annotation was computed. [2023-12-16 17:52:36,384 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 126) no Hoare annotation was computed. [2023-12-16 17:52:36,384 INFO L899 garLoopResultBuilder]: For program point L973(lines 965 982) no Hoare annotation was computed. [2023-12-16 17:52:36,384 INFO L899 garLoopResultBuilder]: For program point L379(lines 379 383) no Hoare annotation was computed. [2023-12-16 17:52:36,384 INFO L899 garLoopResultBuilder]: For program point L1304(lines 1304 1308) no Hoare annotation was computed. [2023-12-16 17:52:36,385 INFO L899 garLoopResultBuilder]: For program point L247(lines 247 251) no Hoare annotation was computed. [2023-12-16 17:52:36,385 INFO L899 garLoopResultBuilder]: For program point L1172(lines 1172 1176) no Hoare annotation was computed. [2023-12-16 17:52:36,385 INFO L899 garLoopResultBuilder]: For program point L1172-2(lines 1170 1349) no Hoare annotation was computed. [2023-12-16 17:52:36,385 INFO L899 garLoopResultBuilder]: For program point L974(lines 974 978) no Hoare annotation was computed. [2023-12-16 17:52:36,385 INFO L899 garLoopResultBuilder]: For program point L446(lines 134 480) no Hoare annotation was computed. [2023-12-16 17:52:36,385 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 451) no Hoare annotation was computed. [2023-12-16 17:52:36,385 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 125) no Hoare annotation was computed. [2023-12-16 17:52:36,385 INFO L899 garLoopResultBuilder]: For program point L1042(lines 1042 1046) no Hoare annotation was computed. [2023-12-16 17:52:36,385 INFO L899 garLoopResultBuilder]: For program point L911(lines 911 964) no Hoare annotation was computed. [2023-12-16 17:52:36,385 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 585) no Hoare annotation was computed. [2023-12-16 17:52:36,385 INFO L899 garLoopResultBuilder]: For program point L317(lines 287 318) no Hoare annotation was computed. [2023-12-16 17:52:36,385 INFO L899 garLoopResultBuilder]: For program point L912(lines 912 916) no Hoare annotation was computed. [2023-12-16 17:52:36,385 INFO L899 garLoopResultBuilder]: For program point L714(lines 485 837) no Hoare annotation was computed. [2023-12-16 17:52:36,385 INFO L899 garLoopResultBuilder]: For program point L1177-1(lines 1170 1349) no Hoare annotation was computed. [2023-12-16 17:52:36,385 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 124) no Hoare annotation was computed. [2023-12-16 17:52:36,385 INFO L899 garLoopResultBuilder]: For program point L781(lines 781 785) no Hoare annotation was computed. [2023-12-16 17:52:36,385 INFO L899 garLoopResultBuilder]: For program point L715(lines 715 719) no Hoare annotation was computed. [2023-12-16 17:52:36,385 INFO L899 garLoopResultBuilder]: For program point L386(lines 378 395) no Hoare annotation was computed. [2023-12-16 17:52:36,385 INFO L899 garLoopResultBuilder]: For program point L254(lines 134 480) no Hoare annotation was computed. [2023-12-16 17:52:36,385 INFO L899 garLoopResultBuilder]: For program point L1245(lines 1245 1249) no Hoare annotation was computed. [2023-12-16 17:52:36,385 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 391) no Hoare annotation was computed. [2023-12-16 17:52:36,385 INFO L899 garLoopResultBuilder]: For program point $Ultimate##299(lines 572 616) no Hoare annotation was computed. [2023-12-16 17:52:36,385 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 259) no Hoare annotation was computed. [2023-12-16 17:52:36,385 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 17:52:36,386 INFO L899 garLoopResultBuilder]: For program point L1050(lines 1050 1054) no Hoare annotation was computed. [2023-12-16 17:52:36,386 INFO L899 garLoopResultBuilder]: For program point L324(lines 324 377) no Hoare annotation was computed. [2023-12-16 17:52:36,386 INFO L899 garLoopResultBuilder]: For program point L1183(lines 1183 1187) no Hoare annotation was computed. [2023-12-16 17:52:36,386 INFO L899 garLoopResultBuilder]: For program point L985(lines 985 999) no Hoare annotation was computed. [2023-12-16 17:52:36,386 INFO L899 garLoopResultBuilder]: For program point L589(lines 589 593) no Hoare annotation was computed. [2023-12-16 17:52:36,386 INFO L899 garLoopResultBuilder]: For program point $Ultimate##494(lines 935 961) no Hoare annotation was computed. [2023-12-16 17:52:36,386 INFO L899 garLoopResultBuilder]: For program point $Ultimate##251(lines 446 454) no Hoare annotation was computed. [2023-12-16 17:52:36,386 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 329) no Hoare annotation was computed. [2023-12-16 17:52:36,386 INFO L899 garLoopResultBuilder]: For program point L920(lines 920 924) no Hoare annotation was computed. [2023-12-16 17:52:36,386 INFO L899 garLoopResultBuilder]: For program point L524(lines 494 525) no Hoare annotation was computed. [2023-12-16 17:52:36,386 INFO L899 garLoopResultBuilder]: For program point $Ultimate##263(lines 468 476) no Hoare annotation was computed. [2023-12-16 17:52:36,386 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 793) no Hoare annotation was computed. [2023-12-16 17:52:36,386 INFO L899 garLoopResultBuilder]: For program point L1318(lines 1318 1322) no Hoare annotation was computed. [2023-12-16 17:52:36,386 INFO L899 garLoopResultBuilder]: For program point L1120(lines 1119 1160) no Hoare annotation was computed. [2023-12-16 17:52:36,386 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 465) no Hoare annotation was computed. [2023-12-16 17:52:36,386 INFO L899 garLoopResultBuilder]: For program point L131(lines 101 843) no Hoare annotation was computed. [2023-12-16 17:52:36,386 INFO L899 garLoopResultBuilder]: For program point $Ultimate##212(lines 386 394) no Hoare annotation was computed. [2023-12-16 17:52:36,386 INFO L895 garLoopResultBuilder]: At program point L528-2(lines 528 556) the Hoare annotation is: (and (= ~s_run_pc~0 (_ bv2 32)) (= |ULTIMATE.start_m_run_~a~0#1| (_ bv0 32)) (= (_ bv2 32) ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| (_ bv0 32)) (= (_ bv3 32) ~m_run_pc~0) (= (_ bv2 32) ~c_write_rsp_ev~0) (= ~c_empty_req~0 (_ bv1 32)) (= ~c_m_lock~0 (_ bv1 32)) (= (_ bv0 32) ~a_t~0) (= ~c_req_d~0 (_ bv50 32)) (= ~s_run_st~0 (_ bv2 32)) (= ~s_memory0~0 (_ bv50 32)) (= ~c_empty_rsp~0 (_ bv1 32)) (= |ULTIMATE.start_m_run_~req_type___0~0#1| (_ bv0 32))) [2023-12-16 17:52:36,386 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 69) no Hoare annotation was computed. [2023-12-16 17:52:36,386 INFO L899 garLoopResultBuilder]: For program point $Ultimate##227(lines 414 458) no Hoare annotation was computed. [2023-12-16 17:52:36,386 INFO L899 garLoopResultBuilder]: For program point L991(lines 991 998) no Hoare annotation was computed. [2023-12-16 17:52:36,386 INFO L899 garLoopResultBuilder]: For program point L529(lines 528 556) no Hoare annotation was computed. [2023-12-16 17:52:36,387 INFO L899 garLoopResultBuilder]: For program point L397(lines 397 403) no Hoare annotation was computed. [2023-12-16 17:52:36,387 INFO L899 garLoopResultBuilder]: For program point L397-1(lines 397 403) no Hoare annotation was computed. [2023-12-16 17:52:36,387 INFO L899 garLoopResultBuilder]: For program point L1124(lines 1124 1128) no Hoare annotation was computed. [2023-12-16 17:52:36,387 INFO L899 garLoopResultBuilder]: For program point L1124-1(lines 1119 1160) no Hoare annotation was computed. [2023-12-16 17:52:36,387 INFO L899 garLoopResultBuilder]: For program point $Ultimate##233(lines 422 457) no Hoare annotation was computed. [2023-12-16 17:52:36,387 INFO L899 garLoopResultBuilder]: For program point L1058(lines 1058 1062) no Hoare annotation was computed. [2023-12-16 17:52:36,387 INFO L899 garLoopResultBuilder]: For program point $Ultimate##239(lines 430 456) no Hoare annotation was computed. [2023-12-16 17:52:36,387 INFO L899 garLoopResultBuilder]: For program point L1191(lines 1191 1195) no Hoare annotation was computed. [2023-12-16 17:52:36,387 INFO L899 garLoopResultBuilder]: For program point $Ultimate##482(lines 919 963) no Hoare annotation was computed. [2023-12-16 17:52:36,387 INFO L895 garLoopResultBuilder]: At program point L134-2(lines 134 480) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse9 (= ~c_req_type~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse4 (= (_ bv0 32) ~a_t~0)) (.cse8 (= ~c_req_a~0 (_ bv0 32))) (.cse10 (= |ULTIMATE.start_m_run_~a~0#1| (_ bv0 32))) (.cse2 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_req~0 (_ bv1 32))) (.cse12 (= ~s_run_pc~0 (_ bv0 32))) (.cse5 (= ~s_run_st~0 (_ bv2 32))) (.cse6 (= ~c_m_lock~0 (_ bv0 32))) (.cse7 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse11 (= ~m_run_pc~0 (_ bv0 32)))) (or (and .cse0 (= |ULTIMATE.start_m_run_~a~0#1| (_ bv1 32)) .cse1 (= (_ bv3 32) ~m_run_pc~0) .cse2 .cse3 .cse4 (= ~c_req_d~0 (_ bv50 32)) .cse5 .cse6 (= ~s_memory0~0 (_ bv50 32)) .cse7) (and .cse0 .cse8 .cse9 .cse10 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11) (and .cse8 .cse9 .cse10 .cse1 .cse2 .cse3 .cse12 .cse4 .cse6 .cse7 .cse11) (and .cse8 .cse10 .cse2 .cse3 .cse12 .cse5 .cse6 .cse7 .cse11))) [2023-12-16 17:52:36,387 INFO L899 garLoopResultBuilder]: For program point $Ultimate##488(lines 927 962) no Hoare annotation was computed. [2023-12-16 17:52:36,387 INFO L899 garLoopResultBuilder]: For program point $Ultimate##245(lines 438 455) no Hoare annotation was computed. [2023-12-16 17:52:36,387 INFO L899 garLoopResultBuilder]: For program point L861(lines 861 873) no Hoare annotation was computed. [2023-12-16 17:52:36,387 INFO L899 garLoopResultBuilder]: For program point L729(lines 729 733) no Hoare annotation was computed. [2023-12-16 17:52:36,387 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 601) no Hoare annotation was computed. [2023-12-16 17:52:36,387 INFO L895 garLoopResultBuilder]: At program point L399(line 399) the Hoare annotation is: false [2023-12-16 17:52:36,387 INFO L899 garLoopResultBuilder]: For program point L333(lines 333 337) no Hoare annotation was computed. [2023-12-16 17:52:36,387 INFO L899 garLoopResultBuilder]: For program point L135(lines 134 480) no Hoare annotation was computed. [2023-12-16 17:52:36,387 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: false [2023-12-16 17:52:36,387 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 66 69) no Hoare annotation was computed. [2023-12-16 17:52:36,387 INFO L899 garLoopResultBuilder]: For program point L928(lines 928 932) no Hoare annotation was computed. [2023-12-16 17:52:36,387 INFO L899 garLoopResultBuilder]: For program point L796(lines 485 837) no Hoare annotation was computed. [2023-12-16 17:52:36,388 INFO L899 garLoopResultBuilder]: For program point L1325(lines 1255 1344) no Hoare annotation was computed. [2023-12-16 17:52:36,388 INFO L899 garLoopResultBuilder]: For program point $Ultimate##305(lines 580 615) no Hoare annotation was computed. [2023-12-16 17:52:36,388 INFO L899 garLoopResultBuilder]: For program point L797(lines 797 801) no Hoare annotation was computed. [2023-12-16 17:52:36,388 INFO L899 garLoopResultBuilder]: For program point L1326(lines 1326 1330) no Hoare annotation was computed. [2023-12-16 17:52:36,388 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 273) no Hoare annotation was computed. [2023-12-16 17:52:36,388 INFO L899 garLoopResultBuilder]: For program point $Ultimate##550(lines 1041 1085) no Hoare annotation was computed. [2023-12-16 17:52:36,388 INFO L899 garLoopResultBuilder]: For program point $Ultimate##311(lines 588 614) no Hoare annotation was computed. [2023-12-16 17:52:36,388 INFO L899 garLoopResultBuilder]: For program point $Ultimate##317(lines 596 613) no Hoare annotation was computed. [2023-12-16 17:52:36,388 INFO L899 garLoopResultBuilder]: For program point L864(lines 864 872) no Hoare annotation was computed. [2023-12-16 17:52:36,388 INFO L899 garLoopResultBuilder]: For program point $Ultimate##556(lines 1049 1084) no Hoare annotation was computed. [2023-12-16 17:52:36,388 INFO L899 garLoopResultBuilder]: For program point L468(lines 460 477) no Hoare annotation was computed. [2023-12-16 17:52:36,388 INFO L899 garLoopResultBuilder]: For program point $Ultimate##562(lines 1057 1083) no Hoare annotation was computed. [2023-12-16 17:52:36,388 INFO L899 garLoopResultBuilder]: For program point $Ultimate##323(lines 604 612) no Hoare annotation was computed. [2023-12-16 17:52:36,388 INFO L899 garLoopResultBuilder]: For program point L667(lines 637 668) no Hoare annotation was computed. [2023-12-16 17:52:36,388 INFO L899 garLoopResultBuilder]: For program point L469(lines 469 473) no Hoare annotation was computed. [2023-12-16 17:52:36,388 INFO L899 garLoopResultBuilder]: For program point L1130(lines 1119 1160) no Hoare annotation was computed. [2023-12-16 17:52:36,388 INFO L899 garLoopResultBuilder]: For program point L1263(lines 1263 1316) no Hoare annotation was computed. [2023-12-16 17:52:36,388 INFO L899 garLoopResultBuilder]: For program point $Ultimate##500(lines 943 960) no Hoare annotation was computed. [2023-12-16 17:52:36,388 INFO L899 garLoopResultBuilder]: For program point L867(lines 867 871) no Hoare annotation was computed. [2023-12-16 17:52:36,388 INFO L899 garLoopResultBuilder]: For program point $Ultimate##506(lines 951 959) no Hoare annotation was computed. [2023-12-16 17:52:36,388 INFO L899 garLoopResultBuilder]: For program point L1264(lines 1264 1268) no Hoare annotation was computed. [2023-12-16 17:52:36,388 INFO L899 garLoopResultBuilder]: For program point L207(lines 177 208) no Hoare annotation was computed. [2023-12-16 17:52:36,388 INFO L899 garLoopResultBuilder]: For program point L1066(lines 1066 1070) no Hoare annotation was computed. [2023-12-16 17:52:36,388 INFO L899 garLoopResultBuilder]: For program point L736(lines 728 745) no Hoare annotation was computed. [2023-12-16 17:52:36,388 INFO L899 garLoopResultBuilder]: For program point L604(lines 485 837) no Hoare annotation was computed. [2023-12-16 17:52:36,389 INFO L899 garLoopResultBuilder]: For program point $Ultimate##518(lines 973 981) no Hoare annotation was computed. [2023-12-16 17:52:36,389 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 459) no Hoare annotation was computed. [2023-12-16 17:52:36,389 INFO L899 garLoopResultBuilder]: For program point L1199(lines 1199 1203) no Hoare annotation was computed. [2023-12-16 17:52:36,389 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 79) no Hoare annotation was computed. [2023-12-16 17:52:36,389 INFO L895 garLoopResultBuilder]: At program point L1001-1(lines 1001 1025) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse2 (= (_ bv3 32) ~m_run_pc~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_req~0 (_ bv1 32))) (.cse5 (= ~c_m_lock~0 (_ bv1 32))) (.cse6 (= (_ bv0 32) ~a_t~0)) (.cse7 (= ~c_req_d~0 (_ bv50 32))) (.cse8 (= ~s_memory0~0 (_ bv50 32))) (.cse9 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse10 (= |ULTIMATE.start_s_run_~req_d~1#1| (_ bv50 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (= ~c_req_a~0 (_ bv0 32)) (= |ULTIMATE.start_s_run_~req_a~1#1| (_ bv0 32)) (= ~c_req_type~0 (_ bv0 32)) .cse1 .cse3 (= (_ bv0 32) ~req_tt_a~0) .cse4 (= (_ bv6 32) ~m_run_pc~0) (= |ULTIMATE.start_s_run_~rsp_d~1#1| (_ bv50 32)) .cse5 .cse6 (= |ULTIMATE.start_s_run_~req_type~1#1| (_ bv0 32)) .cse8 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ~s_run_pc~0 (_ bv0 32)) .cse6 .cse7 .cse8 .cse9 .cse10))) [2023-12-16 17:52:36,389 INFO L899 garLoopResultBuilder]: For program point L737(lines 737 741) no Hoare annotation was computed. [2023-12-16 17:52:36,389 INFO L899 garLoopResultBuilder]: For program point L605(lines 605 609) no Hoare annotation was computed. [2023-12-16 17:52:36,389 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 411) no Hoare annotation was computed. [2023-12-16 17:52:36,389 INFO L899 garLoopResultBuilder]: For program point L341(lines 341 345) no Hoare annotation was computed. [2023-12-16 17:52:36,389 INFO L899 garLoopResultBuilder]: For program point L1134(lines 1134 1141) no Hoare annotation was computed. [2023-12-16 17:52:36,389 INFO L899 garLoopResultBuilder]: For program point L1002(lines 1001 1025) no Hoare annotation was computed. [2023-12-16 17:52:36,389 INFO L899 garLoopResultBuilder]: For program point L936(lines 936 940) no Hoare annotation was computed. [2023-12-16 17:52:36,389 INFO L899 garLoopResultBuilder]: For program point L276(lines 268 285) no Hoare annotation was computed. [2023-12-16 17:52:36,389 INFO L899 garLoopResultBuilder]: For program point L277(lines 277 281) no Hoare annotation was computed. [2023-12-16 17:52:36,389 INFO L895 garLoopResultBuilder]: At program point L145-2(lines 145 173) the Hoare annotation is: (let ((.cse5 (= ~s_run_pc~0 (_ bv0 32))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse11 (= ~c_req_type~0 (_ bv0 32))) (.cse1 (= |ULTIMATE.start_m_run_~req_a~0#1| (_ bv0 32))) (.cse2 (= |ULTIMATE.start_m_run_~a~0#1| (_ bv0 32))) (.cse12 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_req~0 (_ bv1 32))) (.cse13 (= (_ bv0 32) ~a_t~0)) (.cse6 (= |ULTIMATE.start_m_run_~req_type~0#1| (_ bv1 32))) (.cse7 (= ~s_run_st~0 (_ bv2 32))) (.cse8 (= ~c_m_lock~0 (_ bv0 32))) (.cse14 (= |ULTIMATE.start_m_run_~req_d~0#1| (_ bv50 32))) (.cse9 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse10 (= ~m_run_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse13 .cse6 .cse8 .cse14 .cse9 .cse10) (and (= ~s_run_pc~0 (_ bv2 32)) .cse0 .cse11 .cse1 .cse2 .cse12 .cse3 .cse4 .cse13 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10))) [2023-12-16 17:52:36,389 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: false [2023-12-16 17:52:36,389 INFO L899 garLoopResultBuilder]: For program point L79-1(lines 74 82) no Hoare annotation was computed. [2023-12-16 17:52:36,389 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 727) no Hoare annotation was computed. [2023-12-16 17:52:36,389 INFO L899 garLoopResultBuilder]: For program point L146(lines 145 173) no Hoare annotation was computed. [2023-12-16 17:52:36,390 INFO L899 garLoopResultBuilder]: For program point L675(lines 675 679) no Hoare annotation was computed. [2023-12-16 17:52:36,390 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 267) no Hoare annotation was computed. [2023-12-16 17:52:36,390 INFO L899 garLoopResultBuilder]: For program point L1073(lines 876 1106) no Hoare annotation was computed. [2023-12-16 17:52:36,390 INFO L899 garLoopResultBuilder]: For program point L1338(lines 1338 1342) no Hoare annotation was computed. [2023-12-16 17:52:36,390 INFO L895 garLoopResultBuilder]: At program point L1338-1(lines 1255 1344) the Hoare annotation is: (let ((.cse12 (= (_ bv0 32) ~req_tt_a~0)) (.cse15 (= ~s_memory0~0 (_ bv50 32))) (.cse16 (= ~c_req_type~0 (_ bv1 32))) (.cse18 (= ~c_req_d~0 (_ bv50 32))) (.cse5 (= ~c_m_lock~0 (_ bv1 32))) (.cse8 (= (_ bv3 32) ~m_run_pc~0)) (.cse4 (= (_ bv6 32) ~m_run_pc~0)) (.cse17 (= ~s_run_pc~0 (_ bv0 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse10 (= ~c_req_a~0 (_ bv0 32))) (.cse11 (= ~c_req_type~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse2 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse3 (= ~m_run_st~0 (_ bv0 32))) (.cse13 (= ~c_empty_req~0 (_ bv1 32))) (.cse14 (= (_ bv0 32) ~a_t~0)) (.cse6 (= ~s_run_st~0 (_ bv2 32))) (.cse9 (= ~c_m_lock~0 (_ bv0 32))) (.cse7 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse19 (= ~m_run_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse6 .cse9 .cse7) (and .cse0 .cse10 .cse11 .cse1 .cse2 .cse12 .cse3 .cse13 .cse4 (= ~c_rsp_d~0 (_ bv50 32)) .cse5 .cse14 .cse6 .cse15) (and .cse0 .cse10 .cse11 .cse1 .cse2 .cse12 .cse4 .cse5 .cse14 .cse15 .cse7) (and .cse10 .cse8 .cse2 .cse3 .cse16 .cse5 .cse17 .cse6 .cse7) (and .cse10 .cse1 .cse8 .cse2 .cse16 .cse5 .cse17 .cse14 .cse18 .cse7) (and .cse0 .cse8 .cse2 .cse13 .cse5 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse13 .cse5 .cse14 .cse18 .cse6 .cse15) (and .cse0 .cse10 .cse1 .cse8 .cse2 .cse16 .cse5 .cse14 .cse18 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse10 .cse2 .cse13 .cse17 .cse6 .cse9 .cse7 .cse19) (and .cse0 .cse8 .cse2 .cse13 .cse9 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse6 .cse9 .cse7) (and .cse10 .cse11 .cse1 .cse2 .cse13 .cse17 .cse14 .cse9 .cse7 .cse19) (and .cse0 .cse10 .cse11 .cse1 .cse2 .cse3 .cse13 .cse14 .cse6 .cse9 .cse7 .cse19))) [2023-12-16 17:52:36,390 INFO L899 garLoopResultBuilder]: For program point L1272(lines 1272 1276) no Hoare annotation was computed. [2023-12-16 17:52:36,390 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 219) no Hoare annotation was computed. [2023-12-16 17:52:36,390 INFO L899 garLoopResultBuilder]: For program point L1074(lines 1074 1078) no Hoare annotation was computed. [2023-12-16 17:52:36,390 INFO L895 garLoopResultBuilder]: At program point L876-1(lines 876 1106) the Hoare annotation is: (let ((.cse6 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse1 (= ~c_req_type~0 (_ bv0 32))) (.cse2 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse7 (= (_ bv3 32) ~m_run_pc~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_req~0 (_ bv1 32))) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse5 (= (_ bv0 32) ~a_t~0)) (.cse9 (= ~c_req_d~0 (_ bv50 32))) (.cse10 (= ~s_memory0~0 (_ bv50 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~c_m_lock~0 (_ bv0 32)) .cse6 (= ~m_run_pc~0 (_ bv0 32))) (and .cse0 .cse2 .cse7 .cse3 (= ~c_req_type~0 (_ bv1 32)) .cse8 (= ~s_run_pc~0 (_ bv0 32)) .cse5 .cse9 .cse6) (and (= ~s_run_pc~0 (_ bv2 32)) .cse0 (= |ULTIMATE.start_s_run_~req_a~1#1| (_ bv0 32)) .cse1 .cse2 .cse3 (= (_ bv0 32) ~req_tt_a~0) .cse4 (= (_ bv6 32) ~m_run_pc~0) (= ~c_rsp_d~0 (_ bv50 32)) (= |ULTIMATE.start_s_run_~rsp_d~1#1| (_ bv50 32)) .cse8 .cse5 (= |ULTIMATE.start_s_run_~req_type~1#1| (_ bv0 32)) .cse10) (and .cse2 .cse7 .cse3 .cse4 .cse8 .cse5 .cse9 .cse10 (= |ULTIMATE.start_s_run_~req_d~1#1| (_ bv50 32))))) [2023-12-16 17:52:36,390 INFO L899 garLoopResultBuilder]: For program point L1207(lines 1207 1211) no Hoare annotation was computed. [2023-12-16 17:52:36,390 INFO L899 garLoopResultBuilder]: For program point L811(lines 811 815) no Hoare annotation was computed. [2023-12-16 17:52:36,390 INFO L899 garLoopResultBuilder]: For program point L481(lines 133 482) no Hoare annotation was computed. [2023-12-16 17:52:36,390 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2023-12-16 17:52:36,390 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 353) no Hoare annotation was computed. [2023-12-16 17:52:36,390 INFO L899 garLoopResultBuilder]: For program point L944(lines 944 948) no Hoare annotation was computed. [2023-12-16 17:52:36,391 INFO L899 garLoopResultBuilder]: For program point start_simulation_returnLabel#1(lines 1167 1350) no Hoare annotation was computed. [2023-12-16 17:52:36,391 INFO L895 garLoopResultBuilder]: At program point L879-1(lines 879 903) the Hoare annotation is: (let ((.cse14 (= ~c_req_type~0 (_ bv1 32))) (.cse0 (= ~c_req_a~0 (_ bv0 32))) (.cse1 (= ~c_req_type~0 (_ bv0 32))) (.cse9 (= (_ bv0 32) ~req_tt_a~0)) (.cse10 (= (_ bv6 32) ~m_run_pc~0)) (.cse8 (= ~s_run_pc~0 (_ bv2 32))) (.cse6 (= ~c_m_lock~0 (_ bv0 32))) (.cse7 (= ~c_empty_rsp~0 (_ bv1 32))) (.cse2 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse13 (= (_ bv3 32) ~m_run_pc~0)) (.cse3 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_req~0 (_ bv1 32))) (.cse11 (= ~c_m_lock~0 (_ bv1 32))) (.cse5 (= (_ bv0 32) ~a_t~0)) (.cse15 (= ~c_req_d~0 (_ bv50 32))) (.cse12 (= ~s_memory0~0 (_ bv50 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~m_run_pc~0 (_ bv0 32))) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse9 .cse10 .cse11 .cse5 .cse12 .cse7) (and .cse0 .cse2 .cse13 .cse3 .cse14 .cse11 (= ~s_run_pc~0 (_ bv0 32)) .cse5 .cse15 .cse7) (and .cse8 .cse13 .cse3 .cse4 .cse11 .cse7) (and .cse8 .cse0 .cse2 .cse13 .cse3 .cse14 .cse11 .cse5 .cse15 .cse7) (and .cse8 .cse0 (= |ULTIMATE.start_s_run_~req_a~1#1| (_ bv0 32)) .cse1 .cse2 .cse3 .cse9 .cse4 .cse10 (= ~c_rsp_d~0 (_ bv50 32)) (= |ULTIMATE.start_s_run_~rsp_d~1#1| (_ bv50 32)) .cse11 .cse5 (= |ULTIMATE.start_s_run_~req_type~1#1| (_ bv0 32)) .cse12) (and .cse8 .cse13 .cse3 .cse4 .cse6 .cse7) (and .cse2 .cse13 .cse3 .cse4 .cse11 .cse5 .cse15 .cse12 (= |ULTIMATE.start_s_run_~req_d~1#1| (_ bv50 32))))) [2023-12-16 17:52:36,391 INFO L899 garLoopResultBuilder]: For program point L747(lines 747 753) no Hoare annotation was computed. [2023-12-16 17:52:36,391 INFO L899 garLoopResultBuilder]: For program point L747-1(lines 747 753) no Hoare annotation was computed. [2023-12-16 17:52:36,391 INFO L899 garLoopResultBuilder]: For program point L880(lines 879 903) no Hoare annotation was computed. [2023-12-16 17:52:36,391 INFO L895 garLoopResultBuilder]: At program point L1145(lines 1119 1160) the Hoare annotation is: (let ((.cse15 (= ~c_req_d~0 (_ bv50 32))) (.cse9 (= (_ bv0 32) ~req_tt_a~0)) (.cse3 (= (_ bv6 32) ~m_run_pc~0)) (.cse11 (= ~s_memory0~0 (_ bv50 32))) (.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse8 (= ~c_req_type~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse17 (= ~c_empty_req~0 (_ bv1 32))) (.cse10 (= (_ bv0 32) ~a_t~0)) (.cse16 (= ~c_m_lock~0 (_ bv0 32))) (.cse18 (= ~m_run_pc~0 (_ bv0 32))) (.cse7 (= ~c_req_a~0 (_ bv0 32))) (.cse12 (= (_ bv3 32) ~m_run_pc~0)) (.cse2 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse13 (= ~c_req_type~0 (_ bv1 32))) (.cse4 (= ~c_m_lock~0 (_ bv1 32))) (.cse14 (= ~s_run_pc~0 (_ bv0 32))) (.cse5 (= ~s_run_st~0 (_ bv2 32))) (.cse6 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 .cse10 .cse11 .cse6) (and .cse7 .cse1 .cse12 .cse2 .cse13 .cse4 .cse14 .cse10 .cse15 .cse6) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse16 .cse6) (and .cse0 .cse12 .cse2 .cse17 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse17 .cse3 .cse5 .cse16 .cse6) (and .cse0 .cse1 .cse12 .cse2 .cse17 .cse4 .cse10 .cse15 .cse5 .cse11) (and .cse0 .cse7 .cse8 .cse1 .cse2 .cse17 .cse10 .cse5 .cse16 .cse6 .cse18) (and .cse0 .cse7 .cse1 .cse12 .cse2 .cse13 .cse4 .cse10 .cse15 .cse6) (and .cse0 .cse7 .cse8 .cse1 .cse2 .cse9 .cse17 .cse3 (= ~c_rsp_d~0 (_ bv50 32)) .cse4 .cse10 .cse5 .cse11) (and .cse7 .cse2 .cse17 .cse14 .cse5 .cse16 .cse6 .cse18) (and .cse0 .cse12 .cse2 .cse17 .cse16 .cse6) (and .cse0 .cse1 .cse12 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse1 .cse2 .cse17 .cse14 .cse10 .cse16 .cse6 .cse18) (and .cse7 .cse12 .cse2 .cse13 .cse4 .cse14 .cse5 .cse6))) [2023-12-16 17:52:36,391 INFO L895 garLoopResultBuilder]: At program point L749(line 749) the Hoare annotation is: false [2023-12-16 17:52:36,391 INFO L899 garLoopResultBuilder]: For program point L683(lines 683 687) no Hoare annotation was computed. [2023-12-16 17:52:36,391 INFO L895 garLoopResultBuilder]: At program point L485-2(lines 485 837) the Hoare annotation is: (let ((.cse0 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse2 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_req~0 (_ bv1 32))) (.cse4 (= (_ bv0 32) ~a_t~0)) (.cse5 (= ~s_run_st~0 (_ bv2 32))) (.cse6 (= ~c_m_lock~0 (_ bv0 32))) (.cse7 (= ~c_empty_rsp~0 (_ bv1 32)))) (or (and .cse0 (= |ULTIMATE.start_m_run_~a~0#1| (_ bv0 32)) .cse1 (= (_ bv3 32) ~m_run_pc~0) .cse2 .cse3 .cse4 (= ~c_req_d~0 (_ bv50 32)) .cse5 .cse6 (= ~s_memory0~0 (_ bv50 32)) .cse7) (and .cse0 (= |ULTIMATE.start_m_run_~a~0#1| (_ bv1 32)) .cse1 .cse2 .cse3 (= (_ bv6 32) ~m_run_pc~0) .cse4 .cse5 .cse6 .cse7))) [2023-12-16 17:52:36,391 INFO L899 garLoopResultBuilder]: For program point $Ultimate##176(lines 332 376) no Hoare annotation was computed. [2023-12-16 17:52:36,391 INFO L899 garLoopResultBuilder]: For program point L486(lines 485 837) no Hoare annotation was computed. [2023-12-16 17:52:36,392 INFO L895 garLoopResultBuilder]: At program point L288-2(lines 288 316) the Hoare annotation is: (let ((.cse4 (= ~c_req_a~0 (_ bv0 32))) (.cse15 (= (_ bv3 32) ~m_run_pc~0)) (.cse6 (= (_ bv2 32) ~c_write_rsp_ev~0)) (.cse7 (= ~c_req_type~0 (_ bv1 32))) (.cse8 (= ~c_m_lock~0 (_ bv1 32))) (.cse9 (= ~s_run_pc~0 (_ bv0 32))) (.cse11 (= ~c_empty_rsp~0 (_ bv1 32)))) (let ((.cse2 (= (_ bv0 32) ~a_t~0)) (.cse3 (= ~c_req_d~0 (_ bv50 32))) (.cse16 (= ~c_empty_req~0 (_ bv1 32))) (.cse18 (= ~c_m_lock~0 (_ bv0 32))) (.cse14 (= ~s_run_pc~0 (_ bv2 32))) (.cse1 (= (_ bv2 32) ~c_write_req_ev~0)) (.cse5 (= |ULTIMATE.start_m_run_~req_a~0#1| (_ bv0 32))) (.cse0 (= |ULTIMATE.start_m_run_~a~0#1| (_ bv0 32))) (.cse10 (= |ULTIMATE.start_m_run_~req_type~0#1| (_ bv1 32))) (.cse12 (= ~m_run_pc~0 (_ bv0 32))) (.cse13 (and .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse11)) (.cse17 (= ~s_run_st~0 (_ bv2 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (or (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13)) (and .cse14 .cse0 .cse1 .cse15 .cse6 .cse16 .cse8 .cse2 .cse3 .cse17 (= ~s_memory0~0 (_ bv50 32))) (and .cse14 .cse1 .cse6 .cse17 .cse18 .cse11) (and .cse14 .cse15 .cse6 .cse16 .cse8 .cse11) (and .cse14 .cse0 .cse1 (or (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11) (and .cse4 .cse15 .cse6 .cse7 .cse8 .cse11)) .cse2 .cse3) (and .cse14 .cse15 .cse6 .cse16 .cse18 .cse11) (and .cse14 .cse1 .cse6 .cse8 .cse17 .cse11) (and (or (and .cse4 .cse5 .cse0 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13) .cse17)))) [2023-12-16 17:52:36,396 INFO L899 garLoopResultBuilder]: For program point $Ultimate##182(lines 340 375) no Hoare annotation was computed. [2023-12-16 17:52:36,396 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 623) no Hoare annotation was computed. [2023-12-16 17:52:36,396 INFO L899 garLoopResultBuilder]: For program point $Ultimate##188(lines 348 374) no Hoare annotation was computed. [2023-12-16 17:52:36,396 INFO L899 garLoopResultBuilder]: For program point L289(lines 288 316) no Hoare annotation was computed. [2023-12-16 17:52:36,396 INFO L899 garLoopResultBuilder]: For program point L1280(lines 1280 1284) no Hoare annotation was computed. [2023-12-16 17:52:36,396 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 227) no Hoare annotation was computed. [2023-12-16 17:52:36,396 INFO L899 garLoopResultBuilder]: For program point $Ultimate##50(lines 1244 1252) no Hoare annotation was computed. [2023-12-16 17:52:36,396 INFO L899 garLoopResultBuilder]: For program point L818(lines 810 827) no Hoare annotation was computed. [2023-12-16 17:52:36,396 INFO L899 garLoopResultBuilder]: For program point $Ultimate##194(lines 356 373) no Hoare annotation was computed. [2023-12-16 17:52:36,396 INFO L899 garLoopResultBuilder]: For program point L1215(lines 1215 1219) no Hoare annotation was computed. [2023-12-16 17:52:36,396 INFO L899 garLoopResultBuilder]: For program point L1149(lines 1149 1156) no Hoare annotation was computed. [2023-12-16 17:52:36,396 INFO L899 garLoopResultBuilder]: For program point L951(lines 876 1106) no Hoare annotation was computed. [2023-12-16 17:52:36,396 INFO L899 garLoopResultBuilder]: For program point L819(lines 819 823) no Hoare annotation was computed. [2023-12-16 17:52:36,396 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2023-12-16 17:52:36,396 INFO L899 garLoopResultBuilder]: For program point L357(lines 357 361) no Hoare annotation was computed. [2023-12-16 17:52:36,396 INFO L899 garLoopResultBuilder]: For program point L952(lines 952 956) no Hoare annotation was computed. [2023-12-16 17:52:36,396 INFO L899 garLoopResultBuilder]: For program point $Ultimate##38(lines 1222 1230) no Hoare annotation was computed. [2023-12-16 17:52:36,396 INFO L899 garLoopResultBuilder]: For program point $Ultimate##32(lines 1214 1231) no Hoare annotation was computed. [2023-12-16 17:52:36,397 INFO L899 garLoopResultBuilder]: For program point $Ultimate##132(lines 238 264) no Hoare annotation was computed. [2023-12-16 17:52:36,397 INFO L899 garLoopResultBuilder]: For program point $Ultimate##373(lines 706 723) no Hoare annotation was computed. [2023-12-16 17:52:36,397 INFO L899 garLoopResultBuilder]: For program point $Ultimate##379(lines 714 722) no Hoare annotation was computed. [2023-12-16 17:52:36,397 INFO L899 garLoopResultBuilder]: For program point $Ultimate##138(lines 246 263) no Hoare annotation was computed. [2023-12-16 17:52:36,397 INFO L899 garLoopResultBuilder]: For program point $Ultimate##26(lines 1206 1232) no Hoare annotation was computed. [2023-12-16 17:52:36,397 INFO L899 garLoopResultBuilder]: For program point L557(lines 527 558) no Hoare annotation was computed. [2023-12-16 17:52:36,397 INFO L899 garLoopResultBuilder]: For program point $Ultimate##144(lines 254 262) no Hoare annotation was computed. [2023-12-16 17:52:36,397 INFO L899 garLoopResultBuilder]: For program point $Ultimate##20(lines 1198 1233) no Hoare annotation was computed. [2023-12-16 17:52:36,397 INFO L899 garLoopResultBuilder]: For program point L756(lines 756 809) no Hoare annotation was computed. [2023-12-16 17:52:36,397 INFO L899 garLoopResultBuilder]: For program point $Ultimate##391(lines 736 744) no Hoare annotation was computed. [2023-12-16 17:52:36,397 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 17:52:36,397 INFO L899 garLoopResultBuilder]: For program point $Ultimate##14(lines 1190 1234) no Hoare annotation was computed. [2023-12-16 17:52:36,397 INFO L899 garLoopResultBuilder]: For program point $Ultimate##156(lines 276 284) no Hoare annotation was computed. [2023-12-16 17:52:36,397 INFO L899 garLoopResultBuilder]: For program point L757(lines 757 761) no Hoare annotation was computed. [2023-12-16 17:52:36,397 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 695) no Hoare annotation was computed. [2023-12-16 17:52:36,397 INFO L899 garLoopResultBuilder]: For program point L1088(lines 1088 1092) no Hoare annotation was computed. [2023-12-16 17:52:36,397 INFO L899 garLoopResultBuilder]: For program point $Ultimate##568(lines 1065 1082) no Hoare annotation was computed. [2023-12-16 17:52:36,397 INFO L899 garLoopResultBuilder]: For program point eval_returnLabel#1(lines 1113 1166) no Hoare annotation was computed. [2023-12-16 17:52:36,397 INFO L899 garLoopResultBuilder]: For program point L626(lines 618 635) no Hoare annotation was computed. [2023-12-16 17:52:36,397 INFO L899 garLoopResultBuilder]: For program point $Ultimate##335(lines 626 634) no Hoare annotation was computed. [2023-12-16 17:52:36,397 INFO L899 garLoopResultBuilder]: For program point $Ultimate##574(lines 1073 1081) no Hoare annotation was computed. [2023-12-16 17:52:36,397 INFO L899 garLoopResultBuilder]: For program point L627(lines 627 631) no Hoare annotation was computed. [2023-12-16 17:52:36,397 INFO L895 garLoopResultBuilder]: At program point L495-2(lines 495 523) the Hoare annotation is: (and (= ~s_run_pc~0 (_ bv2 32)) (= |ULTIMATE.start_m_run_~a~0#1| (_ bv0 32)) (= (_ bv2 32) ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| (_ bv0 32)) (= (_ bv3 32) ~m_run_pc~0) (= (_ bv2 32) ~c_write_rsp_ev~0) (= ~c_empty_req~0 (_ bv1 32)) (= (_ bv0 32) ~a_t~0) (= ~c_req_d~0 (_ bv50 32)) (= ~s_run_st~0 (_ bv2 32)) (= ~c_m_lock~0 (_ bv0 32)) (= ~s_memory0~0 (_ bv50 32)) (= ~c_empty_rsp~0 (_ bv1 32)) (= |ULTIMATE.start_m_run_~req_type___0~0#1| (_ bv0 32))) [2023-12-16 17:52:36,397 INFO L899 garLoopResultBuilder]: For program point L1288(lines 1288 1292) no Hoare annotation was computed. [2023-12-16 17:52:36,398 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 235) no Hoare annotation was computed. [2023-12-16 17:52:36,398 INFO L899 garLoopResultBuilder]: For program point L1222(lines 1170 1349) no Hoare annotation was computed. [2023-12-16 17:52:36,398 INFO L899 garLoopResultBuilder]: For program point $Ultimate##586(lines 1095 1103) no Hoare annotation was computed. [2023-12-16 17:52:36,398 INFO L899 garLoopResultBuilder]: For program point L496(lines 495 523) no Hoare annotation was computed. [2023-12-16 17:52:36,398 INFO L899 garLoopResultBuilder]: For program point L364(lines 134 480) no Hoare annotation was computed. [2023-12-16 17:52:36,398 INFO L899 garLoopResultBuilder]: For program point L1223(lines 1223 1227) no Hoare annotation was computed. [2023-12-16 17:52:36,398 INFO L899 garLoopResultBuilder]: For program point $Ultimate##355(lines 682 726) no Hoare annotation was computed. [2023-12-16 17:52:36,398 INFO L899 garLoopResultBuilder]: For program point L431(lines 431 435) no Hoare annotation was computed. [2023-12-16 17:52:36,398 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 369) no Hoare annotation was computed. [2023-12-16 17:52:36,398 INFO L899 garLoopResultBuilder]: For program point $Ultimate##120(lines 222 266) no Hoare annotation was computed. [2023-12-16 17:52:36,398 INFO L899 garLoopResultBuilder]: For program point $Ultimate##361(lines 690 725) no Hoare annotation was computed. [2023-12-16 17:52:36,398 INFO L899 garLoopResultBuilder]: For program point $Ultimate##126(lines 230 265) no Hoare annotation was computed. [2023-12-16 17:52:36,399 INFO L899 garLoopResultBuilder]: For program point $Ultimate##367(lines 698 724) no Hoare annotation was computed. [2023-12-16 17:52:36,399 INFO L899 garLoopResultBuilder]: For program point L1026(lines 1000 1027) no Hoare annotation was computed. [2023-12-16 17:52:36,399 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2023-12-16 17:52:36,399 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 16 23) the Hoare annotation is: true [2023-12-16 17:52:36,399 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2023-12-16 17:52:36,401 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:52:36,403 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 17:52:36,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 05:52:36 BoogieIcfgContainer [2023-12-16 17:52:36,443 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 17:52:36,444 INFO L158 Benchmark]: Toolchain (without parser) took 22185.92ms. Allocated memory was 287.3MB in the beginning and 685.8MB in the end (delta: 398.5MB). Free memory was 236.5MB in the beginning and 378.1MB in the end (delta: -141.5MB). Peak memory consumption was 398.9MB. Max. memory is 8.0GB. [2023-12-16 17:52:36,444 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 181.4MB. Free memory is still 131.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 17:52:36,444 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.41ms. Allocated memory is still 287.3MB. Free memory was 236.2MB in the beginning and 214.1MB in the end (delta: 22.1MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-16 17:52:36,444 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.33ms. Allocated memory is still 287.3MB. Free memory was 214.1MB in the beginning and 210.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 17:52:36,444 INFO L158 Benchmark]: Boogie Preprocessor took 63.09ms. Allocated memory is still 287.3MB. Free memory was 210.6MB in the beginning and 205.8MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 17:52:36,444 INFO L158 Benchmark]: RCFGBuilder took 869.14ms. Allocated memory is still 287.3MB. Free memory was 205.8MB in the beginning and 199.6MB in the end (delta: 6.3MB). Peak memory consumption was 18.1MB. Max. memory is 8.0GB. [2023-12-16 17:52:36,444 INFO L158 Benchmark]: TraceAbstraction took 20881.79ms. Allocated memory was 287.3MB in the beginning and 685.8MB in the end (delta: 398.5MB). Free memory was 199.1MB in the beginning and 378.1MB in the end (delta: -179.0MB). Peak memory consumption was 360.9MB. Max. memory is 8.0GB. [2023-12-16 17:52:36,445 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.14ms. Allocated memory is still 181.4MB. Free memory is still 131.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 307.41ms. Allocated memory is still 287.3MB. Free memory was 236.2MB in the beginning and 214.1MB in the end (delta: 22.1MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.33ms. Allocated memory is still 287.3MB. Free memory was 214.1MB in the beginning and 210.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 63.09ms. Allocated memory is still 287.3MB. Free memory was 210.6MB in the beginning and 205.8MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 869.14ms. Allocated memory is still 287.3MB. Free memory was 205.8MB in the beginning and 199.6MB in the end (delta: 6.3MB). Peak memory consumption was 18.1MB. Max. memory is 8.0GB. * TraceAbstraction took 20881.79ms. Allocated memory was 287.3MB in the beginning and 685.8MB in the end (delta: 398.5MB). Free memory was 199.1MB in the beginning and 378.1MB in the end (delta: -179.0MB). Peak memory consumption was 360.9MB. 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 2 procedures, 247 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.8s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7478 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7478 mSDsluCounter, 23642 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14266 mSDsCounter, 389 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2395 IncrementalHoareTripleChecker+Invalid, 2784 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 389 mSolverCounterUnsat, 9376 mSDtfsCounter, 2395 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2425 GetRequests, 2331 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8004occurred in iteration=15, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 6443 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 111 PreInvPairs, 243 NumberOfFragments, 2296 HoareAnnotationTreeSize, 111 FormulaSimplifications, 24970 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 19 FormulaSimplificationsInter, 12747 FormulaSimplificationTreeSizeReductionInter, 4.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2043 NumberOfCodeBlocks, 2043 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2385 ConstructedInterpolants, 0 QuantifiedInterpolants, 5327 SizeOfPredicates, 29 NumberOfNonLiveVariables, 4430 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 24 InterpolantComputations, 20 PerfectInterpolantSequences, 366/476 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: 485]: Loop Invariant Derived loop invariant: (((((((((((((s_run_pc == 2) && (a == 0)) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (0 == a_t)) && (c_req_d == 50)) && (s_run_st == 2)) && (c_m_lock == 0)) && (s_memory0 == 50)) && (c_empty_rsp == 1)) || ((((((((((s_run_pc == 2) && (a == 1)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (6 == m_run_pc)) && (0 == a_t)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1))) - InvariantResult [Line: 495]: Loop Invariant Derived loop invariant: ((((((((((((((s_run_pc == 2) && (a == 0)) && (2 == c_write_req_ev)) && (req_a___0 == 0)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (0 == a_t)) && (c_req_d == 50)) && (s_run_st == 2)) && (c_m_lock == 0)) && (s_memory0 == 50)) && (c_empty_rsp == 1)) && (req_type___0 == 0)) - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: ((((((((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (c_req_type == 0)) && (a == 0)) && (2 == c_write_req_ev)) && (req_a___0 == 0)) && (2 == c_write_rsp_ev)) && (0 == req_tt_a)) && (c_empty_req == 1)) && (6 == m_run_pc)) && (c_rsp_d == 50)) && (c_m_lock == 1)) && (0 == a_t)) && (s_run_st == 2)) && (s_memory0 == 50)) || ((((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (6 == m_run_pc)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1))) || (((((((((((s_run_pc == 2) && (c_req_a == 0)) && (c_req_type == 0)) && (a == 0)) && (2 == c_write_req_ev)) && (req_a___0 == 0)) && (2 == c_write_rsp_ev)) && (c_m_lock == 1)) && (0 == a_t)) && (s_memory0 == 50)) && (c_empty_rsp == 1))) || ((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_m_lock == 1)) && (s_run_st == 2)) && (c_empty_rsp == 1))) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: (((((((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (c_req_type == 0)) && (req_a == 0)) && (a == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (0 == a_t)) && (req_type == 1)) && (s_run_st == 2)) && (req_d == 50)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || (((((((((((c_req_a == 0) && (req_a == 0)) && (a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (req_type == 1)) && (s_run_st == 2)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((((((((c_req_a == 0) && (c_req_type == 0)) && (req_a == 0)) && (a == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (0 == a_t)) && (req_type == 1)) && (req_d == 50)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) - InvariantResult [Line: 1255]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (m_run_st == 0)) && (6 == m_run_pc)) && (c_m_lock == 1)) && (s_run_st == 2)) && (c_empty_rsp == 1)) || ((((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (m_run_st == 0)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1))) || ((((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (0 == req_tt_a)) && (m_run_st == 0)) && (c_empty_req == 1)) && (6 == m_run_pc)) && (c_rsp_d == 50)) && (c_m_lock == 1)) && (0 == a_t)) && (s_run_st == 2)) && (s_memory0 == 50))) || (((((((((((s_run_pc == 2) && (c_req_a == 0)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (0 == req_tt_a)) && (6 == m_run_pc)) && (c_m_lock == 1)) && (0 == a_t)) && (s_memory0 == 50)) && (c_empty_rsp == 1))) || (((((((((c_req_a == 0) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (m_run_st == 0)) && (c_req_type == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (s_run_st == 2)) && (c_empty_rsp == 1))) || ((((((((((c_req_a == 0) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (0 == a_t)) && (c_req_d == 50)) && (c_empty_rsp == 1))) || ((((((s_run_pc == 2) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (c_empty_rsp == 1))) || (((((((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (m_run_st == 0)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (0 == a_t)) && (c_req_d == 50)) && (s_run_st == 2)) && (s_memory0 == 50))) || ((((((((((s_run_pc == 2) && (c_req_a == 0)) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (0 == a_t)) && (c_req_d == 50)) && (c_empty_rsp == 1))) || ((((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (m_run_st == 0)) && (c_m_lock == 1)) && (s_run_st == 2)) && (c_empty_rsp == 1))) || ((((((((c_req_a == 0) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (s_run_pc == 0)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((s_run_pc == 2) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 0)) && (c_empty_rsp == 1))) || (((((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (m_run_st == 0)) && (c_empty_req == 1)) && (6 == m_run_pc)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1))) || ((((((((((c_req_a == 0) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (s_run_pc == 0)) && (0 == a_t)) && (c_m_lock == 0)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (m_run_st == 0)) && (c_empty_req == 1)) && (0 == a_t)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((((((((((a == 0) && (2 == c_write_req_ev)) && (0 == a_t)) && (c_req_d == 50)) && ((((((((((c_req_a == 0) && (req_a == 0)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (req_type == 1)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || (((((((c_req_a == 0) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (c_empty_rsp == 1)))) || (((((((((((s_run_pc == 2) && (a == 0)) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (0 == a_t)) && (c_req_d == 50)) && (s_run_st == 2)) && (s_memory0 == 50))) || ((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1))) || ((((((s_run_pc == 2) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (c_empty_rsp == 1))) || ((((((s_run_pc == 2) && (a == 0)) && (2 == c_write_req_ev)) && ((((((((c_req_a == 0) && (req_a == 0)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (req_type == 1)) && (c_empty_rsp == 1)) || ((((((c_req_a == 0) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (c_empty_rsp == 1)))) && (0 == a_t)) && (c_req_d == 50))) || ((((((s_run_pc == 2) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 0)) && (c_empty_rsp == 1))) || ((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_m_lock == 1)) && (s_run_st == 2)) && (c_empty_rsp == 1))) || ((((((((((((c_req_a == 0) && (req_a == 0)) && (a == 0)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (req_type == 1)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || (((((((c_req_a == 0) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (c_empty_rsp == 1))) && (s_run_st == 2))) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((((((((((((c_req_a == 0) && (req_a == 0)) && (a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (s_run_pc == 0)) && (req_type == 1)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || ((((((((((((((c_req_a == 0) && (c_req_type == 0)) && (req_a == 0)) && (a == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (s_run_pc == 0)) && (0 == a_t)) && (req_type == 1)) && (c_m_lock == 0)) && (req_d == 50)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (c_req_type == 0)) && (req_a == 0)) && (a == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (0 == a_t)) && (req_type == 1)) && (s_run_st == 2)) && (c_m_lock == 0)) && (req_d == 50)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) - InvariantResult [Line: 879]: Loop Invariant Derived loop invariant: ((((((((((((((((c_req_a == 0) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (0 == a_t)) && (c_m_lock == 0)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || (((((((((((s_run_pc == 2) && (c_req_a == 0)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (0 == req_tt_a)) && (6 == m_run_pc)) && (c_m_lock == 1)) && (0 == a_t)) && (s_memory0 == 50)) && (c_empty_rsp == 1))) || ((((((((((c_req_a == 0) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (0 == a_t)) && (c_req_d == 50)) && (c_empty_rsp == 1))) || ((((((s_run_pc == 2) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (c_empty_rsp == 1))) || ((((((((((s_run_pc == 2) && (c_req_a == 0)) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (0 == a_t)) && (c_req_d == 50)) && (c_empty_rsp == 1))) || (((((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (req_a == 0)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (0 == req_tt_a)) && (c_empty_req == 1)) && (6 == m_run_pc)) && (c_rsp_d == 50)) && (rsp_d == 50)) && (c_m_lock == 1)) && (0 == a_t)) && (req_type == 0)) && (s_memory0 == 50))) || ((((((s_run_pc == 2) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 0)) && (c_empty_rsp == 1))) || (((((((((2 == c_write_req_ev) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (0 == a_t)) && (c_req_d == 50)) && (s_memory0 == 50)) && (req_d == 50))) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((((((s_run_pc == 2) && (a == 1)) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (0 == a_t)) && (c_req_d == 50)) && (s_run_st == 2)) && (c_m_lock == 0)) && (s_memory0 == 50)) && (c_empty_rsp == 1)) || ((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (c_req_type == 0)) && (a == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (0 == a_t)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((((c_req_a == 0) && (c_req_type == 0)) && (a == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (s_run_pc == 0)) && (0 == a_t)) && (c_m_lock == 0)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((c_req_a == 0) && (a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (s_run_pc == 0)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) - InvariantResult [Line: 876]: Loop Invariant Derived loop invariant: ((((((((((((c_req_a == 0) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (0 == a_t)) && (c_m_lock == 0)) && (c_empty_rsp == 1)) && (m_run_pc == 0)) || ((((((((((c_req_a == 0) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (0 == a_t)) && (c_req_d == 50)) && (c_empty_rsp == 1))) || (((((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (req_a == 0)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (0 == req_tt_a)) && (c_empty_req == 1)) && (6 == m_run_pc)) && (c_rsp_d == 50)) && (rsp_d == 50)) && (c_m_lock == 1)) && (0 == a_t)) && (req_type == 0)) && (s_memory0 == 50))) || (((((((((2 == c_write_req_ev) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (0 == a_t)) && (c_req_d == 50)) && (s_memory0 == 50)) && (req_d == 50))) - InvariantResult [Line: 1001]: Loop Invariant Derived loop invariant: (((((((((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (0 == a_t)) && (c_req_d == 50)) && (s_memory0 == 50)) && (c_empty_rsp == 1)) && (req_d == 50)) || (((((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (req_a == 0)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (0 == req_tt_a)) && (c_empty_req == 1)) && (6 == m_run_pc)) && (rsp_d == 50)) && (c_m_lock == 1)) && (0 == a_t)) && (req_type == 0)) && (s_memory0 == 50)) && (c_empty_rsp == 1))) || (((((((((((2 == c_write_req_ev) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (0 == a_t)) && (c_req_d == 50)) && (s_memory0 == 50)) && (c_empty_rsp == 1)) && (req_d == 50))) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((((((((((s_run_pc == 2) && (a == 0)) && (2 == c_write_req_ev)) && (req_a___0 == 0)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (0 == a_t)) && (c_req_d == 50)) && (s_run_st == 2)) && (s_memory0 == 50)) && (c_empty_rsp == 1)) && (req_type___0 == 0)) - InvariantResult [Line: 1119]: Loop Invariant Derived loop invariant: (((((((((((((((((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (6 == m_run_pc)) && (c_m_lock == 1)) && (s_run_st == 2)) && (c_empty_rsp == 1)) || (((((((((((s_run_pc == 2) && (c_req_a == 0)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (0 == req_tt_a)) && (6 == m_run_pc)) && (c_m_lock == 1)) && (0 == a_t)) && (s_memory0 == 50)) && (c_empty_rsp == 1))) || ((((((((((c_req_a == 0) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (0 == a_t)) && (c_req_d == 50)) && (c_empty_rsp == 1))) || (((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1))) || ((((((s_run_pc == 2) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (c_empty_rsp == 1))) || ((((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (6 == m_run_pc)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1))) || ((((((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 1)) && (0 == a_t)) && (c_req_d == 50)) && (s_run_st == 2)) && (s_memory0 == 50))) || (((((((((((s_run_pc == 2) && (c_req_a == 0)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (0 == a_t)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((((s_run_pc == 2) && (c_req_a == 0)) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (0 == a_t)) && (c_req_d == 50)) && (c_empty_rsp == 1))) || (((((((((((((s_run_pc == 2) && (c_req_a == 0)) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (0 == req_tt_a)) && (c_empty_req == 1)) && (6 == m_run_pc)) && (c_rsp_d == 50)) && (c_m_lock == 1)) && (0 == a_t)) && (s_run_st == 2)) && (s_memory0 == 50))) || ((((((((c_req_a == 0) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (s_run_pc == 0)) && (s_run_st == 2)) && (c_m_lock == 0)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((s_run_pc == 2) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (c_m_lock == 0)) && (c_empty_rsp == 1))) || (((((((s_run_pc == 2) && (2 == c_write_req_ev)) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_m_lock == 1)) && (s_run_st == 2)) && (c_empty_rsp == 1))) || ((((((((((c_req_a == 0) && (c_req_type == 0)) && (2 == c_write_req_ev)) && (2 == c_write_rsp_ev)) && (c_empty_req == 1)) && (s_run_pc == 0)) && (0 == a_t)) && (c_m_lock == 0)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((c_req_a == 0) && (3 == m_run_pc)) && (2 == c_write_rsp_ev)) && (c_req_type == 1)) && (c_m_lock == 1)) && (s_run_pc == 0)) && (s_run_st == 2)) && (c_empty_rsp == 1))) RESULT: Ultimate proved your program to be correct! [2023-12-16 17:52:36,467 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...