/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/loops/invert_string-3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 22:07:30,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 22:07:30,113 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-24 22:07:30,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 22:07:30,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 22:07:30,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 22:07:30,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 22:07:30,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 22:07:30,141 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 22:07:30,143 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 22:07:30,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 22:07:30,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 22:07:30,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 22:07:30,145 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 22:07:30,145 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 22:07:30,146 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 22:07:30,146 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 22:07:30,146 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 22:07:30,146 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 22:07:30,146 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 22:07:30,146 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 22:07:30,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 22:07:30,147 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 22:07:30,147 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 22:07:30,147 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 22:07:30,147 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 22:07:30,147 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 22:07:30,147 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 22:07:30,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 22:07:30,148 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 22:07:30,148 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 22:07:30,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 22:07:30,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 22:07:30,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 22:07:30,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 22:07:30,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 22:07:30,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 22:07:30,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 22:07:30,149 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 22:07:30,149 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 22:07:30,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 22:07:30,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 22:07:30,150 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 22:07:30,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 22:07:30,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 22:07:30,150 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 22:07:30,150 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-24 22:07:30,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 22:07:30,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 22:07:30,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 22:07:30,332 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 22:07:30,334 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 22:07:30,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string-3.c [2023-12-24 22:07:31,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 22:07:31,448 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 22:07:31,448 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c [2023-12-24 22:07:31,454 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cb1d1d8d/6d41ac848f464b49b36da905feb156be/FLAG57a2c397f [2023-12-24 22:07:31,469 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cb1d1d8d/6d41ac848f464b49b36da905feb156be [2023-12-24 22:07:31,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 22:07:31,472 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 22:07:31,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 22:07:31,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 22:07:31,478 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 22:07:31,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 10:07:31" (1/1) ... [2023-12-24 22:07:31,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48246ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:31, skipping insertion in model container [2023-12-24 22:07:31,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 10:07:31" (1/1) ... [2023-12-24 22:07:31,493 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 22:07:31,584 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c[327,340] [2023-12-24 22:07:31,596 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 22:07:31,604 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 22:07:31,614 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c[327,340] [2023-12-24 22:07:31,619 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 22:07:31,634 INFO L206 MainTranslator]: Completed translation [2023-12-24 22:07:31,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:31 WrapperNode [2023-12-24 22:07:31,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 22:07:31,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 22:07:31,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 22:07:31,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 22:07:31,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:31" (1/1) ... [2023-12-24 22:07:31,647 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:31" (1/1) ... [2023-12-24 22:07:31,659 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2023-12-24 22:07:31,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 22:07:31,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 22:07:31,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 22:07:31,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 22:07:31,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:31" (1/1) ... [2023-12-24 22:07:31,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:31" (1/1) ... [2023-12-24 22:07:31,670 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:31" (1/1) ... [2023-12-24 22:07:31,679 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 4, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2023-12-24 22:07:31,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:31" (1/1) ... [2023-12-24 22:07:31,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:31" (1/1) ... [2023-12-24 22:07:31,686 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:31" (1/1) ... [2023-12-24 22:07:31,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:31" (1/1) ... [2023-12-24 22:07:31,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:31" (1/1) ... [2023-12-24 22:07:31,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:31" (1/1) ... [2023-12-24 22:07:31,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 22:07:31,692 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 22:07:31,692 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 22:07:31,693 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 22:07:31,693 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:31" (1/1) ... [2023-12-24 22:07:31,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 22:07:31,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 22:07:31,715 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-24 22:07:31,737 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-24 22:07:31,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 22:07:31,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 22:07:31,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 22:07:31,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-24 22:07:31,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 22:07:31,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 22:07:31,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 22:07:31,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-24 22:07:31,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 22:07:31,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 22:07:31,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 22:07:31,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 22:07:31,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-24 22:07:31,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 22:07:31,822 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 22:07:31,823 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 22:07:32,031 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 22:07:32,065 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 22:07:32,065 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-24 22:07:32,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 10:07:32 BoogieIcfgContainer [2023-12-24 22:07:32,065 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 22:07:32,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 22:07:32,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 22:07:32,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 22:07:32,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 10:07:31" (1/3) ... [2023-12-24 22:07:32,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab446ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 10:07:32, skipping insertion in model container [2023-12-24 22:07:32,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:07:31" (2/3) ... [2023-12-24 22:07:32,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab446ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 10:07:32, skipping insertion in model container [2023-12-24 22:07:32,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 10:07:32" (3/3) ... [2023-12-24 22:07:32,071 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string-3.c [2023-12-24 22:07:32,083 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 22:07:32,083 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 22:07:32,112 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 22:07:32,117 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;@7fb3b445, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 22:07:32,117 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 22:07:32,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 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-24 22:07:32,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-24 22:07:32,124 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:32,125 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:32,125 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:32,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:32,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1223517790, now seen corresponding path program 1 times [2023-12-24 22:07:32,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:32,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42378088] [2023-12-24 22:07:32,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:07:32,138 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-24 22:07:32,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:32,139 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-24 22:07:32,142 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-24 22:07:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:07:32,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 22:07:32,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:32,259 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-24 22:07:32,259 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:07:32,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:32,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42378088] [2023-12-24 22:07:32,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42378088] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:07:32,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:07:32,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 22:07:32,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080179719] [2023-12-24 22:07:32,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:07:32,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 22:07:32,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:32,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 22:07:32,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 22:07:32,286 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 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) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-24 22:07:32,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:32,326 INFO L93 Difference]: Finished difference Result 23 states and 35 transitions. [2023-12-24 22:07:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 22:07:32,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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) Word has length 8 [2023-12-24 22:07:32,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:32,338 INFO L225 Difference]: With dead ends: 23 [2023-12-24 22:07:32,338 INFO L226 Difference]: Without dead ends: 11 [2023-12-24 22:07:32,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-24 22:07:32,342 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:32,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:07:32,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-24 22:07:32,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-24 22:07:32,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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-24 22:07:32,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2023-12-24 22:07:32,362 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2023-12-24 22:07:32,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:32,363 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2023-12-24 22:07:32,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-24 22:07:32,363 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2023-12-24 22:07:32,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-24 22:07:32,363 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:32,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:32,366 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-24 22:07:32,564 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-24 22:07:32,564 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:32,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:32,565 INFO L85 PathProgramCache]: Analyzing trace with hash -602022382, now seen corresponding path program 1 times [2023-12-24 22:07:32,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:32,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724184227] [2023-12-24 22:07:32,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:07:32,566 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-24 22:07:32,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:32,567 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-24 22:07:32,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 (3)] Waiting until timeout for monitored process [2023-12-24 22:07:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:07:32,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 22:07:32,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:32,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:32,650 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:07:32,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:07:32,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:32,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724184227] [2023-12-24 22:07:32,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724184227] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:07:32,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:07:32,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-24 22:07:32,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119662392] [2023-12-24 22:07:32,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:07:32,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 22:07:32,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:32,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 22:07:32,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-24 22:07:32,685 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-24 22:07:32,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:32,760 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2023-12-24 22:07:32,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 22:07:32,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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) Word has length 9 [2023-12-24 22:07:32,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:32,762 INFO L225 Difference]: With dead ends: 22 [2023-12-24 22:07:32,762 INFO L226 Difference]: Without dead ends: 14 [2023-12-24 22:07:32,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-24 22:07:32,763 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:32,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 11 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:07:32,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-24 22:07:32,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-12-24 22:07:32,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-24 22:07:32,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2023-12-24 22:07:32,766 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2023-12-24 22:07:32,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:32,767 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2023-12-24 22:07:32,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-24 22:07:32,767 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2023-12-24 22:07:32,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-24 22:07:32,767 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:32,767 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:32,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 22:07:32,968 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-24 22:07:32,968 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:32,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:32,969 INFO L85 PathProgramCache]: Analyzing trace with hash -853036194, now seen corresponding path program 2 times [2023-12-24 22:07:32,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:32,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033911017] [2023-12-24 22:07:32,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:07:32,970 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-24 22:07:32,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:32,971 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-24 22:07:32,973 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-24 22:07:33,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-24 22:07:33,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:07:33,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 22:07:33,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:33,039 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-24 22:07:33,040 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:07:33,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:33,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033911017] [2023-12-24 22:07:33,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033911017] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:07:33,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:07:33,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 22:07:33,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209267862] [2023-12-24 22:07:33,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:07:33,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 22:07:33,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:33,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 22:07:33,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 22:07:33,041 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-24 22:07:33,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:33,074 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2023-12-24 22:07:33,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 22:07:33,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 12 [2023-12-24 22:07:33,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:33,075 INFO L225 Difference]: With dead ends: 21 [2023-12-24 22:07:33,075 INFO L226 Difference]: Without dead ends: 15 [2023-12-24 22:07:33,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 22:07:33,076 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:33,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 7 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:07:33,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-24 22:07:33,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-24 22:07:33,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-24 22:07:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-12-24 22:07:33,080 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2023-12-24 22:07:33,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:33,080 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-12-24 22:07:33,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-24 22:07:33,080 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-12-24 22:07:33,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-24 22:07:33,081 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:33,081 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:33,085 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-24 22:07:33,282 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-24 22:07:33,283 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:33,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:33,283 INFO L85 PathProgramCache]: Analyzing trace with hash 491847555, now seen corresponding path program 1 times [2023-12-24 22:07:33,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:33,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661611572] [2023-12-24 22:07:33,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:07:33,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:07:33,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:33,289 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-24 22:07:33,293 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-24 22:07:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:07:33,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 22:07:33,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 22:07:33,399 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:07:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 22:07:33,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:33,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661611572] [2023-12-24 22:07:33,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661611572] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:07:33,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:07:33,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-24 22:07:33,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627085062] [2023-12-24 22:07:33,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:07:33,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 22:07:33,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:33,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 22:07:33,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-24 22:07:33,549 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 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-24 22:07:33,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:33,639 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2023-12-24 22:07:33,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 22:07:33,640 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 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) Word has length 13 [2023-12-24 22:07:33,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:33,640 INFO L225 Difference]: With dead ends: 25 [2023-12-24 22:07:33,641 INFO L226 Difference]: Without dead ends: 16 [2023-12-24 22:07:33,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-24 22:07:33,642 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:33,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 29 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:07:33,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-24 22:07:33,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-12-24 22:07:33,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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-24 22:07:33,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2023-12-24 22:07:33,645 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2023-12-24 22:07:33,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:33,645 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2023-12-24 22:07:33,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 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-24 22:07:33,645 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2023-12-24 22:07:33,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-24 22:07:33,645 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:33,645 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:33,659 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-24 22:07:33,846 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-24 22:07:33,846 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:33,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:33,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1274755151, now seen corresponding path program 2 times [2023-12-24 22:07:33,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:33,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836858135] [2023-12-24 22:07:33,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:07:33,847 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-24 22:07:33,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:33,848 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-24 22:07:33,849 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-24 22:07:33,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 22:07:33,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:07:33,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 22:07:33,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:33,932 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-24 22:07:33,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:07:33,978 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-24 22:07:33,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:33,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836858135] [2023-12-24 22:07:33,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [836858135] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:07:33,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:07:33,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-24 22:07:33,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336055826] [2023-12-24 22:07:33,979 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:07:33,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 22:07:33,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:33,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 22:07:33,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-24 22:07:33,981 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-24 22:07:34,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:34,074 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2023-12-24 22:07:34,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 22:07:34,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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) Word has length 14 [2023-12-24 22:07:34,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:34,075 INFO L225 Difference]: With dead ends: 30 [2023-12-24 22:07:34,075 INFO L226 Difference]: Without dead ends: 24 [2023-12-24 22:07:34,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2023-12-24 22:07:34,076 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 24 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:34,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 22 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:07:34,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-24 22:07:34,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2023-12-24 22:07:34,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-24 22:07:34,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2023-12-24 22:07:34,080 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2023-12-24 22:07:34,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:34,080 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2023-12-24 22:07:34,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-24 22:07:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2023-12-24 22:07:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-24 22:07:34,080 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:34,081 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:34,086 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-24 22:07:34,283 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-24 22:07:34,284 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:34,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:34,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1508665262, now seen corresponding path program 3 times [2023-12-24 22:07:34,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:34,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107119417] [2023-12-24 22:07:34,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 22:07:34,285 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-24 22:07:34,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:34,286 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-24 22:07:34,286 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-24 22:07:34,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-24 22:07:34,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:07:34,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 22:07:34,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-24 22:07:34,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:07:34,568 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-24 22:07:34,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:34,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2107119417] [2023-12-24 22:07:34,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2107119417] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:07:34,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:07:34,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-12-24 22:07:34,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342283484] [2023-12-24 22:07:34,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:07:34,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-24 22:07:34,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:34,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-24 22:07:34,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-12-24 22:07:34,570 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-24 22:07:34,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:34,893 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2023-12-24 22:07:34,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 22:07:34,893 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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) Word has length 17 [2023-12-24 22:07:34,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:34,894 INFO L225 Difference]: With dead ends: 52 [2023-12-24 22:07:34,894 INFO L226 Difference]: Without dead ends: 46 [2023-12-24 22:07:34,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2023-12-24 22:07:34,895 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 160 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:34,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 60 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:07:34,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-24 22:07:34,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 25. [2023-12-24 22:07:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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-24 22:07:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-12-24 22:07:34,900 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2023-12-24 22:07:34,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:34,900 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-12-24 22:07:34,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-24 22:07:34,900 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-12-24 22:07:34,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-24 22:07:34,900 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:34,900 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:34,908 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-24 22:07:35,100 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-24 22:07:35,101 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:35,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:35,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1642182927, now seen corresponding path program 4 times [2023-12-24 22:07:35,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:35,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1560524071] [2023-12-24 22:07:35,102 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-24 22:07:35,102 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-24 22:07:35,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:35,103 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-24 22:07:35,103 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-24 22:07:35,192 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-24 22:07:35,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:07:35,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-24 22:07:35,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:35,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-24 22:07:35,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2023-12-24 22:07:35,540 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 22:07:35,541 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:07:35,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:07:35,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2023-12-24 22:07:35,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2023-12-24 22:07:35,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2023-12-24 22:07:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-24 22:07:35,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:35,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1560524071] [2023-12-24 22:07:35,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1560524071] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:07:35,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:07:35,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 23 [2023-12-24 22:07:35,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438705247] [2023-12-24 22:07:35,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:07:35,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-24 22:07:35,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:35,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-24 22:07:35,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2023-12-24 22:07:35,869 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 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-24 22:07:36,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:36,527 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2023-12-24 22:07:36,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-24 22:07:36,527 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 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) Word has length 18 [2023-12-24 22:07:36,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:36,528 INFO L225 Difference]: With dead ends: 81 [2023-12-24 22:07:36,528 INFO L226 Difference]: Without dead ends: 79 [2023-12-24 22:07:36,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=1387, Unknown=0, NotChecked=0, Total=1640 [2023-12-24 22:07:36,529 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 196 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:36,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 196 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 22:07:36,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-24 22:07:36,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 28. [2023-12-24 22:07:36,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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-24 22:07:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-12-24 22:07:36,535 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 18 [2023-12-24 22:07:36,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:36,535 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-12-24 22:07:36,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 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-24 22:07:36,535 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-12-24 22:07:36,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-24 22:07:36,536 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:36,536 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:36,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-24 22:07:36,739 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-24 22:07:36,740 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:36,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:36,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1695728595, now seen corresponding path program 1 times [2023-12-24 22:07:36,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:36,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684128778] [2023-12-24 22:07:36,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:07:36,743 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-24 22:07:36,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:36,743 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-24 22:07:36,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-24 22:07:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:07:36,848 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-24 22:07:36,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:37,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-24 22:07:37,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-12-24 22:07:37,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:07:37,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 59 [2023-12-24 22:07:37,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:07:37,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 35 [2023-12-24 22:07:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-24 22:07:37,316 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:07:37,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:07:37,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 54 [2023-12-24 22:07:37,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2023-12-24 22:07:37,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 76 [2023-12-24 22:07:37,834 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-24 22:07:37,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:37,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684128778] [2023-12-24 22:07:37,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684128778] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:07:37,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:07:37,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 24 [2023-12-24 22:07:37,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030019167] [2023-12-24 22:07:37,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:07:37,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-24 22:07:37,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:37,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-24 22:07:37,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2023-12-24 22:07:37,835 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 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-24 22:07:42,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-24 22:07:46,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 22:07:50,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 22:07:51,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:51,406 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2023-12-24 22:07:51,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-24 22:07:51,406 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 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) Word has length 21 [2023-12-24 22:07:51,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:51,408 INFO L225 Difference]: With dead ends: 74 [2023-12-24 22:07:51,408 INFO L226 Difference]: Without dead ends: 72 [2023-12-24 22:07:51,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=311, Invalid=1851, Unknown=0, NotChecked=0, Total=2162 [2023-12-24 22:07:51,409 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 108 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 33 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:51,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 192 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 383 Invalid, 3 Unknown, 0 Unchecked, 12.7s Time] [2023-12-24 22:07:51,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-24 22:07:51,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 31. [2023-12-24 22:07:51,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 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-24 22:07:51,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2023-12-24 22:07:51,415 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 21 [2023-12-24 22:07:51,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:51,415 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2023-12-24 22:07:51,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 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-24 22:07:51,415 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2023-12-24 22:07:51,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-24 22:07:51,416 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:51,416 INFO L195 NwaCegarLoop]: trace histogram [10, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:51,424 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 (9)] Ended with exit code 0 [2023-12-24 22:07:51,622 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-24 22:07:51,622 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:51,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:51,622 INFO L85 PathProgramCache]: Analyzing trace with hash 2107877170, now seen corresponding path program 5 times [2023-12-24 22:07:51,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:51,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619208980] [2023-12-24 22:07:51,623 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-24 22:07:51,623 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-24 22:07:51,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:51,624 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-24 22:07:51,624 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-24 22:07:51,718 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-12-24 22:07:51,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:07:51,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 22:07:51,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 10 proven. 45 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-24 22:07:51,804 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:07:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-24 22:07:52,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:52,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619208980] [2023-12-24 22:07:52,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619208980] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:07:52,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:07:52,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2023-12-24 22:07:52,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598908127] [2023-12-24 22:07:52,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:07:52,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-24 22:07:52,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:52,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-24 22:07:52,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2023-12-24 22:07:52,260 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 25 states, 25 states have (on average 1.36) internal successors, (34), 24 states have internal predecessors, (34), 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-24 22:07:52,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:52,589 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2023-12-24 22:07:52,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 22:07:52,590 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.36) internal successors, (34), 24 states have internal predecessors, (34), 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) Word has length 23 [2023-12-24 22:07:52,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:52,590 INFO L225 Difference]: With dead ends: 62 [2023-12-24 22:07:52,590 INFO L226 Difference]: Without dead ends: 35 [2023-12-24 22:07:52,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=252, Invalid=740, Unknown=0, NotChecked=0, Total=992 [2023-12-24 22:07:52,591 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 182 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:52,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 63 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 22:07:52,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-24 22:07:52,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2023-12-24 22:07:52,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 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-24 22:07:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2023-12-24 22:07:52,597 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 23 [2023-12-24 22:07:52,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:52,597 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2023-12-24 22:07:52,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.36) internal successors, (34), 24 states have internal predecessors, (34), 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-24 22:07:52,597 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2023-12-24 22:07:52,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-24 22:07:52,598 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:52,598 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:52,603 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-24 22:07:52,801 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-24 22:07:52,801 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:52,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:52,802 INFO L85 PathProgramCache]: Analyzing trace with hash -40076209, now seen corresponding path program 2 times [2023-12-24 22:07:52,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:52,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060324894] [2023-12-24 22:07:52,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:07:52,802 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-24 22:07:52,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:52,803 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-24 22:07:52,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 (11)] Waiting until timeout for monitored process [2023-12-24 22:07:52,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 22:07:52,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:07:52,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-24 22:07:52,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:53,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-24 22:07:53,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-12-24 22:07:53,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:07:53,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 46 [2023-12-24 22:07:53,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:07:53,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 84 [2023-12-24 22:07:53,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:07:53,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 40 [2023-12-24 22:07:53,515 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-24 22:07:53,516 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:07:54,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:07:54,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 86 [2023-12-24 22:07:54,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2023-12-24 22:07:54,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 360 treesize of output 350 [2023-12-24 22:07:54,385 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-24 22:07:54,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:07:54,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060324894] [2023-12-24 22:07:54,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060324894] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:07:54,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:07:54,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2023-12-24 22:07:54,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134050872] [2023-12-24 22:07:54,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:07:54,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-24 22:07:54,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:07:54,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-24 22:07:54,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2023-12-24 22:07:54,386 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 25 states have internal predecessors, (41), 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-24 22:07:55,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:07:55,639 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2023-12-24 22:07:55,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-24 22:07:55,639 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 25 states have internal predecessors, (41), 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) Word has length 24 [2023-12-24 22:07:55,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:07:55,639 INFO L225 Difference]: With dead ends: 35 [2023-12-24 22:07:55,639 INFO L226 Difference]: Without dead ends: 33 [2023-12-24 22:07:55,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=234, Invalid=1172, Unknown=0, NotChecked=0, Total=1406 [2023-12-24 22:07:55,640 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 55 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 22:07:55,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 79 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 22:07:55,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-24 22:07:55,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2023-12-24 22:07:55,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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-24 22:07:55,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2023-12-24 22:07:55,647 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 24 [2023-12-24 22:07:55,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:07:55,647 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2023-12-24 22:07:55,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 25 states have internal predecessors, (41), 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-24 22:07:55,647 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2023-12-24 22:07:55,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-24 22:07:55,648 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:07:55,648 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:07:55,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-24 22:07:55,851 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-24 22:07:55,852 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:07:55,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:07:55,852 INFO L85 PathProgramCache]: Analyzing trace with hash 95727853, now seen corresponding path program 3 times [2023-12-24 22:07:55,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:07:55,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799440368] [2023-12-24 22:07:55,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 22:07:55,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:07:55,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:07:55,853 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-24 22:07:55,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-24 22:07:56,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-24 22:07:56,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:07:56,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-24 22:07:56,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:07:56,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-24 22:07:56,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-12-24 22:07:56,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:07:56,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 46 [2023-12-24 22:07:56,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:07:56,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 62 [2023-12-24 22:07:56,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:07:56,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 69 [2023-12-24 22:07:56,817 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 22:07:56,817 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:08:27,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:08:27,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 75 treesize of output 126 [2023-12-24 22:08:27,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2023-12-24 22:08:27,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2954 treesize of output 2914 [2023-12-24 22:08:28,618 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 22:08:28,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:08:28,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799440368] [2023-12-24 22:08:28,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1799440368] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:08:28,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:08:28,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2023-12-24 22:08:28,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584330387] [2023-12-24 22:08:28,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:08:28,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-24 22:08:28,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:08:28,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-24 22:08:28,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=961, Unknown=6, NotChecked=0, Total=1122 [2023-12-24 22:08:28,620 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 34 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 33 states have internal predecessors, (53), 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-24 22:08:34,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-24 22:08:38,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-24 22:08:42,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-24 22:08:46,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-24 22:08:50,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-24 22:08:51,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:08:51,120 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2023-12-24 22:08:51,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-24 22:08:51,121 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 33 states have internal predecessors, (53), 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) Word has length 27 [2023-12-24 22:08:51,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:08:51,121 INFO L225 Difference]: With dead ends: 33 [2023-12-24 22:08:51,121 INFO L226 Difference]: Without dead ends: 31 [2023-12-24 22:08:51,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 33.0s TimeCoverageRelationStatistics Valid=387, Invalid=1863, Unknown=6, NotChecked=0, Total=2256 [2023-12-24 22:08:51,122 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 87 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 43 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:08:51,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 73 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 392 Invalid, 5 Unknown, 0 Unchecked, 21.1s Time] [2023-12-24 22:08:51,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-24 22:08:51,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-24 22:08:51,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.0) internal successors, (30), 30 states have internal predecessors, (30), 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-24 22:08:51,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 30 transitions. [2023-12-24 22:08:51,129 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 30 transitions. Word has length 27 [2023-12-24 22:08:51,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:08:51,130 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 30 transitions. [2023-12-24 22:08:51,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 33 states have internal predecessors, (53), 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-24 22:08:51,130 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 30 transitions. [2023-12-24 22:08:51,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-24 22:08:51,130 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:08:51,130 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:08:51,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-12-24 22:08:51,334 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-24 22:08:51,335 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:08:51,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:08:51,335 INFO L85 PathProgramCache]: Analyzing trace with hash -24653937, now seen corresponding path program 4 times [2023-12-24 22:08:51,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:08:51,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565181988] [2023-12-24 22:08:51,335 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-24 22:08:51,336 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-24 22:08:51,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:08:51,337 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-24 22:08:51,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-24 22:08:51,498 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-24 22:08:51,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:08:51,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-24 22:08:51,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:08:51,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-24 22:08:51,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-24 22:08:51,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-12-24 22:08:51,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:08:51,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 46 [2023-12-24 22:08:51,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:08:51,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 62 [2023-12-24 22:08:51,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:08:51,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 78 [2023-12-24 22:08:52,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:08:52,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 114 treesize of output 162 [2023-12-24 22:08:52,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:08:52,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 81 treesize of output 53 [2023-12-24 22:08:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-24 22:08:52,809 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:09:42,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 87 [2023-12-24 22:09:42,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71474 treesize of output 71154 [2023-12-24 22:09:55,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 171 [2023-12-24 22:09:55,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 22:09:55,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 254 treesize of output 282 [2023-12-24 22:09:56,166 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-24 22:09:56,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:09:56,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [565181988] [2023-12-24 22:09:56,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [565181988] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:09:56,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:09:56,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 31 [2023-12-24 22:09:56,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398610926] [2023-12-24 22:09:56,166 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:09:56,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-24 22:09:56,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:09:56,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-24 22:09:56,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=868, Unknown=14, NotChecked=0, Total=992 [2023-12-24 22:09:56,167 INFO L87 Difference]: Start difference. First operand 31 states and 30 transitions. Second operand has 32 states, 32 states have (on average 1.71875) internal successors, (55), 31 states have internal predecessors, (55), 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-24 22:10:18,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-24 22:10:20,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-24 22:10:22,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-24 22:10:26,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:10:26,827 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2023-12-24 22:10:26,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-24 22:10:26,827 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.71875) internal successors, (55), 31 states have internal predecessors, (55), 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) Word has length 30 [2023-12-24 22:10:26,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:10:26,828 INFO L225 Difference]: With dead ends: 31 [2023-12-24 22:10:26,828 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 22:10:26,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 82.6s TimeCoverageRelationStatistics Valid=323, Invalid=1825, Unknown=14, NotChecked=0, Total=2162 [2023-12-24 22:10:26,829 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 57 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2023-12-24 22:10:26,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 58 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2023-12-24 22:10:26,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 22:10:26,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 22:10:26,829 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-24 22:10:26,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 22:10:26,829 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2023-12-24 22:10:26,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:10:26,829 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 22:10:26,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.71875) internal successors, (55), 31 states have internal predecessors, (55), 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-24 22:10:26,829 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 22:10:26,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 22:10:26,834 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 22:10:26,846 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-24 22:10:27,039 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-24 22:10:27,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 22:13:54,346 WARN L293 SmtUtils]: Spent 3.41m on a formula simplification. DAG size of input: 300 DAG size of output: 216 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 22:13:54,349 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2023-12-24 22:13:54,350 INFO L895 garLoopResultBuilder]: At program point L32-3(lines 32 35) the Hoare annotation is: (let ((.cse13 (select |#memory_int#1| |ULTIMATE.start_main_~#str1~0#1.base|)) (.cse17 (select |#memory_int#2| |ULTIMATE.start_main_~#str2~0#1.base|))) (let ((.cse12 (select .cse17 (_ bv4 32))) (.cse16 (select .cse13 (_ bv4 32))) (.cse15 (select .cse17 (_ bv3 32)))) (let ((.cse14 (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse13 (_ bv1 32)))) .cse15)) (.cse0 (= (select .cse17 (_ bv0 32)) ((_ sign_extend 24) ((_ extract 7 0) .cse16)))) (.cse1 (= (_ bv5 32) |ULTIMATE.start_main_~max~0#1|)) (.cse2 (= |ULTIMATE.start_main_~#str1~0#1.offset| (_ bv0 32))) (.cse3 (= (select .cse17 (_ bv1 32)) ((_ sign_extend 24) ((_ extract 7 0) (select .cse13 (_ bv3 32)))))) (.cse4 (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse13 (_ bv2 32)))) (select .cse17 (_ bv2 32)))) (.cse5 (= ((_ sign_extend 24) (_ bv0 8)) .cse16)) (.cse6 (= |ULTIMATE.start_main_~#str2~0#1.offset| (_ bv0 32))) (.cse7 (exists ((|v_ULTIMATE.start_main_~i~0#1_198| (_ BitVec 32))) (= .cse15 ((_ sign_extend 24) ((_ extract 7 0) (select .cse13 |v_ULTIMATE.start_main_~i~0#1_198|)))))) (.cse8 (exists ((|v_ULTIMATE.start_main_~i~0#1_150| (_ BitVec 32))) (= .cse12 ((_ sign_extend 24) ((_ extract 7 0) (select .cse13 |v_ULTIMATE.start_main_~i~0#1_150|))))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~j~0#1| (_ bv2 32)) .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~j~0#1| (_ bv0 32)) .cse8 (= (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)) (let ((.cse9 (bvsge (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967287 32)) (_ bv0 32))) (.cse11 (bvsge (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967288 32)) (_ bv0 32))) (.cse10 (bvsge (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967289 32)) (_ bv0 32)))) (and (bvsge |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (or (not .cse9) (bvsge (bvadd (_ bv4294967286 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32))) (or (not (bvsge (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967290 32)) (_ bv0 32))) .cse10) .cse1 (or .cse9 (not .cse11)) .cse2 (or .cse11 (not .cse10)) .cse6 (bvsge (bvadd (_ bv4294967291 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32)))) (and .cse0 (= (_ bv4 32) |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) .cse1 (= .cse12 ((_ sign_extend 24) ((_ extract 7 0) (select .cse13 (_ bv0 32))))) .cse2 .cse14 .cse3 .cse4 .cse5 .cse6) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) .cse1 .cse2 .cse14 (= |ULTIMATE.start_main_~j~0#1| (_ bv3 32)) .cse3 .cse4 .cse5 .cse6 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_main_~i~0#1| (_ bv3 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv1 32)) .cse7 .cse8))))) [2023-12-24 22:13:54,350 INFO L899 garLoopResultBuilder]: For program point L32-4(lines 32 35) no Hoare annotation was computed. [2023-12-24 22:13:54,350 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2023-12-24 22:13:54,350 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 22:13:54,350 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 22:13:54,351 INFO L895 garLoopResultBuilder]: At program point L26-3(lines 26 29) the Hoare annotation is: (let ((.cse2 (select |#memory_int#1| |ULTIMATE.start_main_~#str1~0#1.base|))) (let ((.cse1 (select |#memory_int#2| |ULTIMATE.start_main_~#str2~0#1.base|)) (.cse19 (select .cse2 (_ bv4 32)))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) .cse19))) (.cse12 ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 (_ bv2 32))))) (.cse15 (select .cse1 (_ bv2 32))) (.cse9 ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 (_ bv3 32))))) (.cse18 (select .cse1 (_ bv3 32)))) (let ((.cse16 (exists ((|v_ULTIMATE.start_main_~i~0#1_198| (_ BitVec 32))) (= .cse18 ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 |v_ULTIMATE.start_main_~i~0#1_198|)))))) (.cse3 ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 (_ bv1 32))))) (.cse11 (= (select .cse1 (_ bv1 32)) .cse9)) (.cse17 (= .cse12 .cse15)) (.cse0 (= (select .cse1 (_ bv0 32)) .cse4)) (.cse8 (= (_ bv5 32) |ULTIMATE.start_main_~max~0#1|)) (.cse10 (= |ULTIMATE.start_main_~#str1~0#1.offset| (_ bv0 32))) (.cse13 (= ((_ sign_extend 24) (_ bv0 8)) .cse19)) (.cse14 (= |ULTIMATE.start_main_~#str2~0#1.offset| (_ bv0 32)))) (or (let ((.cse7 ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 (_ bv0 32))))) (.cse5 (bvadd |ULTIMATE.start_main_~j~0#1| (_ bv1 32))) (.cse6 (bvadd |ULTIMATE.start_main_~j~0#1| (_ bv2 32)))) (and .cse0 (forall ((v_subst_1 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (store .cse1 |ULTIMATE.start_main_~j~0#1| ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 v_subst_1)))) (_ bv3 32)))) .cse3)) (= .cse3 ((_ sign_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |ULTIMATE.start_main_~j~0#1| (_ bv4294967294 32)))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_209| (_ BitVec 32)) (v_subst_10 (_ BitVec 32)) (|v_ULTIMATE.start_main_~i~0#1_210| (_ BitVec 32))) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) (select (store (store (store .cse1 |ULTIMATE.start_main_~j~0#1| ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 v_subst_10)))) .cse5 ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 |v_ULTIMATE.start_main_~i~0#1_210|)))) .cse6 ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 |v_ULTIMATE.start_main_~i~0#1_209|)))) (_ bv0 32)))))) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse1 (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~j~0#1|)))) .cse7) .cse8 (forall ((|v_ULTIMATE.start_main_~i~0#1_183| (_ BitVec 32)) (v_subst_6 (_ BitVec 32)) (|v_ULTIMATE.start_main_~i~0#1_182| (_ BitVec 32))) (= .cse9 ((_ sign_extend 24) ((_ extract 7 0) (select (store (store (store .cse1 |ULTIMATE.start_main_~j~0#1| ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 v_subst_6)))) .cse5 ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 |v_ULTIMATE.start_main_~i~0#1_183|)))) .cse6 ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 |v_ULTIMATE.start_main_~i~0#1_182|)))) (_ bv1 32)))))) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse1 (bvadd (_ bv4294967292 32) |ULTIMATE.start_main_~j~0#1|)))) .cse9) (= (select .cse1 (_ bv4 32)) .cse7) .cse10 .cse11 (forall ((v_subst_3 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (store .cse1 |ULTIMATE.start_main_~j~0#1| ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 v_subst_3)))) (_ bv2 32)))) .cse12)) (forall ((v_subst_4 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (store .cse1 |ULTIMATE.start_main_~j~0#1| ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 v_subst_4)))) (_ bv1 32)))) .cse9)) .cse13 (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse1 (bvadd |ULTIMATE.start_main_~j~0#1| (_ bv4294967293 32))))) .cse12) .cse14 (exists ((|v_ULTIMATE.start_main_~i~0#1_172| (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 |v_ULTIMATE.start_main_~i~0#1_172|))) .cse15)) .cse16 (forall ((|v_ULTIMATE.start_main_~i~0#1_209| (_ BitVec 32)) (v_subst_7 (_ BitVec 32))) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) (select (store (store .cse1 |ULTIMATE.start_main_~j~0#1| ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 v_subst_7)))) .cse5 ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 |v_ULTIMATE.start_main_~i~0#1_209|)))) (_ bv0 32)))))) (= (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32)) (forall ((|v_ULTIMATE.start_main_~i~0#1_209| (_ BitVec 32)) (v_subst_9 (_ BitVec 32)) (|v_ULTIMATE.start_main_~i~0#1_211| (_ BitVec 32)) (|v_ULTIMATE.start_main_~i~0#1_210| (_ BitVec 32))) (= .cse4 ((_ sign_extend 24) ((_ extract 7 0) (select (store (store (store (store .cse1 |ULTIMATE.start_main_~j~0#1| ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 v_subst_9)))) .cse5 ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 |v_ULTIMATE.start_main_~i~0#1_211|)))) .cse6 ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 |v_ULTIMATE.start_main_~i~0#1_210|)))) (bvadd |ULTIMATE.start_main_~j~0#1| (_ bv3 32)) ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 |v_ULTIMATE.start_main_~i~0#1_209|)))) (_ bv0 32)))))) (forall ((v_subst_8 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) (select (store .cse1 |ULTIMATE.start_main_~j~0#1| ((_ sign_extend 24) ((_ extract 7 0) (select .cse2 v_subst_8)))) (_ bv0 32)))) .cse4)))) (and .cse0 .cse8 .cse10 .cse11 (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) .cse13 .cse14 (= |ULTIMATE.start_main_~j~0#1| (_ bv2 32))) (and .cse0 (= (_ bv4 32) |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) .cse8 .cse10 .cse11 .cse17 .cse13 .cse14 .cse16 (= .cse3 ((_ sign_extend 24) ((_ extract 7 0) .cse18)))) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) .cse8 .cse10 (= |ULTIMATE.start_main_~j~0#1| (_ bv3 32)) .cse11 .cse17 .cse13 .cse14) (and .cse8 .cse10 .cse13 .cse14 (= |ULTIMATE.start_main_~j~0#1| (_ bv0 32)) (= (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)) (and .cse0 .cse8 .cse10 .cse13 .cse14 (= |ULTIMATE.start_main_~i~0#1| (_ bv3 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv1 32)))))))) [2023-12-24 22:13:54,351 INFO L899 garLoopResultBuilder]: For program point L26-4(lines 26 29) no Hoare annotation was computed. [2023-12-24 22:13:54,352 INFO L895 garLoopResultBuilder]: At program point L18-3(lines 18 20) the Hoare annotation is: (let ((.cse0 (bvsge (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967287 32)) (_ bv0 32))) (.cse2 (bvsge (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967288 32)) (_ bv0 32))) (.cse1 (bvsge (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967289 32)) (_ bv0 32)))) (and (bvsge |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (or (not .cse0) (bvsge (bvadd (_ bv4294967286 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32))) (or (not (bvsge (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967290 32)) (_ bv0 32))) .cse1) (= (_ bv5 32) |ULTIMATE.start_main_~max~0#1|) (or .cse0 (not .cse2)) (= |ULTIMATE.start_main_~#str1~0#1.offset| (_ bv0 32)) (or .cse2 (not .cse1)) (= |ULTIMATE.start_main_~#str2~0#1.offset| (_ bv0 32)))) [2023-12-24 22:13:54,352 INFO L899 garLoopResultBuilder]: For program point L18-4(lines 18 20) no Hoare annotation was computed. [2023-12-24 22:13:54,352 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2023-12-24 22:13:54,352 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2023-12-24 22:13:54,355 INFO L445 BasicCegarLoop]: Path program histogram: [5, 4, 2, 1] [2023-12-24 22:13:54,357 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 22:13:54,365 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][0bv32] could not be translated [2023-12-24 22:13:54,365 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated [2023-12-24 22:13:54,368 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][1bv32] could not be translated [2023-12-24 22:13:54,368 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][3bv32] could not be translated [2023-12-24 22:13:54,368 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][2bv32] could not be translated [2023-12-24 22:13:54,368 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][2bv32] could not be translated [2023-12-24 22:13:54,368 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated [2023-12-24 22:13:54,368 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_198 : bv32 :: #memory_int#2[~#str2~0!base][3bv32] == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_198][7:0])) could not be translated [2023-12-24 22:13:54,368 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_150 : bv32 :: #memory_int#2[~#str2~0!base][4bv32] == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_150][7:0])) could not be translated [2023-12-24 22:13:54,368 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][0bv32] could not be translated [2023-12-24 22:13:54,368 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated [2023-12-24 22:13:54,369 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][1bv32] could not be translated [2023-12-24 22:13:54,369 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][3bv32] could not be translated [2023-12-24 22:13:54,369 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][2bv32] could not be translated [2023-12-24 22:13:54,369 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][2bv32] could not be translated [2023-12-24 22:13:54,369 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated [2023-12-24 22:13:54,369 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_198 : bv32 :: #memory_int#2[~#str2~0!base][3bv32] == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_198][7:0])) could not be translated [2023-12-24 22:13:54,369 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_150 : bv32 :: #memory_int#2[~#str2~0!base][4bv32] == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_150][7:0])) could not be translated [2023-12-24 22:13:54,370 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][0bv32] could not be translated [2023-12-24 22:13:54,370 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated [2023-12-24 22:13:54,370 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][4bv32] could not be translated [2023-12-24 22:13:54,370 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][0bv32] could not be translated [2023-12-24 22:13:54,370 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][1bv32] could not be translated [2023-12-24 22:13:54,370 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][3bv32] could not be translated [2023-12-24 22:13:54,370 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][1bv32] could not be translated [2023-12-24 22:13:54,370 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][3bv32] could not be translated [2023-12-24 22:13:54,370 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][2bv32] could not be translated [2023-12-24 22:13:54,370 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][2bv32] could not be translated [2023-12-24 22:13:54,371 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated [2023-12-24 22:13:54,371 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][0bv32] could not be translated [2023-12-24 22:13:54,371 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated [2023-12-24 22:13:54,371 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][1bv32] could not be translated [2023-12-24 22:13:54,371 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][3bv32] could not be translated [2023-12-24 22:13:54,371 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][1bv32] could not be translated [2023-12-24 22:13:54,371 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][3bv32] could not be translated [2023-12-24 22:13:54,371 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][2bv32] could not be translated [2023-12-24 22:13:54,371 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][2bv32] could not be translated [2023-12-24 22:13:54,371 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated [2023-12-24 22:13:54,371 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_150 : bv32 :: #memory_int#2[~#str2~0!base][4bv32] == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_150][7:0])) could not be translated [2023-12-24 22:13:54,371 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][0bv32] could not be translated [2023-12-24 22:13:54,371 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated [2023-12-24 22:13:54,372 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][1bv32] could not be translated [2023-12-24 22:13:54,372 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][3bv32] could not be translated [2023-12-24 22:13:54,372 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][2bv32] could not be translated [2023-12-24 22:13:54,372 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][2bv32] could not be translated [2023-12-24 22:13:54,372 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated [2023-12-24 22:13:54,372 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_198 : bv32 :: #memory_int#2[~#str2~0!base][3bv32] == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_198][7:0])) could not be translated [2023-12-24 22:13:54,372 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_150 : bv32 :: #memory_int#2[~#str2~0!base][4bv32] == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_150][7:0])) could not be translated [2023-12-24 22:13:54,376 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][0bv32] could not be translated [2023-12-24 22:13:54,377 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated [2023-12-24 22:13:54,377 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_subst_1 : bv32 :: ~sign_extend~32~8(#memory_int#2[~#str2~0!base][~j~0 := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_subst_1][7:0])][3bv32][7:0]) == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][1bv32][7:0])) could not be translated [2023-12-24 22:13:54,377 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][1bv32] could not be translated [2023-12-24 22:13:54,377 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][~bvadd~32(~j~0, 4294967294bv32)] could not be translated [2023-12-24 22:13:54,377 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~i~0#1_209 : bv32, v_subst_10 : bv32, v_ULTIMATE.start_main_~i~0#1_210 : bv32 :: ~sign_extend~32~8(#memory_int#1[~#str1~0!base][4bv32][7:0]) == ~sign_extend~32~8(#memory_int#2[~#str2~0!base][~j~0 := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_subst_10][7:0])][~bvadd~32(~j~0, 1bv32) := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_210][7:0])][~bvadd~32(~j~0, 2bv32) := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_209][7:0])][0bv32][7:0])) could not be translated [2023-12-24 22:13:54,377 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][~bvadd~32(4294967295bv32, ~j~0)] could not be translated [2023-12-24 22:13:54,377 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][0bv32] could not be translated [2023-12-24 22:13:54,377 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~i~0#1_183 : bv32, v_subst_6 : bv32, v_ULTIMATE.start_main_~i~0#1_182 : bv32 :: ~sign_extend~32~8(#memory_int#1[~#str1~0!base][3bv32][7:0]) == ~sign_extend~32~8(#memory_int#2[~#str2~0!base][~j~0 := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_subst_6][7:0])][~bvadd~32(~j~0, 1bv32) := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_183][7:0])][~bvadd~32(~j~0, 2bv32) := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_182][7:0])][1bv32][7:0])) could not be translated [2023-12-24 22:13:54,378 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][~bvadd~32(4294967292bv32, ~j~0)] could not be translated [2023-12-24 22:13:54,378 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][3bv32] could not be translated [2023-12-24 22:13:54,378 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][4bv32] could not be translated [2023-12-24 22:13:54,378 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][0bv32] could not be translated [2023-12-24 22:13:54,378 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][1bv32] could not be translated [2023-12-24 22:13:54,378 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][3bv32] could not be translated [2023-12-24 22:13:54,378 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_subst_3 : bv32 :: ~sign_extend~32~8(#memory_int#2[~#str2~0!base][~j~0 := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_subst_3][7:0])][2bv32][7:0]) == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][2bv32][7:0])) could not be translated [2023-12-24 22:13:54,378 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_subst_4 : bv32 :: ~sign_extend~32~8(#memory_int#2[~#str2~0!base][~j~0 := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_subst_4][7:0])][1bv32][7:0]) == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][3bv32][7:0])) could not be translated [2023-12-24 22:13:54,378 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated [2023-12-24 22:13:54,378 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][~bvadd~32(~j~0, 4294967293bv32)] could not be translated [2023-12-24 22:13:54,378 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][2bv32] could not be translated [2023-12-24 22:13:54,379 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_172 : bv32 :: ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_172][7:0]) == #memory_int#2[~#str2~0!base][2bv32]) could not be translated [2023-12-24 22:13:54,379 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_198 : bv32 :: #memory_int#2[~#str2~0!base][3bv32] == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_198][7:0])) could not be translated [2023-12-24 22:13:54,379 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~i~0#1_209 : bv32, v_subst_7 : bv32 :: ~sign_extend~32~8(#memory_int#1[~#str1~0!base][4bv32][7:0]) == ~sign_extend~32~8(#memory_int#2[~#str2~0!base][~j~0 := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_subst_7][7:0])][~bvadd~32(~j~0, 1bv32) := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_209][7:0])][0bv32][7:0])) could not be translated [2023-12-24 22:13:54,379 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~i~0#1_209 : bv32, v_subst_9 : bv32, v_ULTIMATE.start_main_~i~0#1_211 : bv32, v_ULTIMATE.start_main_~i~0#1_210 : bv32 :: ~sign_extend~32~8(#memory_int#1[~#str1~0!base][4bv32][7:0]) == ~sign_extend~32~8(#memory_int#2[~#str2~0!base][~j~0 := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_subst_9][7:0])][~bvadd~32(~j~0, 1bv32) := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_211][7:0])][~bvadd~32(~j~0, 2bv32) := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_210][7:0])][~bvadd~32(~j~0, 3bv32) := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_209][7:0])][0bv32][7:0])) could not be translated [2023-12-24 22:13:54,379 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_subst_8 : bv32 :: ~sign_extend~32~8(#memory_int#2[~#str2~0!base][~j~0 := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_subst_8][7:0])][0bv32][7:0]) == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][4bv32][7:0])) could not be translated [2023-12-24 22:13:54,379 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][0bv32] could not be translated [2023-12-24 22:13:54,379 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated [2023-12-24 22:13:54,379 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][1bv32] could not be translated [2023-12-24 22:13:54,380 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][3bv32] could not be translated [2023-12-24 22:13:54,380 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated [2023-12-24 22:13:54,380 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][0bv32] could not be translated [2023-12-24 22:13:54,380 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated [2023-12-24 22:13:54,380 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][1bv32] could not be translated [2023-12-24 22:13:54,380 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][3bv32] could not be translated [2023-12-24 22:13:54,380 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][2bv32] could not be translated [2023-12-24 22:13:54,380 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][2bv32] could not be translated [2023-12-24 22:13:54,380 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated [2023-12-24 22:13:54,380 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_198 : bv32 :: #memory_int#2[~#str2~0!base][3bv32] == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_198][7:0])) could not be translated [2023-12-24 22:13:54,380 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][1bv32] could not be translated [2023-12-24 22:13:54,380 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][3bv32] could not be translated [2023-12-24 22:13:54,381 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][0bv32] could not be translated [2023-12-24 22:13:54,381 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated [2023-12-24 22:13:54,381 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][1bv32] could not be translated [2023-12-24 22:13:54,381 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][3bv32] could not be translated [2023-12-24 22:13:54,381 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][2bv32] could not be translated [2023-12-24 22:13:54,381 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][2bv32] could not be translated [2023-12-24 22:13:54,381 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated [2023-12-24 22:13:54,381 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated [2023-12-24 22:13:54,381 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][0bv32] could not be translated [2023-12-24 22:13:54,381 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated [2023-12-24 22:13:54,381 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated [2023-12-24 22:13:54,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 10:13:54 BoogieIcfgContainer [2023-12-24 22:13:54,382 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 22:13:54,382 INFO L158 Benchmark]: Toolchain (without parser) took 382910.42ms. Allocated memory was 216.0MB in the beginning and 272.6MB in the end (delta: 56.6MB). Free memory was 154.2MB in the beginning and 104.7MB in the end (delta: 49.4MB). Peak memory consumption was 135.5MB. Max. memory is 8.0GB. [2023-12-24 22:13:54,382 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 216.0MB. Free memory is still 166.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 22:13:54,382 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.04ms. Allocated memory is still 216.0MB. Free memory was 153.9MB in the beginning and 142.7MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-24 22:13:54,382 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.85ms. Allocated memory is still 216.0MB. Free memory was 142.7MB in the beginning and 141.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-24 22:13:54,383 INFO L158 Benchmark]: Boogie Preprocessor took 31.70ms. Allocated memory is still 216.0MB. Free memory was 141.2MB in the beginning and 139.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 22:13:54,383 INFO L158 Benchmark]: RCFGBuilder took 373.09ms. Allocated memory was 216.0MB in the beginning and 272.6MB in the end (delta: 56.6MB). Free memory was 139.0MB in the beginning and 231.0MB in the end (delta: -92.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-24 22:13:54,383 INFO L158 Benchmark]: TraceAbstraction took 382314.97ms. Allocated memory is still 272.6MB. Free memory was 230.5MB in the beginning and 104.7MB in the end (delta: 125.7MB). Peak memory consumption was 154.4MB. Max. memory is 8.0GB. [2023-12-24 22:13:54,384 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.11ms. Allocated memory is still 216.0MB. Free memory is still 166.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 161.04ms. Allocated memory is still 216.0MB. Free memory was 153.9MB in the beginning and 142.7MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.85ms. Allocated memory is still 216.0MB. Free memory was 142.7MB in the beginning and 141.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.70ms. Allocated memory is still 216.0MB. Free memory was 141.2MB in the beginning and 139.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 373.09ms. Allocated memory was 216.0MB in the beginning and 272.6MB in the end (delta: 56.6MB). Free memory was 139.0MB in the beginning and 231.0MB in the end (delta: -92.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 382314.97ms. Allocated memory is still 272.6MB. Free memory was 230.5MB in the beginning and 104.7MB in the end (delta: 125.7MB). Peak memory consumption was 154.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][1bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][3bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][2bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][2bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_198 : bv32 :: #memory_int#2[~#str2~0!base][3bv32] == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_198][7:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_150 : bv32 :: #memory_int#2[~#str2~0!base][4bv32] == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_150][7:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][1bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][3bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][2bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][2bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_198 : bv32 :: #memory_int#2[~#str2~0!base][3bv32] == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_198][7:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_150 : bv32 :: #memory_int#2[~#str2~0!base][4bv32] == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_150][7:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][1bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][3bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][1bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][3bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][2bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][2bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][1bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][3bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][1bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][3bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][2bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][2bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_150 : bv32 :: #memory_int#2[~#str2~0!base][4bv32] == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_150][7:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][1bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][3bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][2bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][2bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_198 : bv32 :: #memory_int#2[~#str2~0!base][3bv32] == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_198][7:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_150 : bv32 :: #memory_int#2[~#str2~0!base][4bv32] == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_150][7:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_subst_1 : bv32 :: ~sign_extend~32~8(#memory_int#2[~#str2~0!base][~j~0 := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_subst_1][7:0])][3bv32][7:0]) == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][1bv32][7:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][1bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][~bvadd~32(~j~0, 4294967294bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~i~0#1_209 : bv32, v_subst_10 : bv32, v_ULTIMATE.start_main_~i~0#1_210 : bv32 :: ~sign_extend~32~8(#memory_int#1[~#str1~0!base][4bv32][7:0]) == ~sign_extend~32~8(#memory_int#2[~#str2~0!base][~j~0 := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_subst_10][7:0])][~bvadd~32(~j~0, 1bv32) := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_210][7:0])][~bvadd~32(~j~0, 2bv32) := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_209][7:0])][0bv32][7:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][~bvadd~32(4294967295bv32, ~j~0)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~i~0#1_183 : bv32, v_subst_6 : bv32, v_ULTIMATE.start_main_~i~0#1_182 : bv32 :: ~sign_extend~32~8(#memory_int#1[~#str1~0!base][3bv32][7:0]) == ~sign_extend~32~8(#memory_int#2[~#str2~0!base][~j~0 := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_subst_6][7:0])][~bvadd~32(~j~0, 1bv32) := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_183][7:0])][~bvadd~32(~j~0, 2bv32) := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_182][7:0])][1bv32][7:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][~bvadd~32(4294967292bv32, ~j~0)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][3bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][1bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][3bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_subst_3 : bv32 :: ~sign_extend~32~8(#memory_int#2[~#str2~0!base][~j~0 := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_subst_3][7:0])][2bv32][7:0]) == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][2bv32][7:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_subst_4 : bv32 :: ~sign_extend~32~8(#memory_int#2[~#str2~0!base][~j~0 := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_subst_4][7:0])][1bv32][7:0]) == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][3bv32][7:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][~bvadd~32(~j~0, 4294967293bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][2bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_172 : bv32 :: ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_172][7:0]) == #memory_int#2[~#str2~0!base][2bv32]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_198 : bv32 :: #memory_int#2[~#str2~0!base][3bv32] == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_198][7:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~i~0#1_209 : bv32, v_subst_7 : bv32 :: ~sign_extend~32~8(#memory_int#1[~#str1~0!base][4bv32][7:0]) == ~sign_extend~32~8(#memory_int#2[~#str2~0!base][~j~0 := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_subst_7][7:0])][~bvadd~32(~j~0, 1bv32) := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_209][7:0])][0bv32][7:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~i~0#1_209 : bv32, v_subst_9 : bv32, v_ULTIMATE.start_main_~i~0#1_211 : bv32, v_ULTIMATE.start_main_~i~0#1_210 : bv32 :: ~sign_extend~32~8(#memory_int#1[~#str1~0!base][4bv32][7:0]) == ~sign_extend~32~8(#memory_int#2[~#str2~0!base][~j~0 := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_subst_9][7:0])][~bvadd~32(~j~0, 1bv32) := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_211][7:0])][~bvadd~32(~j~0, 2bv32) := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_210][7:0])][~bvadd~32(~j~0, 3bv32) := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_209][7:0])][0bv32][7:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_subst_8 : bv32 :: ~sign_extend~32~8(#memory_int#2[~#str2~0!base][~j~0 := ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_subst_8][7:0])][0bv32][7:0]) == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][4bv32][7:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][1bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][3bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][1bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][3bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][2bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][2bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~i~0#1_198 : bv32 :: #memory_int#2[~#str2~0!base][3bv32] == ~sign_extend~32~8(#memory_int#1[~#str1~0!base][v_ULTIMATE.start_main_~i~0#1_198][7:0])) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][1bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][3bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][1bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][3bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][2bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][2bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str2~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str1~0!base][4bv32] could not be translated * 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: 7]: 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 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 382.3s, OverallIterations: 12, TraceHistogramMax: 10, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 69.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 207.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 885 SdHoareTripleChecker+Valid, 46.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 885 mSDsluCounter, 802 SdHoareTripleChecker+Invalid, 45.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 695 mSDsCounter, 325 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2300 IncrementalHoareTripleChecker+Invalid, 2633 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 325 mSolverCounterUnsat, 107 mSDtfsCounter, 2300 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 495 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1818 ImplicationChecksByTransitivity, 120.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=8, InterpolantAutomatonStates: 178, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 124 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 21 NumberOfFragments, 1293 HoareAnnotationTreeSize, 3 FormulaSimplifications, 70691 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FormulaSimplificationsInter, 1418 FormulaSimplificationTreeSizeReductionInter, 207.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 101.6s InterpolantComputationTime, 216 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 390 ConstructedInterpolants, 59 QuantifiedInterpolants, 6729 SizeOfPredicates, 98 NumberOfNonLiveVariables, 1074 ConjunctsInSsa, 208 ConjunctsInUnsatCore, 22 InterpolantComputations, 2 PerfectInterpolantSequences, 193/656 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: 32]: Loop Invariant Derived loop invariant: ((((((((5 == max) && (i == 2)) && (j == 2)) || (((5 == max) && (j == 0)) && (4 == i))) || (((((((i >= 0) && (!((((i + -9) % 4294967296) >= 0)) || (((-10 + i) % 4294967296) >= 0))) && (!((((i + -6) % 4294967296) >= 0)) || (((i + -7) % 4294967296) >= 0))) && (5 == max)) && ((((i + -9) % 4294967296) >= 0) || !((((i + -8) % 4294967296) >= 0)))) && ((((i + -8) % 4294967296) >= 0) || !((((i + -7) % 4294967296) >= 0)))) && (((-5 + i) % 4294967296) >= 0))) || (((4 == j) && (i == 0)) && (5 == max))) || (((i == 1) && (5 == max)) && (j == 3))) || (((5 == max) && (i == 3)) && (j == 1))) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((((i >= 0) && (!((((i + -9) % 4294967296) >= 0)) || (((-10 + i) % 4294967296) >= 0))) && (!((((i + -6) % 4294967296) >= 0)) || (((i + -7) % 4294967296) >= 0))) && (5 == max)) && ((((i + -9) % 4294967296) >= 0) || !((((i + -8) % 4294967296) >= 0)))) && ((((i + -8) % 4294967296) >= 0) || !((((i + -7) % 4294967296) >= 0)))) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((((((((((((null & 127) == (null & 127)) && ((null & 127) == (null & 127))) && (5 == max)) && ((null & 127) == (null & 127))) && ((null & 127) == (null & 127))) && (((i + 1) % 4294967296) == 0)) || (((5 == max) && (i == 2)) && (j == 2))) || ((((4 == j) && (i == 0)) && (5 == max)) && ((null & 127) == (null & 127)))) || (((i == 1) && (5 == max)) && (j == 3))) || (((5 == max) && (j == 0)) && (4 == i))) || (((5 == max) && (i == 3)) && (j == 1))) RESULT: Ultimate proved your program to be correct! [2023-12-24 22:13:54,531 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...