/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_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 21:38:43,597 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 21:38:43,659 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:43,663 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 21:38:43,663 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 21:38:43,684 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 21:38:43,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 21:38:43,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 21:38:43,686 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 21:38:43,688 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 21:38:43,689 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 21:38:43,689 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 21:38:43,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 21:38:43,690 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 21:38:43,691 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 21:38:43,691 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 21:38:43,691 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 21:38:43,691 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 21:38:43,692 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 21:38:43,692 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 21:38:43,692 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 21:38:43,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 21:38:43,693 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 21:38:43,693 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 21:38:43,693 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 21:38:43,693 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 21:38:43,693 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 21:38:43,693 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 21:38:43,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 21:38:43,694 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 21:38:43,694 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 21:38:43,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 21:38:43,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 21:38:43,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 21:38:43,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:38:43,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 21:38:43,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 21:38:43,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 21:38:43,695 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 21:38:43,695 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 21:38:43,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 21:38:43,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 21:38:43,696 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 21:38:43,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 21:38:43,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 21:38:43,696 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 21:38:43,696 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:43,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 21:38:43,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 21:38:43,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 21:38:43,891 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 21:38:43,895 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 21:38:43,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_remove_all_reverse.i [2023-12-24 21:38:44,768 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 21:38:45,002 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 21:38:45,003 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_remove_all_reverse.i [2023-12-24 21:38:45,011 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/283d83754/c0952152daf24c5b8908a895d3aa6feb/FLAGc6f23114b [2023-12-24 21:38:45,020 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/283d83754/c0952152daf24c5b8908a895d3aa6feb [2023-12-24 21:38:45,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 21:38:45,023 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 21:38:45,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 21:38:45,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 21:38:45,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 21:38:45,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:38:45" (1/1) ... [2023-12-24 21:38:45,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41f97319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:45, skipping insertion in model container [2023-12-24 21:38:45,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:38:45" (1/1) ... [2023-12-24 21:38:45,063 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 21:38:45,242 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_reverse.i[24151,24164] [2023-12-24 21:38:45,245 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:38:45,268 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 21:38:45,309 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_reverse.i[24151,24164] [2023-12-24 21:38:45,309 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:38:45,329 INFO L206 MainTranslator]: Completed translation [2023-12-24 21:38:45,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:45 WrapperNode [2023-12-24 21:38:45,330 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 21:38:45,331 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 21:38:45,331 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 21:38:45,331 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 21:38:45,336 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:45" (1/1) ... [2023-12-24 21:38:45,351 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:45" (1/1) ... [2023-12-24 21:38:45,378 INFO L138 Inliner]: procedures = 129, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 121 [2023-12-24 21:38:45,378 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 21:38:45,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 21:38:45,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 21:38:45,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 21:38:45,386 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:45" (1/1) ... [2023-12-24 21:38:45,386 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:45" (1/1) ... [2023-12-24 21:38:45,389 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:45" (1/1) ... [2023-12-24 21:38:45,403 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 9, 9]. 45 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 6 writes are split as follows [0, 5, 1]. [2023-12-24 21:38:45,403 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:45" (1/1) ... [2023-12-24 21:38:45,404 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:45" (1/1) ... [2023-12-24 21:38:45,417 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:45" (1/1) ... [2023-12-24 21:38:45,424 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:45" (1/1) ... [2023-12-24 21:38:45,426 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:45" (1/1) ... [2023-12-24 21:38:45,427 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:45" (1/1) ... [2023-12-24 21:38:45,430 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 21:38:45,430 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 21:38:45,430 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 21:38:45,431 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 21:38:45,431 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:45" (1/1) ... [2023-12-24 21:38:45,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:38:45,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 21:38:45,463 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:45,493 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:45,513 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-24 21:38:45,513 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-24 21:38:45,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 21:38:45,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 21:38:45,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-24 21:38:45,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 21:38:45,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 21:38:45,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-24 21:38:45,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 21:38:45,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 21:38:45,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-24 21:38:45,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 21:38:45,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 21:38:45,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 21:38:45,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 21:38:45,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-24 21:38:45,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-24 21:38:45,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-24 21:38:45,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 21:38:45,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 21:38:45,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 21:38:45,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 21:38:45,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 21:38:45,608 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 21:38:45,609 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 21:38:45,796 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 21:38:45,827 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 21:38:45,827 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-24 21:38:45,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:38:45 BoogieIcfgContainer [2023-12-24 21:38:45,828 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 21:38:45,829 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 21:38:45,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 21:38:45,832 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 21:38:45,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 09:38:45" (1/3) ... [2023-12-24 21:38:45,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725de6cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:38:45, skipping insertion in model container [2023-12-24 21:38:45,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:38:45" (2/3) ... [2023-12-24 21:38:45,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725de6cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:38:45, skipping insertion in model container [2023-12-24 21:38:45,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:38:45" (3/3) ... [2023-12-24 21:38:45,834 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all_reverse.i [2023-12-24 21:38:45,854 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 21:38:45,854 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 21:38:45,885 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 21:38:45,891 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;@1bdae880, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 21:38:45,891 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 21:38:45,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 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:45,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-24 21:38:45,913 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:38:45,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:38:45,914 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:38:45,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:38:45,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1696884172, now seen corresponding path program 1 times [2023-12-24 21:38:45,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:38:45,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811112969] [2023-12-24 21:38:45,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:38:45,927 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:38:45,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:38:45,928 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:45,931 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:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:38:46,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 21:38:46,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:46,072 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:46,072 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:38:46,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:46,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811112969] [2023-12-24 21:38:46,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811112969] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:38:46,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:38:46,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:38:46,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269862869] [2023-12-24 21:38:46,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:38:46,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 21:38:46,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:38:46,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 21:38:46,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:38:46,105 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 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:46,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:38:46,137 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2023-12-24 21:38:46,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 21:38:46,139 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:46,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:38:46,144 INFO L225 Difference]: With dead ends: 42 [2023-12-24 21:38:46,144 INFO L226 Difference]: Without dead ends: 23 [2023-12-24 21:38:46,146 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:46,149 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:38:46,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 21:38:46,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-24 21:38:46,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-24 21:38:46,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2023-12-24 21:38:46,173 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 12 [2023-12-24 21:38:46,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:38:46,174 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-12-24 21:38:46,174 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:46,174 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2023-12-24 21:38:46,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-24 21:38:46,175 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:38:46,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:38:46,182 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:46,383 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:46,383 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:38:46,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:38:46,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1523887835, now seen corresponding path program 1 times [2023-12-24 21:38:46,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:38:46,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237070892] [2023-12-24 21:38:46,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:38:46,387 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:46,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:38:46,388 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:46,412 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:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:38:46,489 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 21:38:46,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:46,529 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:46,529 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:38:46,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:46,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237070892] [2023-12-24 21:38:46,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1237070892] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:38:46,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:38:46,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 21:38:46,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989635445] [2023-12-24 21:38:46,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:38:46,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:38:46,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:38:46,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:38:46,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:38:46,532 INFO L87 Difference]: Start difference. First operand 23 states and 28 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:46,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:38:46,587 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2023-12-24 21:38:46,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:38:46,588 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:46,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:38:46,589 INFO L225 Difference]: With dead ends: 40 [2023-12-24 21:38:46,590 INFO L226 Difference]: Without dead ends: 26 [2023-12-24 21:38:46,590 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:46,592 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:38:46,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 21:38:46,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-24 21:38:46,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-12-24 21:38:46,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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:46,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2023-12-24 21:38:46,597 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 12 [2023-12-24 21:38:46,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:38:46,597 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2023-12-24 21:38:46,598 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:46,598 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2023-12-24 21:38:46,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-24 21:38:46,598 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:38:46,598 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:46,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 21:38:46,800 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:46,801 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:38:46,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:38:46,802 INFO L85 PathProgramCache]: Analyzing trace with hash 815803536, now seen corresponding path program 1 times [2023-12-24 21:38:46,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:38:46,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213020662] [2023-12-24 21:38:46,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:38:46,803 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:46,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:38:46,804 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:46,805 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:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:38:46,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 21:38:46,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:46,942 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:46,942 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:38:46,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:46,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213020662] [2023-12-24 21:38:46,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1213020662] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:38:46,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:38:46,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 21:38:46,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626270976] [2023-12-24 21:38:46,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:38:46,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:38:46,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:38:46,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:38:46,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:38:46,950 INFO L87 Difference]: Start difference. First operand 24 states and 29 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:47,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:38:47,007 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2023-12-24 21:38:47,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 21:38:47,008 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:47,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:38:47,010 INFO L225 Difference]: With dead ends: 37 [2023-12-24 21:38:47,010 INFO L226 Difference]: Without dead ends: 33 [2023-12-24 21:38:47,011 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:47,014 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 39 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 42 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:47,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 42 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:47,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-24 21:38:47,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2023-12-24 21:38:47,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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:47,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-12-24 21:38:47,025 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 18 [2023-12-24 21:38:47,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:38:47,025 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-12-24 21:38:47,026 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:47,026 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-12-24 21:38:47,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-24 21:38:47,027 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:38:47,027 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:38:47,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-24 21:38:47,230 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:47,231 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:38:47,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:38:47,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1293093265, now seen corresponding path program 1 times [2023-12-24 21:38:47,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:38:47,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835403283] [2023-12-24 21:38:47,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:38:47,232 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:47,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:38:47,233 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:47,235 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:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:38:47,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 21:38:47,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:47,442 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:47,443 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:38:47,511 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:47,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:47,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835403283] [2023-12-24 21:38:47,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835403283] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:38:47,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:38:47,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-24 21:38:47,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26698883] [2023-12-24 21:38:47,514 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:38:47,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 21:38:47,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:38:47,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 21:38:47,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-24 21:38:47,517 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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:47,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:38:47,604 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2023-12-24 21:38:47,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 21:38:47,604 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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 24 [2023-12-24 21:38:47,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:38:47,604 INFO L225 Difference]: With dead ends: 46 [2023-12-24 21:38:47,604 INFO L226 Difference]: Without dead ends: 42 [2023-12-24 21:38:47,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 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:47,605 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 84 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:38:47,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 78 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:38:47,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-24 21:38:47,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2023-12-24 21:38:47,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 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:47,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2023-12-24 21:38:47,609 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 24 [2023-12-24 21:38:47,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:38:47,610 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2023-12-24 21:38:47,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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:47,610 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2023-12-24 21:38:47,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-24 21:38:47,610 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:38:47,610 INFO L195 NwaCegarLoop]: trace histogram [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:47,616 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:47,811 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:47,811 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:38:47,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:38:47,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1038982702, now seen corresponding path program 2 times [2023-12-24 21:38:47,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:38:47,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004363691] [2023-12-24 21:38:47,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:38:47,812 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:47,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:38:47,829 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:47,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 21:38:47,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:38:47,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:38:47,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 21:38:47,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:48,052 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:48,057 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:48,096 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-24 21:38:48,096 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:38:48,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:48,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004363691] [2023-12-24 21:38:48,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004363691] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:38:48,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:38:48,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 21:38:48,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146842117] [2023-12-24 21:38:48,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:38:48,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 21:38:48,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:38:48,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 21:38:48,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 21:38:48,101 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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:48,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:38:48,233 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2023-12-24 21:38:48,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 21:38:48,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 30 [2023-12-24 21:38:48,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:38:48,235 INFO L225 Difference]: With dead ends: 49 [2023-12-24 21:38:48,235 INFO L226 Difference]: Without dead ends: 34 [2023-12-24 21:38:48,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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:48,236 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 18 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:38:48,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 74 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:38:48,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-24 21:38:48,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-12-24 21:38:48,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 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:48,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2023-12-24 21:38:48,240 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 30 [2023-12-24 21:38:48,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:38:48,240 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2023-12-24 21:38:48,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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:48,240 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2023-12-24 21:38:48,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-24 21:38:48,241 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:38:48,241 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:38:48,247 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:48,441 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:48,442 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:38:48,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:38:48,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1906109968, now seen corresponding path program 1 times [2023-12-24 21:38:48,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:38:48,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230835133] [2023-12-24 21:38:48,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:38:48,443 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:48,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:38:48,444 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:48,445 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:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:38:48,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 21:38:48,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:48,638 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 15 treesize of output 7 [2023-12-24 21:38:48,661 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-24 21:38:48,661 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:38:48,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:48,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230835133] [2023-12-24 21:38:48,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230835133] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:38:48,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:38:48,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-24 21:38:48,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830495431] [2023-12-24 21:38:48,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:38:48,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 21:38:48,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:38:48,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 21:38:48,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-24 21:38:48,665 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:38:48,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:38:48,900 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2023-12-24 21:38:48,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-24 21:38:48,901 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2023-12-24 21:38:48,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:38:48,902 INFO L225 Difference]: With dead ends: 62 [2023-12-24 21:38:48,902 INFO L226 Difference]: Without dead ends: 40 [2023-12-24 21:38:48,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-12-24 21:38:48,902 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 22 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:38:48,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 126 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 21:38:48,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-24 21:38:48,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2023-12-24 21:38:48,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 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:48,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2023-12-24 21:38:48,908 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 36 [2023-12-24 21:38:48,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:38:48,908 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2023-12-24 21:38:48,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-24 21:38:48,908 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2023-12-24 21:38:48,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-24 21:38:48,909 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:38:48,909 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:38:48,915 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:49,113 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:49,114 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:38:49,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:38:49,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1465101296, now seen corresponding path program 1 times [2023-12-24 21:38:49,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:38:49,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656848387] [2023-12-24 21:38:49,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:38:49,115 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:49,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:38:49,117 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:49,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-24 21:38:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:38:49,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-24 21:38:49,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:49,459 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 19 treesize of output 11 [2023-12-24 21:38:49,466 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 23 treesize of output 15 [2023-12-24 21:38:49,567 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:49,575 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:49,579 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 15 treesize of output 7 [2023-12-24 21:38:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-24 21:38:49,602 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:38:49,688 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 64 treesize of output 52 [2023-12-24 21:38:49,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:38:49,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 21:38:49,770 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-24 21:38:49,770 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 11 treesize of output 11 [2023-12-24 21:38:49,824 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-24 21:38:49,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:49,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656848387] [2023-12-24 21:38:49,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656848387] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:38:49,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:38:49,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2023-12-24 21:38:49,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736798838] [2023-12-24 21:38:49,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:38:49,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-24 21:38:49,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:38:49,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-24 21:38:49,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2023-12-24 21:38:49,826 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-24 21:38:50,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:38:50,291 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2023-12-24 21:38:50,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 21:38:50,292 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2023-12-24 21:38:50,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:38:50,293 INFO L225 Difference]: With dead ends: 71 [2023-12-24 21:38:50,293 INFO L226 Difference]: Without dead ends: 51 [2023-12-24 21:38:50,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2023-12-24 21:38:50,294 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 21:38:50,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 213 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 21:38:50,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-24 21:38:50,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2023-12-24 21:38:50,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 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:50,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2023-12-24 21:38:50,299 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 40 [2023-12-24 21:38:50,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:38:50,300 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2023-12-24 21:38:50,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-24 21:38:50,300 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2023-12-24 21:38:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-24 21:38:50,300 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:38:50,300 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:38:50,307 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:50,507 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:50,508 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:38:50,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:38:50,508 INFO L85 PathProgramCache]: Analyzing trace with hash 721078123, now seen corresponding path program 1 times [2023-12-24 21:38:50,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:38:50,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442124369] [2023-12-24 21:38:50,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:38:50,509 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:50,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:38:50,510 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:50,512 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:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:38:50,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 21:38:50,625 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:50,673 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 38 treesize of output 26 [2023-12-24 21:38:50,676 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 30 treesize of output 18 [2023-12-24 21:38:50,693 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 15 treesize of output 7 [2023-12-24 21:38:50,696 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 15 treesize of output 7 [2023-12-24 21:38:50,707 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-24 21:38:50,708 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:38:50,752 INFO L349 Elim1Store]: treesize reduction 4, result has 78.9 percent of original size [2023-12-24 21:38:50,753 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 19 treesize of output 19 [2023-12-24 21:38:50,761 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-24 21:38:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-24 21:38:50,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:50,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442124369] [2023-12-24 21:38:50,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442124369] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:38:50,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:38:50,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2023-12-24 21:38:50,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294919366] [2023-12-24 21:38:50,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:38:50,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 21:38:50,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:38:50,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 21:38:50,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:38:50,772 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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:50,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:38:50,973 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2023-12-24 21:38:50,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 21:38:50,973 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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 42 [2023-12-24 21:38:50,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:38:50,974 INFO L225 Difference]: With dead ends: 83 [2023-12-24 21:38:50,974 INFO L226 Difference]: Without dead ends: 54 [2023-12-24 21:38:50,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-24 21:38:50,975 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:38:50,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 70 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 21:38:50,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-24 21:38:50,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2023-12-24 21:38:50,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 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:50,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2023-12-24 21:38:50,985 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 42 [2023-12-24 21:38:50,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:38:50,985 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2023-12-24 21:38:50,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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:50,986 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2023-12-24 21:38:50,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-24 21:38:50,986 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:38:50,986 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 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:50,995 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:51,192 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:51,192 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:38:51,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:38:51,193 INFO L85 PathProgramCache]: Analyzing trace with hash 336492294, now seen corresponding path program 2 times [2023-12-24 21:38:51,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:38:51,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081385073] [2023-12-24 21:38:51,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:38:51,194 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:51,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:38:51,209 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:51,221 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:51,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:38:51,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:38:51,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-24 21:38:51,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:51,389 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:51,479 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 21:38:51,480 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:51,504 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:51,510 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:51,561 INFO L349 Elim1Store]: treesize reduction 57, result has 16.2 percent of original size [2023-12-24 21:38:51,561 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:51,571 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:51,741 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:51,749 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-24 21:38:51,749 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:51,754 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:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-24 21:38:51,785 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:38:51,935 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:51,939 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:52,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:38:52,030 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:52,180 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-24 21:38:52,181 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 1 [2023-12-24 21:38:56,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:38:56,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081385073] [2023-12-24 21:38:56,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2081385073] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:38:56,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1494495130] [2023-12-24 21:38:56,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:38:56,441 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 21:38:56,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 21:38:56,485 INFO L229 MonitoredProcess]: Starting monitored process 11 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:56,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-12-24 21:38:56,729 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:38:56,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:38:56,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-24 21:38:56,738 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:38:56,767 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:56,874 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 21:38:56,875 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:56,928 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:56,932 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:57,019 INFO L349 Elim1Store]: treesize reduction 57, result has 16.2 percent of original size [2023-12-24 21:38:57,020 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:57,029 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:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-24 21:38:57,570 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:38:57,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 109 [2023-12-24 21:38:57,854 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:58,957 INFO L349 Elim1Store]: treesize reduction 1506, result has 34.1 percent of original size [2023-12-24 21:38:58,957 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 18988 treesize of output 16064 [2023-12-24 21:38:59,250 INFO L349 Elim1Store]: treesize reduction 22, result has 60.0 percent of original size [2023-12-24 21:38:59,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 20393 treesize of output 19241 [2023-12-24 21:39:11,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1494495130] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 21:39:11,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:39:11,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 24 [2023-12-24 21:39:11,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071373460] [2023-12-24 21:39:11,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:39:11,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-24 21:39:11,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:39:11,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-24 21:39:11,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1337, Unknown=3, NotChecked=0, Total=1482 [2023-12-24 21:39:11,109 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 24 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 19 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-24 21:39:11,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:39:11,859 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2023-12-24 21:39:11,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 21:39:11,860 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 19 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 44 [2023-12-24 21:39:11,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:39:11,861 INFO L225 Difference]: With dead ends: 100 [2023-12-24 21:39:11,861 INFO L226 Difference]: Without dead ends: 57 [2023-12-24 21:39:11,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=180, Invalid=1623, Unknown=3, NotChecked=0, Total=1806 [2023-12-24 21:39:11,862 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 22 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 21:39:11,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 258 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 21:39:11,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-24 21:39:11,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2023-12-24 21:39:11,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 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:39:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2023-12-24 21:39:11,868 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 44 [2023-12-24 21:39:11,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:39:11,869 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2023-12-24 21:39:11,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 19 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-24 21:39:11,869 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2023-12-24 21:39:11,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-24 21:39:11,869 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:39:11,869 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:39:11,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2023-12-24 21:39:12,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-24 21:39:12,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:39:12,273 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:39:12,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:39:12,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1311629499, now seen corresponding path program 3 times [2023-12-24 21:39:12,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:39:12,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106163680] [2023-12-24 21:39:12,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 21:39:12,273 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:39:12,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:39:12,274 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:39:12,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-24 21:39:12,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-24 21:39:12,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:39:12,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 21:39:12,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:39:12,436 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-24 21:39:12,436 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:39:12,469 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-12-24 21:39:12,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:39:12,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106163680] [2023-12-24 21:39:12,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [106163680] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:39:12,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:39:12,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-24 21:39:12,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505257255] [2023-12-24 21:39:12,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:39:12,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 21:39:12,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:39:12,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 21:39:12,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:39:12,472 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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:39:12,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:39:12,524 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2023-12-24 21:39:12,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 21:39:12,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 50 [2023-12-24 21:39:12,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:39:12,525 INFO L225 Difference]: With dead ends: 59 [2023-12-24 21:39:12,526 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 21:39:12,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 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:39:12,529 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 21:39:12,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 21:39:12,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 21:39:12,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 21:39:12,530 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:39:12,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 21:39:12,530 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2023-12-24 21:39:12,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:39:12,530 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 21:39:12,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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:39:12,530 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 21:39:12,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 21:39:12,532 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 21:39:12,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-24 21:39:12,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:39:12,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 21:39:13,195 INFO L899 garLoopResultBuilder]: For program point L605-1(lines 605 607) no Hoare annotation was computed. [2023-12-24 21:39:13,195 INFO L895 garLoopResultBuilder]: At program point L605-3(lines 605 607) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_circular_remove_last_~head#1.offset|)) (.cse3 (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_circular_remove_last_~head#1.base|)) (.cse4 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse5 (= (_ bv0 32) (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))) (or (let ((.cse0 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_remove_last_~head#1.base|) |ULTIMATE.start_sll_circular_remove_last_~head#1.offset|)) (.cse1 (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_remove_last_~head#1.base|) |ULTIMATE.start_sll_circular_remove_last_~head#1.offset|))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= .cse0 |ULTIMATE.start_sll_circular_remove_last_~snd_to_last~0#1.base|) (= .cse1 |ULTIMATE.start_sll_circular_remove_last_~snd_to_last~0#1.offset|) .cse2 (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_remove_last_~snd_to_last~0#1.base|) |ULTIMATE.start_sll_circular_remove_last_~snd_to_last~0#1.offset|) |ULTIMATE.start_sll_circular_remove_last_~last~1#1.base|) .cse3 .cse4 (= |ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset| (select (select |#memory_$Pointer$#1.offset| .cse0) .cse1)) .cse5)) (and (bvslt |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) (= (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)) .cse2 .cse3 .cse4 .cse5))) [2023-12-24 21:39:13,196 INFO L899 garLoopResultBuilder]: For program point L605-4(lines 605 607) no Hoare annotation was computed. [2023-12-24 21:39:13,196 INFO L899 garLoopResultBuilder]: For program point L597-1(lines 597 599) no Hoare annotation was computed. [2023-12-24 21:39:13,196 INFO L895 garLoopResultBuilder]: At program point L597-3(lines 597 599) the Hoare annotation is: (let ((.cse18 (select |#memory_$Pointer$#2.base| |ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse19 (select .cse18 (_ bv0 32)))) (let ((.cse17 (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse8 (select |#memory_$Pointer$#2.base| |ULTIMATE.start_sll_circular_remove_last_~head#1.base|)) (.cse21 (select (select |#memory_$Pointer$#1.offset| .cse19) (_ bv0 32))) (.cse20 (select (select |#memory_$Pointer$#1.base| .cse19) (_ bv0 32)))) (let ((.cse2 (= |ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset| (_ bv0 32))) (.cse9 (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))) (.cse11 (not (= .cse19 .cse20))) (.cse12 (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))) (.cse13 (= |ULTIMATE.start_sll_circular_remove_last_~head#1.offset| (_ bv0 32))) (.cse15 (= (select (select |#memory_$Pointer$#1.offset| .cse20) .cse21) (_ bv0 32))) (.cse16 (= .cse19 (select (select |#memory_$Pointer$#1.base| .cse20) .cse21))) (.cse14 (select .cse8 (_ bv0 32))) (.cse10 (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_circular_remove_last_~head#1.base|) (_ bv0 32))) (.cse1 (bvslt |ULTIMATE.start_main_~i~0#1| (_ bv2 32))) (.cse3 (select .cse18 |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_circular_remove_last_~head#1.offset|)) (.cse5 (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_circular_remove_last_~head#1.base|)) (.cse6 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse7 (= (_ bv0 32) (select .cse17 |ULTIMATE.start_main_~#s~0#1.offset|)))) (or (let ((.cse0 (select .cse8 |ULTIMATE.start_sll_circular_remove_last_~head#1.offset|))) (and (= .cse0 |ULTIMATE.start_sll_circular_remove_last_~last~1#1.base|) .cse1 .cse2 (= (select (select |#memory_$Pointer$#1.offset| .cse0) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$#1.base| .cse3) (_ bv0 32)) .cse3) .cse4 .cse5 .cse6 .cse7)) (and .cse9 (= .cse10 (_ bv0 32)) .cse11 .cse12 .cse2 .cse13 (= |ULTIMATE.start_sll_circular_remove_last_~last~1#1.base| .cse14) .cse15 .cse5 .cse6 .cse16) (and (= (select .cse17 (_ bv0 32)) (_ bv0 32)) .cse9 .cse11 .cse12 .cse13 .cse15 .cse5 .cse6 .cse16 (= (select (select |#memory_$Pointer$#1.offset| .cse14) .cse10) |ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset|) (= (select (select |#memory_$Pointer$#1.base| .cse14) .cse10) |ULTIMATE.start_sll_circular_remove_last_~last~1#1.base|)) (and .cse1 (= .cse3 (_ bv0 32)) .cse4 .cse5 .cse6 .cse7)))))) [2023-12-24 21:39:13,196 INFO L899 garLoopResultBuilder]: For program point L597-4(lines 597 599) no Hoare annotation was computed. [2023-12-24 21:39:13,196 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 612 626) no Hoare annotation was computed. [2023-12-24 21:39:13,196 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 624) no Hoare annotation was computed. [2023-12-24 21:39:13,196 INFO L895 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse0 (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32))) (.cse2 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|))) (or (and .cse0 (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (_ bv0 32)) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (_ bv0 32) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not .cse1) .cse2 (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) (_ bv0 32))) (= |ULTIMATE.start_sll_circular_create_~len#1| (_ bv1 32))) (and .cse1 .cse0 (= (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|) .cse2 (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) [2023-12-24 21:39:13,196 INFO L899 garLoopResultBuilder]: For program point L586-3(lines 586 591) no Hoare annotation was computed. [2023-12-24 21:39:13,196 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 21:39:13,196 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 611) no Hoare annotation was computed. [2023-12-24 21:39:13,196 INFO L899 garLoopResultBuilder]: For program point L620(lines 620 622) no Hoare annotation was computed. [2023-12-24 21:39:13,196 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)) (= (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|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) [2023-12-24 21:39:13,196 INFO L899 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2023-12-24 21:39:13,196 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 21:39:13,196 INFO L899 garLoopResultBuilder]: For program point L600(lines 600 610) no Hoare annotation was computed. [2023-12-24 21:39:13,197 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 612 626) no Hoare annotation was computed. [2023-12-24 21:39:13,197 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:39:13,197 INFO L899 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2023-12-24 21:39:13,197 INFO L895 garLoopResultBuilder]: At program point L617-3(lines 617 619) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select |#memory_$Pointer$#2.base| |ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse6 (select .cse5 |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (= (_ bv0 32) (select .cse0 |ULTIMATE.start_main_~#s~0#1.offset|)))) (or (let ((.cse1 (select .cse5 (_ bv0 32)))) (let ((.cse2 (select (select |#memory_$Pointer$#1.base| .cse1) (_ bv0 32))) (.cse3 (select (select |#memory_$Pointer$#1.offset| .cse1) (_ bv0 32)))) (and (= (select .cse0 (_ bv0 32)) (_ bv0 32)) (= |ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) (not (= .cse1 .cse2)) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= (select (select |#memory_$Pointer$#1.offset| .cse2) .cse3) (_ bv0 32)) .cse4 (= .cse1 (select (select |#memory_$Pointer$#1.base| .cse2) .cse3))))) (and (= .cse6 (_ bv0 32)) .cse4 .cse7) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= (select (select |#memory_$Pointer$#1.base| .cse6) (_ bv0 32)) .cse6) .cse4 (= (select (select |#memory_$Pointer$#1.offset| .cse6) (_ bv0 32)) (_ bv0 32)) .cse7)))) [2023-12-24 21:39:13,197 INFO L899 garLoopResultBuilder]: For program point L617-4(lines 617 619) no Hoare annotation was computed. [2023-12-24 21:39:13,197 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-12-24 21:39:13,197 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2023-12-24 21:39:13,197 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (= |old(#valid)| |#valid|) [2023-12-24 21:39:13,197 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2023-12-24 21:39:13,199 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2023-12-24 21:39:13,201 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 21:39:13,208 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head!base][~head!offset] could not be translated [2023-12-24 21:39:13,211 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~head!base][~head!offset]][0bv32] could not be translated [2023-12-24 21:39:13,211 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][~#s~0!offset]][0bv32] could not be translated [2023-12-24 21:39:13,211 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][~#s~0!offset] could not be translated [2023-12-24 21:39:13,211 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-24 21:39:13,211 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-24 21:39:13,211 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][~#s~0!offset] could not be translated [2023-12-24 21:39:13,211 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head!base][0bv32] could not be translated [2023-12-24 21:39:13,211 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0bv32] could not be translated [2023-12-24 21:39:13,211 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32] could not be translated [2023-12-24 21:39:13,211 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-24 21:39:13,212 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head!base][0bv32] could not be translated [2023-12-24 21:39:13,212 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32]][#memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32]] could not be translated [2023-12-24 21:39:13,212 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-24 21:39:13,212 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0bv32] could not be translated [2023-12-24 21:39:13,212 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32]][#memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32]] could not be translated [2023-12-24 21:39:13,212 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0bv32] could not be translated [2023-12-24 21:39:13,212 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0bv32] could not be translated [2023-12-24 21:39:13,212 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32] could not be translated [2023-12-24 21:39:13,212 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-24 21:39:13,212 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32]][#memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32]] could not be translated [2023-12-24 21:39:13,212 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-24 21:39:13,212 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0bv32] could not be translated [2023-12-24 21:39:13,212 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32]][#memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32]] could not be translated [2023-12-24 21:39:13,213 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~head!base][0bv32]][#memory_$Pointer$#2.offset[~head!base][0bv32]] could not be translated [2023-12-24 21:39:13,213 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~head!base][0bv32]][#memory_$Pointer$#2.offset[~head!base][0bv32]] could not be translated [2023-12-24 21:39:13,213 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][~#s~0!offset] could not be translated [2023-12-24 21:39:13,213 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-24 21:39:13,213 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-24 21:39:13,213 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][~#s~0!offset] could not be translated [2023-12-24 21:39:13,214 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][0bv32] could not be translated [2023-12-24 21:39:13,214 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][0bv32] could not be translated [2023-12-24 21:39:13,214 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-24 21:39:13,215 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0bv32] could not be translated [2023-12-24 21:39:13,215 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0bv32] could not be translated [2023-12-24 21:39:13,215 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32] could not be translated [2023-12-24 21:39:13,215 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32]][#memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32]] could not be translated [2023-12-24 21:39:13,215 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0bv32] could not be translated [2023-12-24 21:39:13,215 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32]][#memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32]] could not be translated [2023-12-24 21:39:13,216 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][~#s~0!offset] could not be translated [2023-12-24 21:39:13,216 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][~#s~0!offset] could not be translated [2023-12-24 21:39:13,216 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][~#s~0!offset]][0bv32] could not be translated [2023-12-24 21:39:13,216 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][~#s~0!offset] could not be translated [2023-12-24 21:39:13,216 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][~#s~0!offset]][0bv32] could not be translated [2023-12-24 21:39:13,216 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][~#s~0!offset] could not be translated [2023-12-24 21:39:13,217 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head!base][~head!offset] could not be translated [2023-12-24 21:39:13,217 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head!base][~head!offset] could not be translated [2023-12-24 21:39:13,217 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-24 21:39:13,217 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~snd_to_last~0!base][~snd_to_last~0!offset] could not be translated [2023-12-24 21:39:13,217 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-24 21:39:13,217 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~head!base][~head!offset]][#memory_$Pointer$#2.offset[~head!base][~head!offset]] could not be translated [2023-12-24 21:39:13,217 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][~#s~0!offset] could not be translated [2023-12-24 21:39:13,217 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][~#s~0!offset] could not be translated [2023-12-24 21:39:13,217 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-24 21:39:13,217 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-24 21:39:13,217 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][~#s~0!offset] could not be translated [2023-12-24 21:39:13,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 09:39:13 BoogieIcfgContainer [2023-12-24 21:39:13,218 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 21:39:13,218 INFO L158 Benchmark]: Toolchain (without parser) took 28195.06ms. Allocated memory was 225.4MB in the beginning and 494.9MB in the end (delta: 269.5MB). Free memory was 163.7MB in the beginning and 387.5MB in the end (delta: -223.8MB). Peak memory consumption was 46.6MB. Max. memory is 8.0GB. [2023-12-24 21:39:13,218 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 225.4MB. Free memory is still 175.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 21:39:13,218 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.27ms. Allocated memory is still 225.4MB. Free memory was 163.5MB in the beginning and 144.3MB in the end (delta: 19.2MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-24 21:39:13,218 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.98ms. Allocated memory is still 225.4MB. Free memory was 144.3MB in the beginning and 142.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 21:39:13,219 INFO L158 Benchmark]: Boogie Preprocessor took 51.42ms. Allocated memory is still 225.4MB. Free memory was 142.0MB in the beginning and 138.6MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 21:39:13,219 INFO L158 Benchmark]: RCFGBuilder took 397.61ms. Allocated memory was 225.4MB in the beginning and 319.8MB in the end (delta: 94.4MB). Free memory was 138.6MB in the beginning and 268.1MB in the end (delta: -129.5MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. [2023-12-24 21:39:13,219 INFO L158 Benchmark]: TraceAbstraction took 27388.21ms. Allocated memory was 319.8MB in the beginning and 494.9MB in the end (delta: 175.1MB). Free memory was 267.5MB in the beginning and 387.5MB in the end (delta: -119.9MB). Peak memory consumption was 54.7MB. Max. memory is 8.0GB. [2023-12-24 21:39:13,220 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.13ms. Allocated memory is still 225.4MB. Free memory is still 175.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 306.27ms. Allocated memory is still 225.4MB. Free memory was 163.5MB in the beginning and 144.3MB in the end (delta: 19.2MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.98ms. Allocated memory is still 225.4MB. Free memory was 144.3MB in the beginning and 142.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.42ms. Allocated memory is still 225.4MB. Free memory was 142.0MB in the beginning and 138.6MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 397.61ms. Allocated memory was 225.4MB in the beginning and 319.8MB in the end (delta: 94.4MB). Free memory was 138.6MB in the beginning and 268.1MB in the end (delta: -129.5MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. * TraceAbstraction took 27388.21ms. Allocated memory was 319.8MB in the beginning and 494.9MB in the end (delta: 175.1MB). Free memory was 267.5MB in the beginning and 387.5MB in the end (delta: -119.9MB). Peak memory consumption was 54.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head!base][~head!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~head!base][~head!offset]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][~#s~0!offset]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][~#s~0!offset] 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: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][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$#2.base[~head!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32]][#memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!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[~#s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32]][#memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][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[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32]][#memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!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[~#s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32]][#memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~head!base][0bv32]][#memory_$Pointer$#2.offset[~head!base][0bv32]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~head!base][0bv32]][#memory_$Pointer$#2.offset[~head!base][0bv32]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][~#s~0!offset] 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: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~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[~#s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32]][#memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32]][#memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][0bv32]][0bv32]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#2.base[~#s~0!base][~#s~0!offset]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#2.base[~#s~0!base][~#s~0!offset]][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head!base][~head!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head!base][~head!offset] 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.base[~snd_to_last~0!base][~snd_to_last~0!offset] 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$#1.offset[#memory_$Pointer$#2.base[~head!base][~head!offset]][#memory_$Pointer$#2.offset[~head!base][~head!offset]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~#s~0!base][~#s~0!offset] 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: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~#s~0!base][~#s~0!offset] 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: 624]: 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, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.3s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 221 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 217 mSDsluCounter, 945 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 742 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 817 IncrementalHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 203 mSDtfsCounter, 817 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 580 GetRequests, 482 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 14.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=9, InterpolantAutomatonStates: 70, 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, 10 MinimizatonAttempts, 28 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 22 NumberOfFragments, 619 HoareAnnotationTreeSize, 9 FormulaSimplifications, 200 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FormulaSimplificationsInter, 84 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 20.7s InterpolantComputationTime, 352 NumberOfCodeBlocks, 329 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 493 ConstructedInterpolants, 0 QuantifiedInterpolants, 2970 SizeOfPredicates, 79 NumberOfNonLiveVariables, 1990 ConjunctsInSsa, 181 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 288/317 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: 597]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 586]: Loop Invariant Derived loop invariant: (((2 == len) && (len == 1)) || ((2 == len) && (2 == len))) - InvariantResult [Line: 617]: Loop Invariant Derived loop invariant: ((((i == 0) && (2 == len)) || (2 == len)) || ((i == 1) && (2 == len))) - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-12-24 21:39:13,266 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...