/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/list-simple/sll2c_remove_all.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 21:38:10,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 21:38:10,796 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 21:38:10,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 21:38:10,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 21:38:10,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 21:38:10,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 21:38:10,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 21:38:10,818 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 21:38:10,819 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 21:38:10,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 21:38:10,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 21:38:10,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 21:38:10,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 21:38:10,820 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 21:38:10,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 21:38:10,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 21:38:10,821 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 21:38:10,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 21:38:10,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 21:38:10,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 21:38:10,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 21:38:10,826 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 21:38:10,826 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 21:38:10,828 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 21:38:10,829 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 21:38:10,829 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 21:38:10,829 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 21:38:10,830 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 21:38:10,830 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 21:38:10,830 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 21:38:10,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 21:38:10,831 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 21:38:10,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 21:38:10,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:38:10,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 21:38:10,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 21:38:10,831 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 21:38:10,831 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 21:38:10,831 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 21:38:10,831 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 21:38:10,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 21:38:10,832 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 21:38:10,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 21:38:10,832 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 21:38:10,832 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 21:38:10,832 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 21:38:11,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 21:38:11,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 21:38:11,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 21:38:11,041 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 21:38:11,044 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 21:38:11,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_remove_all.i [2023-12-24 21:38:12,032 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 21:38:12,209 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 21:38:12,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_remove_all.i [2023-12-24 21:38:12,218 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/822ea7a78/576ee76eedf846be9406e8d0e321e249/FLAG4ae9216a7 [2023-12-24 21:38:12,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/822ea7a78/576ee76eedf846be9406e8d0e321e249 [2023-12-24 21:38:12,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 21:38:12,229 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 21:38:12,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 21:38:12,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 21:38:12,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 21:38:12,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:38:12" (1/1) ... [2023-12-24 21:38:12,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72b55283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:12, skipping insertion in model container [2023-12-24 21:38:12,238 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:38:12" (1/1) ... [2023-12-24 21:38:12,279 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 21:38:12,502 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_remove_all.i[24082,24095] [2023-12-24 21:38:12,504 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:38:12,515 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 21:38:12,561 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_remove_all.i[24082,24095] [2023-12-24 21:38:12,561 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:38:12,579 INFO L206 MainTranslator]: Completed translation [2023-12-24 21:38:12,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:12 WrapperNode [2023-12-24 21:38:12,580 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 21:38:12,581 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 21:38:12,581 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 21:38:12,581 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 21:38:12,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:12" (1/1) ... [2023-12-24 21:38:12,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:12" (1/1) ... [2023-12-24 21:38:12,619 INFO L138 Inliner]: procedures = 129, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 113 [2023-12-24 21:38:12,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 21:38:12,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 21:38:12,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 21:38:12,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 21:38:12,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:12" (1/1) ... [2023-12-24 21:38:12,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:12" (1/1) ... [2023-12-24 21:38:12,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:12" (1/1) ... [2023-12-24 21:38:12,647 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 10, 8]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 7 writes are split as follows [0, 2, 5]. [2023-12-24 21:38:12,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:12" (1/1) ... [2023-12-24 21:38:12,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:12" (1/1) ... [2023-12-24 21:38:12,654 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:12" (1/1) ... [2023-12-24 21:38:12,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:12" (1/1) ... [2023-12-24 21:38:12,659 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:12" (1/1) ... [2023-12-24 21:38:12,660 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:12" (1/1) ... [2023-12-24 21:38:12,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 21:38:12,666 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 21:38:12,666 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 21:38:12,666 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 21:38:12,666 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:12" (1/1) ... [2023-12-24 21:38:12,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:38:12,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 21:38:12,687 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 21:38:12,688 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 21:38:12,705 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-24 21:38:12,705 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-24 21:38:12,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 21:38:12,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 21:38:12,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-24 21:38:12,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 21:38:12,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 21:38:12,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-24 21:38:12,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 21:38:12,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 21:38:12,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-24 21:38:12,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 21:38:12,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 21:38:12,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 21:38:12,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 21:38:12,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-24 21:38:12,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-24 21:38:12,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-24 21:38:12,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 21:38:12,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 21:38:12,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 21:38:12,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 21:38:12,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 21:38:12,794 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 21:38:12,795 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 21:38:12,956 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 21:38:12,989 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 21:38:12,989 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-24 21:38:12,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:38:12 BoogieIcfgContainer [2023-12-24 21:38:12,990 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 21:38:12,991 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 21:38:12,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 21:38:12,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 21:38:12,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 09:38:12" (1/3) ... [2023-12-24 21:38:12,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38771b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:38:12, skipping insertion in model container [2023-12-24 21:38:12,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:12" (2/3) ... [2023-12-24 21:38:12,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38771b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:38:12, skipping insertion in model container [2023-12-24 21:38:12,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:38:12" (3/3) ... [2023-12-24 21:38:12,995 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all.i [2023-12-24 21:38:13,007 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 21:38:13,008 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 21:38:13,047 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 21:38:13,051 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;@5df9bc62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 21:38:13,052 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 21:38:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:38:13,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-24 21:38:13,067 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:38:13,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:38:13,068 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:38:13,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:38:13,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1934320213, now seen corresponding path program 1 times [2023-12-24 21:38:13,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:38:13,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852837099] [2023-12-24 21:38:13,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:38:13,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:38:13,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:38:13,084 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 21:38:13,085 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 21:38:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:38:13,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 21:38:13,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:13,203 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 21:38:13,203 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:38:13,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:13,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852837099] [2023-12-24 21:38:13,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852837099] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:38:13,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:38:13,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:38:13,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868615932] [2023-12-24 21:38:13,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:38:13,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 21:38:13,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:38:13,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 21:38:13,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:38:13,229 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 21:38:13,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:38:13,267 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2023-12-24 21:38:13,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 21:38:13,268 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-12-24 21:38:13,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:38:13,273 INFO L225 Difference]: With dead ends: 36 [2023-12-24 21:38:13,273 INFO L226 Difference]: Without dead ends: 20 [2023-12-24 21:38:13,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:38:13,278 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:38:13,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 21:38:13,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-24 21:38:13,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-24 21:38:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:38:13,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-12-24 21:38:13,305 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 12 [2023-12-24 21:38:13,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:38:13,306 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-12-24 21:38:13,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 21:38:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-12-24 21:38:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-24 21:38:13,310 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:38:13,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:38:13,314 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 21:38:13,513 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 21:38:13,514 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:38:13,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:38:13,515 INFO L85 PathProgramCache]: Analyzing trace with hash -2106839894, now seen corresponding path program 1 times [2023-12-24 21:38:13,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:38:13,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884607554] [2023-12-24 21:38:13,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:38:13,516 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 21:38:13,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:38:13,517 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 21:38:13,526 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 21:38:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:38:13,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 21:38:13,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:13,634 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 21:38:13,634 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:38:13,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:13,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884607554] [2023-12-24 21:38:13,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [884607554] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:38:13,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:38:13,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 21:38:13,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914661414] [2023-12-24 21:38:13,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:38:13,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:38:13,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:38:13,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:38:13,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:38:13,641 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 21:38:13,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:38:13,685 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2023-12-24 21:38:13,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:38:13,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-12-24 21:38:13,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:38:13,686 INFO L225 Difference]: With dead ends: 34 [2023-12-24 21:38:13,686 INFO L226 Difference]: Without dead ends: 23 [2023-12-24 21:38:13,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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 21:38:13,687 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:38:13,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 35 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 21:38:13,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-24 21:38:13,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2023-12-24 21:38:13,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:38:13,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-12-24 21:38:13,691 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 12 [2023-12-24 21:38:13,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:38:13,691 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-12-24 21:38:13,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-24 21:38:13,692 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-12-24 21:38:13,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-24 21:38:13,692 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:38:13,692 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:38:13,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-24 21:38:13,895 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 21:38:13,895 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:38:13,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:38:13,896 INFO L85 PathProgramCache]: Analyzing trace with hash 2078188702, now seen corresponding path program 1 times [2023-12-24 21:38:13,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:38:13,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151135367] [2023-12-24 21:38:13,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:38:13,897 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 21:38:13,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:38:13,898 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 21:38:13,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 21:38:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:38:13,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 21:38:13,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 21:38:14,024 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:38:14,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:14,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151135367] [2023-12-24 21:38:14,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151135367] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:38:14,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:38:14,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 21:38:14,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772745014] [2023-12-24 21:38:14,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:38:14,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:38:14,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:38:14,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:38:14,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:38:14,030 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:38:14,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:38:14,075 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2023-12-24 21:38:14,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 21:38:14,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-12-24 21:38:14,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:38:14,077 INFO L225 Difference]: With dead ends: 31 [2023-12-24 21:38:14,077 INFO L226 Difference]: Without dead ends: 27 [2023-12-24 21:38:14,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:38:14,080 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 27 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:38:14,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 34 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 21:38:14,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-24 21:38:14,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2023-12-24 21:38:14,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:38:14,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-12-24 21:38:14,090 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 18 [2023-12-24 21:38:14,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:38:14,090 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-12-24 21:38:14,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:38:14,091 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-12-24 21:38:14,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-24 21:38:14,092 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:38:14,092 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:38:14,097 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 21:38:14,297 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 21:38:14,297 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:38:14,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:38:14,298 INFO L85 PathProgramCache]: Analyzing trace with hash 503792656, now seen corresponding path program 1 times [2023-12-24 21:38:14,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:38:14,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675237833] [2023-12-24 21:38:14,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:38:14,299 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 21:38:14,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:38:14,300 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 21:38:14,301 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 21:38:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:38:14,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 21:38:14,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:14,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 21:38:14,475 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:38:14,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 21:38:14,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:14,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675237833] [2023-12-24 21:38:14,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [675237833] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:38:14,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:38:14,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-24 21:38:14,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126671150] [2023-12-24 21:38:14,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:38:14,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 21:38:14,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:38:14,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 21:38:14,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-24 21:38:14,541 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 21:38:14,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:38:14,622 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2023-12-24 21:38:14,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 21:38:14,623 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 21 [2023-12-24 21:38:14,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:38:14,623 INFO L225 Difference]: With dead ends: 37 [2023-12-24 21:38:14,623 INFO L226 Difference]: Without dead ends: 33 [2023-12-24 21:38:14,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-24 21:38:14,624 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 48 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:38:14,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 69 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:38:14,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-24 21:38:14,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2023-12-24 21:38:14,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:38:14,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-12-24 21:38:14,628 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 21 [2023-12-24 21:38:14,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:38:14,628 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-12-24 21:38:14,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 21:38:14,628 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-12-24 21:38:14,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-24 21:38:14,629 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:38:14,629 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:38:14,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 21:38:14,832 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 21:38:14,833 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:38:14,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:38:14,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1285941410, now seen corresponding path program 2 times [2023-12-24 21:38:14,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:38:14,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032365715] [2023-12-24 21:38:14,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:38:14,834 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 21:38:14,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:38:14,835 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 21:38:14,838 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 21:38:14,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:38:14,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:38:14,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 21:38:14,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:14,998 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 11 treesize of output 7 [2023-12-24 21:38:15,002 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 11 treesize of output 7 [2023-12-24 21:38:15,035 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-24 21:38:15,035 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:38:15,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:15,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032365715] [2023-12-24 21:38:15,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032365715] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:38:15,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:38:15,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 21:38:15,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700294631] [2023-12-24 21:38:15,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:38:15,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 21:38:15,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:38:15,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 21:38:15,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 21:38:15,037 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:38:15,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:38:15,252 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2023-12-24 21:38:15,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 21:38:15,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-12-24 21:38:15,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:38:15,253 INFO L225 Difference]: With dead ends: 40 [2023-12-24 21:38:15,253 INFO L226 Difference]: Without dead ends: 36 [2023-12-24 21:38:15,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-24 21:38:15,254 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:38:15,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 62 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 21:38:15,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-24 21:38:15,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2023-12-24 21:38:15,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:38:15,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-12-24 21:38:15,258 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2023-12-24 21:38:15,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:38:15,258 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-12-24 21:38:15,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:38:15,258 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-12-24 21:38:15,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-24 21:38:15,258 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:38:15,258 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:38:15,265 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 21:38:15,459 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 21:38:15,459 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:38:15,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:38:15,460 INFO L85 PathProgramCache]: Analyzing trace with hash 565204474, now seen corresponding path program 1 times [2023-12-24 21:38:15,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:38:15,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236016516] [2023-12-24 21:38:15,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:38:15,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:38:15,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:38:15,461 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 21:38:15,463 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 21:38:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:38:15,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-24 21:38:15,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:15,610 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 11 treesize of output 7 [2023-12-24 21:38:15,614 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 11 treesize of output 7 [2023-12-24 21:38:15,738 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 25 treesize of output 17 [2023-12-24 21:38:15,750 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 13 [2023-12-24 21:38:15,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 21:38:15,773 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:38:15,866 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-24 21:38:15,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:15,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236016516] [2023-12-24 21:38:15,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236016516] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 21:38:15,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 21:38:15,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2023-12-24 21:38:15,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491039299] [2023-12-24 21:38:15,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:38:15,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 21:38:15,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:38:15,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 21:38:15,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-24 21:38:15,869 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:38:16,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:38:16,106 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2023-12-24 21:38:16,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 21:38:16,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2023-12-24 21:38:16,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:38:16,107 INFO L225 Difference]: With dead ends: 45 [2023-12-24 21:38:16,107 INFO L226 Difference]: Without dead ends: 32 [2023-12-24 21:38:16,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-24 21:38:16,108 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:38:16,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 52 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 21:38:16,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-24 21:38:16,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-24 21:38:16,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:38:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2023-12-24 21:38:16,112 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 27 [2023-12-24 21:38:16,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:38:16,113 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2023-12-24 21:38:16,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:38:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2023-12-24 21:38:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-24 21:38:16,113 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:38:16,113 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:38:16,119 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 21:38:16,317 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 21:38:16,318 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:38:16,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:38:16,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1961812095, now seen corresponding path program 1 times [2023-12-24 21:38:16,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:38:16,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [570839563] [2023-12-24 21:38:16,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:38:16,319 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 21:38:16,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:38:16,320 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 21:38:16,321 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 21:38:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:38:16,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-24 21:38:16,468 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:16,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2023-12-24 21:38:16,542 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 21:38:16,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 13 [2023-12-24 21:38:16,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:38:16,599 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-12-24 21:38:16,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 46 [2023-12-24 21:38:16,621 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 43 treesize of output 27 [2023-12-24 21:38:16,624 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 24 treesize of output 16 [2023-12-24 21:38:16,625 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 16 treesize of output 8 [2023-12-24 21:38:16,639 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 21:38:16,640 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:38:16,652 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 32 treesize of output 20 [2023-12-24 21:38:16,655 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 24 treesize of output 16 [2023-12-24 21:38:16,660 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_303) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2023-12-24 21:38:16,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:38:16,670 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2023-12-24 21:38:16,672 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 33 treesize of output 25 [2023-12-24 21:38:16,675 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 6 treesize of output 4 [2023-12-24 21:38:16,844 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2023-12-24 21:38:16,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:16,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [570839563] [2023-12-24 21:38:16,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [570839563] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:38:16,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:38:16,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2023-12-24 21:38:16,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109081046] [2023-12-24 21:38:16,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:38:16,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-24 21:38:16,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:38:16,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-24 21:38:16,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=209, Unknown=1, NotChecked=28, Total=272 [2023-12-24 21:38:16,845 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 21:38:17,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:38:17,524 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2023-12-24 21:38:17,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 21:38:17,528 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2023-12-24 21:38:17,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:38:17,529 INFO L225 Difference]: With dead ends: 58 [2023-12-24 21:38:17,529 INFO L226 Difference]: Without dead ends: 44 [2023-12-24 21:38:17,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=326, Unknown=1, NotChecked=36, Total=420 [2023-12-24 21:38:17,530 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 9 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 21:38:17,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 165 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 180 Invalid, 0 Unknown, 22 Unchecked, 0.6s Time] [2023-12-24 21:38:17,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-24 21:38:17,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2023-12-24 21:38:17,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 21:38:17,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2023-12-24 21:38:17,536 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 29 [2023-12-24 21:38:17,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:38:17,536 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2023-12-24 21:38:17,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 21:38:17,536 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2023-12-24 21:38:17,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-24 21:38:17,537 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:38:17,538 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:38:17,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-24 21:38:17,743 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 21:38:17,744 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:38:17,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:38:17,744 INFO L85 PathProgramCache]: Analyzing trace with hash 863445628, now seen corresponding path program 1 times [2023-12-24 21:38:17,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:38:17,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320785286] [2023-12-24 21:38:17,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:38:17,745 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 21:38:17,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:38:17,746 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 21:38:17,748 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 21:38:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:38:17,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-24 21:38:17,876 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:18,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 165 treesize of output 121 [2023-12-24 21:38:18,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 121 treesize of output 77 [2023-12-24 21:38:18,102 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-12-24 21:38:18,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 52 [2023-12-24 21:38:18,120 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-12-24 21:38:18,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 44 [2023-12-24 21:38:18,195 INFO L349 Elim1Store]: treesize reduction 46, result has 6.1 percent of original size [2023-12-24 21:38:18,195 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 35 [2023-12-24 21:38:18,200 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 49 treesize of output 33 [2023-12-24 21:38:18,205 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 25 [2023-12-24 21:38:18,209 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-24 21:38:18,209 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 13 [2023-12-24 21:38:18,224 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-24 21:38:18,224 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:38:18,779 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-24 21:38:18,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:18,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320785286] [2023-12-24 21:38:18,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320785286] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:38:18,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:38:18,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-12-24 21:38:18,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458170399] [2023-12-24 21:38:18,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:38:18,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 21:38:18,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:38:18,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 21:38:18,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-24 21:38:18,781 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:38:20,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:38:20,753 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2023-12-24 21:38:20,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 21:38:20,754 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2023-12-24 21:38:20,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:38:20,754 INFO L225 Difference]: With dead ends: 68 [2023-12-24 21:38:20,754 INFO L226 Difference]: Without dead ends: 54 [2023-12-24 21:38:20,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-12-24 21:38:20,755 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:38:20,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 90 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-24 21:38:20,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-24 21:38:20,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2023-12-24 21:38:20,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-24 21:38:20,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2023-12-24 21:38:20,761 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 34 [2023-12-24 21:38:20,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:38:20,762 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2023-12-24 21:38:20,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:38:20,762 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2023-12-24 21:38:20,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-24 21:38:20,762 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:38:20,763 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:38:20,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-24 21:38:20,963 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 21:38:20,963 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:38:20,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:38:20,964 INFO L85 PathProgramCache]: Analyzing trace with hash 2028261131, now seen corresponding path program 2 times [2023-12-24 21:38:20,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:38:20,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94002893] [2023-12-24 21:38:20,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:38:20,964 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 21:38:20,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:38:20,966 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 21:38:21,004 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 21:38:21,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:38:21,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:38:21,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 21:38:21,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:21,171 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-24 21:38:21,172 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:38:21,209 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-24 21:38:21,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:21,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94002893] [2023-12-24 21:38:21,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94002893] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:38:21,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:38:21,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-24 21:38:21,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381120321] [2023-12-24 21:38:21,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:38:21,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 21:38:21,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:38:21,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 21:38:21,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:38:21,211 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-24 21:38:21,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:38:21,294 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2023-12-24 21:38:21,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 21:38:21,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 35 [2023-12-24 21:38:21,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:38:21,296 INFO L225 Difference]: With dead ends: 82 [2023-12-24 21:38:21,296 INFO L226 Difference]: Without dead ends: 43 [2023-12-24 21:38:21,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:38:21,297 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:38:21,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:38:21,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-24 21:38:21,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-12-24 21:38:21,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:38:21,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2023-12-24 21:38:21,304 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 35 [2023-12-24 21:38:21,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:38:21,304 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2023-12-24 21:38:21,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-24 21:38:21,305 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2023-12-24 21:38:21,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-24 21:38:21,305 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:38:21,305 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:38:21,321 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 21:38:21,516 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 21:38:21,516 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:38:21,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:38:21,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1571610815, now seen corresponding path program 2 times [2023-12-24 21:38:21,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:38:21,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494556134] [2023-12-24 21:38:21,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:38:21,517 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 21:38:21,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:38:21,518 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 21:38:21,520 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 21:38:21,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:38:21,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:38:21,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-24 21:38:21,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:21,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2023-12-24 21:38:21,774 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 21:38:21,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 13 [2023-12-24 21:38:21,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:38:21,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:38:21,857 INFO L349 Elim1Store]: treesize reduction 57, result has 16.2 percent of original size [2023-12-24 21:38:21,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 61 [2023-12-24 21:38:21,862 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 49 [2023-12-24 21:38:22,090 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 97 treesize of output 57 [2023-12-24 21:38:22,096 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-24 21:38:22,096 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 25 [2023-12-24 21:38:22,104 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:38:22,130 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-24 21:38:22,130 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:38:22,330 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 128 treesize of output 104 [2023-12-24 21:38:22,332 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 108 treesize of output 84 [2023-12-24 21:38:22,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:38:22,429 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 840 treesize of output 720 [2023-12-24 21:38:22,540 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:38:22,540 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 421 treesize of output 1 [2023-12-24 21:38:26,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:26,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494556134] [2023-12-24 21:38:26,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494556134] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:38:26,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [239877589] [2023-12-24 21:38:26,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:38:26,819 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:38:26,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:38:26,869 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 21:38:26,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2023-12-24 21:38:27,113 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:38:27,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:38:27,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 53 conjunts are in the unsatisfiable core [2023-12-24 21:38:27,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:27,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2023-12-24 21:38:27,345 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 21:38:27,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 13 [2023-12-24 21:38:27,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:38:27,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:38:27,486 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-24 21:38:27,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 45 [2023-12-24 21:38:27,491 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 39 treesize of output 30 [2023-12-24 21:38:27,655 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 7 treesize of output 3 [2023-12-24 21:38:27,855 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 0 case distinctions, treesize of input 27 treesize of output 7 [2023-12-24 21:38:27,923 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 62 treesize of output 38 [2023-12-24 21:38:27,932 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-12-24 21:38:27,932 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 20 [2023-12-24 21:38:27,973 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-24 21:38:27,973 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:38:28,330 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 133 treesize of output 109 [2023-12-24 21:38:28,332 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 113 treesize of output 93 [2023-12-24 21:38:29,108 INFO L349 Elim1Store]: treesize reduction 1506, result has 34.1 percent of original size [2023-12-24 21:38:29,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 18544 treesize of output 15620 [2023-12-24 21:38:29,371 INFO L349 Elim1Store]: treesize reduction 11, result has 60.7 percent of original size [2023-12-24 21:38:29,372 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 11352 treesize of output 10944 [2023-12-24 21:38:37,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [239877589] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:38:37,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:38:37,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 29 [2023-12-24 21:38:37,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117744171] [2023-12-24 21:38:37,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:38:37,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-24 21:38:37,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:38:37,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-24 21:38:37,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1829, Unknown=2, NotChecked=0, Total=1980 [2023-12-24 21:38:37,491 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 29 states, 25 states have (on average 1.72) internal successors, (43), 24 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-24 21:38:39,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:38:39,067 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2023-12-24 21:38:39,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 21:38:39,067 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 1.72) internal successors, (43), 24 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2023-12-24 21:38:39,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:38:39,068 INFO L225 Difference]: With dead ends: 63 [2023-12-24 21:38:39,068 INFO L226 Difference]: Without dead ends: 40 [2023-12-24 21:38:39,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=247, Invalid=2403, Unknown=2, NotChecked=0, Total=2652 [2023-12-24 21:38:39,069 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 35 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:38:39,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 179 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-24 21:38:39,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-24 21:38:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-12-24 21:38:39,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-24 21:38:39,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2023-12-24 21:38:39,080 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 36 [2023-12-24 21:38:39,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:38:39,080 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2023-12-24 21:38:39,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 1.72) internal successors, (43), 24 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-24 21:38:39,080 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2023-12-24 21:38:39,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-24 21:38:39,082 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:38:39,083 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:38:39,094 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 21:38:39,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2023-12-24 21:38:39,488 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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 21:38:39,488 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:38:39,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:38:39,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1626364240, now seen corresponding path program 3 times [2023-12-24 21:38:39,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:38:39,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658370042] [2023-12-24 21:38:39,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 21:38:39,490 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 21:38:39,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:38:39,490 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 21:38:39,496 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 21:38:39,689 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-24 21:38:39,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:38:39,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 21:38:39,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:39,750 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-24 21:38:39,750 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:38:39,830 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-24 21:38:39,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:39,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658370042] [2023-12-24 21:38:39,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658370042] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:38:39,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:38:39,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-24 21:38:39,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167154961] [2023-12-24 21:38:39,831 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:38:39,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 21:38:39,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:38:39,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 21:38:39,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-24 21:38:39,832 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 21:38:39,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:38:39,911 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2023-12-24 21:38:39,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 21:38:39,911 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2023-12-24 21:38:39,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:38:39,911 INFO L225 Difference]: With dead ends: 43 [2023-12-24 21:38:39,912 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 21:38:39,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-24 21:38:39,912 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:38:39,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:38:39,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 21:38:39,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 21:38:39,913 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 21:38:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 21:38:39,913 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2023-12-24 21:38:39,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:38:39,913 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 21:38:39,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-24 21:38:39,913 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 21:38:39,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 21:38:39,915 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 21:38:39,922 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 21:38:40,122 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 21:38:40,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 21:38:40,454 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 608) no Hoare annotation was computed. [2023-12-24 21:38:40,454 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 610 625) no Hoare annotation was computed. [2023-12-24 21:38:40,455 INFO L899 garLoopResultBuilder]: For program point L602-1(lines 602 604) no Hoare annotation was computed. [2023-12-24 21:38:40,455 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 623) no Hoare annotation was computed. [2023-12-24 21:38:40,455 INFO L895 garLoopResultBuilder]: At program point L602-3(lines 602 604) the Hoare annotation is: (let ((.cse15 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_remove_first_~head#1.base|) (_ bv0 32))) (.cse7 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32)))) (let ((.cse8 (select (select |#memory_$Pointer$#2.base| .cse7) (_ bv0 32))) (.cse2 (select (select |#memory_$Pointer$#2.base| .cse15) (_ bv0 32)))) (let ((.cse0 (= |ULTIMATE.start_sll_circular_remove_first_~last~1#1.offset| (_ bv0 32))) (.cse1 (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))) (.cse3 (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))) (.cse4 (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_circular_remove_first_~head#1.base|)) (.cse5 (= |ULTIMATE.start_sll_circular_remove_first_~temp~1#1.base| .cse2)) (.cse6 (= |ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset| (_ bv0 32))) (.cse9 (= (select (select |#memory_$Pointer$#2.offset| .cse15) (_ bv0 32)) (_ bv0 32))) (.cse10 (= (_ bv0 32) (select (select |#memory_$Pointer$#2.offset| .cse2) (_ bv0 32)))) (.cse11 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse12 (= (select (select |#memory_$Pointer$#2.base| .cse8) (_ bv0 32)) .cse7)) (.cse13 (= |ULTIMATE.start_sll_circular_remove_first_~head#1.offset| (_ bv0 32))) (.cse14 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32)) (_ bv0 32)))) (or (and .cse0 .cse1 (= .cse2 |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) .cse3 .cse4 .cse5 .cse6 (not (= .cse7 .cse8)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 (not (= (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) (_ bv0 32)) .cse15)) .cse1 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 (= |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| .cse15) .cse12 .cse13 .cse14))))) [2023-12-24 21:38:40,455 INFO L899 garLoopResultBuilder]: For program point L602-4(lines 602 604) no Hoare annotation was computed. [2023-12-24 21:38:40,455 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 621) no Hoare annotation was computed. [2023-12-24 21:38:40,455 INFO L895 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))) (.cse2 (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32))) (.cse3 (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse0 (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse4 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 (= (bvadd (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|) .cse4) (and .cse1 .cse2 .cse3 (= (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not .cse0) .cse4 (= |ULTIMATE.start_sll_circular_create_~len#1| (_ bv1 32))))) [2023-12-24 21:38:40,455 INFO L899 garLoopResultBuilder]: For program point L586-3(lines 586 591) no Hoare annotation was computed. [2023-12-24 21:38:40,455 INFO L895 garLoopResultBuilder]: At program point L615-2(lines 615 618) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32))) (.cse7 (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 32)))) (let ((.cse3 (= .cse7 (_ bv0 32))) (.cse0 (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))) (.cse4 (select |#memory_$Pointer$#2.offset| .cse1)) (.cse6 (select |#memory_$Pointer$#2.base| .cse1)) (.cse2 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (or (and .cse0 (= .cse1 (_ bv0 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) .cse2 .cse3) (let ((.cse5 (select .cse6 (_ bv0 32)))) (and (= (select .cse4 (_ bv0 32)) (_ bv0 32)) .cse0 (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (not (= .cse1 .cse5)) (= (select (select |#memory_$Pointer$#2.offset| .cse5) (_ bv0 32)) (_ bv0 32)) .cse2 (= (select (select |#memory_$Pointer$#2.base| .cse5) (_ bv0 32)) .cse1) .cse3)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) .cse0 (= .cse7 (select .cse4 .cse7)) (= (select .cse6 .cse7) .cse1) .cse2)))) [2023-12-24 21:38:40,455 INFO L899 garLoopResultBuilder]: For program point L615-3(lines 615 618) no Hoare annotation was computed. [2023-12-24 21:38:40,455 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 21:38:40,455 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 609) no Hoare annotation was computed. [2023-12-24 21:38:40,455 INFO L895 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (and (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (bvadd (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (_ bv1 1)) (_ bv0 1)) (= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) [2023-12-24 21:38:40,455 INFO L899 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2023-12-24 21:38:40,456 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 21:38:40,456 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 610 625) no Hoare annotation was computed. [2023-12-24 21:38:40,456 INFO L895 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (and (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_sll_circular_create_~len#1|) (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) [2023-12-24 21:38:40,456 INFO L899 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2023-12-24 21:38:40,456 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-12-24 21:38:40,456 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2023-12-24 21:38:40,456 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-12-24 21:38:40,456 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-12-24 21:38:40,458 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1] [2023-12-24 21:38:40,462 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 21:38:40,473 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0bv32] could not be translated [2023-12-24 21:38:40,474 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0bv32] could not be translated [2023-12-24 21:38:40,474 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][0bv32]][0bv32] could not be translated [2023-12-24 21:38:40,474 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0bv32] could not be translated [2023-12-24 21:38:40,474 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0bv32]][0bv32] could not be translated [2023-12-24 21:38:40,474 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0bv32]][0bv32]][0bv32] could not be translated [2023-12-24 21:38:40,475 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0bv32]][0bv32]][0bv32] could not be translated [2023-12-24 21:38:40,475 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0bv32] could not be translated [2023-12-24 21:38:40,475 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0bv32] could not be translated [2023-12-24 21:38:40,475 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0bv32] could not be translated [2023-12-24 21:38:40,475 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][0bv32]][#memory_$Pointer$#1.offset[~#s~0!base][0bv32]] could not be translated [2023-12-24 21:38:40,475 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0bv32]][#memory_$Pointer$#1.offset[~#s~0!base][0bv32]] could not be translated [2023-12-24 21:38:40,475 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0bv32] could not be translated [2023-12-24 21:38:40,481 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~head!base][0bv32]][0bv32] could not be translated [2023-12-24 21:38:40,481 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-24 21:38:40,481 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~head!base][0bv32]][0bv32] could not be translated [2023-12-24 21:38:40,482 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0bv32] could not be translated [2023-12-24 21:38:40,482 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0bv32]][0bv32] could not be translated [2023-12-24 21:38:40,482 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~head!base][0bv32]][0bv32] could not be translated [2023-12-24 21:38:40,482 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~head!base][0bv32]][0bv32]][0bv32] could not be translated [2023-12-24 21:38:40,482 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0bv32]][0bv32]][0bv32] could not be translated [2023-12-24 21:38:40,482 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0bv32] could not be translated [2023-12-24 21:38:40,482 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-24 21:38:40,482 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0bv32] could not be translated [2023-12-24 21:38:40,482 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~last~1!base][0bv32] could not be translated [2023-12-24 21:38:40,482 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][0bv32] could not be translated [2023-12-24 21:38:40,483 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-24 21:38:40,487 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~head!base][0bv32]][0bv32] could not be translated [2023-12-24 21:38:40,487 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~head!base][0bv32]][0bv32] could not be translated [2023-12-24 21:38:40,487 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~head!base][0bv32]][0bv32]][0bv32] could not be translated [2023-12-24 21:38:40,488 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][0bv32] could not be translated [2023-12-24 21:38:40,488 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0bv32]][0bv32]][0bv32] could not be translated [2023-12-24 21:38:40,488 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0bv32] could not be translated [2023-12-24 21:38:40,488 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-24 21:38:40,488 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0bv32] could not be translated [2023-12-24 21:38:40,489 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-24 21:38:40,489 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head~0!base][0bv32] could not be translated [2023-12-24 21:38:40,489 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][0bv32] could not be translated [2023-12-24 21:38:40,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 09:38:40 BoogieIcfgContainer [2023-12-24 21:38:40,490 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 21:38:40,490 INFO L158 Benchmark]: Toolchain (without parser) took 28261.16ms. Allocated memory was 207.6MB in the beginning and 496.0MB in the end (delta: 288.4MB). Free memory was 157.3MB in the beginning and 209.8MB in the end (delta: -52.5MB). Peak memory consumption was 236.8MB. Max. memory is 8.0GB. [2023-12-24 21:38:40,490 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 207.6MB. Free memory is still 154.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 21:38:40,490 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.50ms. Allocated memory is still 207.6MB. Free memory was 156.9MB in the beginning and 138.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-24 21:38:40,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.36ms. Allocated memory is still 207.6MB. Free memory was 138.0MB in the beginning and 135.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 21:38:40,491 INFO L158 Benchmark]: Boogie Preprocessor took 43.35ms. Allocated memory is still 207.6MB. Free memory was 135.9MB in the beginning and 132.5MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 21:38:40,491 INFO L158 Benchmark]: RCFGBuilder took 324.00ms. Allocated memory was 207.6MB in the beginning and 286.3MB in the end (delta: 78.6MB). Free memory was 132.5MB in the beginning and 254.6MB in the end (delta: -122.1MB). Peak memory consumption was 23.7MB. Max. memory is 8.0GB. [2023-12-24 21:38:40,491 INFO L158 Benchmark]: TraceAbstraction took 27498.46ms. Allocated memory was 286.3MB in the beginning and 496.0MB in the end (delta: 209.7MB). Free memory was 254.0MB in the beginning and 209.8MB in the end (delta: 44.3MB). Peak memory consumption was 254.0MB. Max. memory is 8.0GB. [2023-12-24 21:38:40,492 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 207.6MB. Free memory is still 154.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 350.50ms. Allocated memory is still 207.6MB. Free memory was 156.9MB in the beginning and 138.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.36ms. Allocated memory is still 207.6MB. Free memory was 138.0MB in the beginning and 135.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.35ms. Allocated memory is still 207.6MB. Free memory was 135.9MB in the beginning and 132.5MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 324.00ms. Allocated memory was 207.6MB in the beginning and 286.3MB in the end (delta: 78.6MB). Free memory was 132.5MB in the beginning and 254.6MB in the end (delta: -122.1MB). Peak memory consumption was 23.7MB. Max. memory is 8.0GB. * TraceAbstraction took 27498.46ms. Allocated memory was 286.3MB in the beginning and 496.0MB in the end (delta: 209.7MB). Free memory was 254.0MB in the beginning and 209.8MB in the end (delta: 44.3MB). Peak memory consumption was 254.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][0bv32]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0bv32]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0bv32]][0bv32]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0bv32]][0bv32]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][0bv32]][#memory_$Pointer$#1.offset[~#s~0!base][0bv32]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0bv32]][#memory_$Pointer$#1.offset[~#s~0!base][0bv32]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~head!base][0bv32]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~head!base][0bv32]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0bv32]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~head!base][0bv32]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~head!base][0bv32]][0bv32]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0bv32]][0bv32]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~last~1!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~head!base][0bv32]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~head!base][0bv32]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~head!base][0bv32]][0bv32]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0bv32]][0bv32]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][0bv32] 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: 623]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.4s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 153 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 843 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 22 IncrementalHoareTripleChecker+Unchecked, 651 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 816 IncrementalHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 192 mSDtfsCounter, 816 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 560 GetRequests, 438 SyntacticMatches, 4 SemanticMatches, 118 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=8, InterpolantAutomatonStates: 72, 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, 11 MinimizatonAttempts, 31 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 8 PreInvPairs, 16 NumberOfFragments, 468 HoareAnnotationTreeSize, 8 FormulaSimplifications, 548 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FormulaSimplificationsInter, 161 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 17.7s InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 486 ConstructedInterpolants, 5 QuantifiedInterpolants, 3727 SizeOfPredicates, 102 NumberOfNonLiveVariables, 2302 ConjunctsInSsa, 218 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 226/267 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: 615]: Loop Invariant Derived loop invariant: ((((i == 2) && (2 == len)) || ((i == 0) && (2 == len))) || ((i == 1) && (2 == len))) - InvariantResult [Line: 602]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 586]: Loop Invariant Derived loop invariant: (((2 == len) && (2 == len)) || ((2 == len) && (len == 1))) RESULT: Ultimate proved your program to be correct! [2023-12-24 21:38:40,536 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...