/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_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-simple/dll2n_remove_all.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:54:31,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:54:31,573 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 21:54:31,577 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:54:31,578 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:54:31,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:54:31,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:54:31,602 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:54:31,603 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:54:31,606 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:54:31,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:54:31,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:54:31,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:54:31,608 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:54:31,608 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:54:31,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:54:31,608 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:54:31,608 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:54:31,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:54:31,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:54:31,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:54:31,610 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:54:31,610 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:54:31,610 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:54:31,610 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:54:31,611 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:54:31,611 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:54:31,611 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:54:31,611 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:54:31,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:54:31,612 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:54:31,612 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:54:31,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:54:31,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:54:31,613 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:54:31,613 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:54:31,613 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:54:31,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:54:31,613 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:54:31,613 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:54:31,613 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:54:31,613 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:54:31,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:54:31,614 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 21:54:31,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:54:31,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:54:31,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:54:31,825 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:54:31,827 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:54:31,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_remove_all.i [2023-12-15 21:54:32,924 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:54:33,102 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:54:33,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_remove_all.i [2023-12-15 21:54:33,112 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd7e09005/9b472c202adb43ce9b5b7de6121ff512/FLAGc6c928ab5 [2023-12-15 21:54:33,122 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd7e09005/9b472c202adb43ce9b5b7de6121ff512 [2023-12-15 21:54:33,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:54:33,125 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:54:33,126 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:54:33,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:54:33,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:54:33,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:54:33" (1/1) ... [2023-12-15 21:54:33,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d1ad17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:33, skipping insertion in model container [2023-12-15 21:54:33,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:54:33" (1/1) ... [2023-12-15 21:54:33,175 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:54:33,381 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/dll2n_remove_all.i[24090,24103] [2023-12-15 21:54:33,384 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:54:33,390 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:54:33,434 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/dll2n_remove_all.i[24090,24103] [2023-12-15 21:54:33,441 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:54:33,462 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:54:33,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:33 WrapperNode [2023-12-15 21:54:33,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:54:33,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:54:33,465 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:54:33,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:54:33,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:33" (1/1) ... [2023-12-15 21:54:33,489 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:33" (1/1) ... [2023-12-15 21:54:33,508 INFO L138 Inliner]: procedures = 126, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2023-12-15 21:54:33,509 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:54:33,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:54:33,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:54:33,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:54:33,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:33" (1/1) ... [2023-12-15 21:54:33,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:33" (1/1) ... [2023-12-15 21:54:33,524 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:33" (1/1) ... [2023-12-15 21:54:33,544 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 5, 6]. 46 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 6 writes are split as follows [0, 1, 5]. [2023-12-15 21:54:33,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:33" (1/1) ... [2023-12-15 21:54:33,544 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:33" (1/1) ... [2023-12-15 21:54:33,558 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:33" (1/1) ... [2023-12-15 21:54:33,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:33" (1/1) ... [2023-12-15 21:54:33,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:33" (1/1) ... [2023-12-15 21:54:33,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:33" (1/1) ... [2023-12-15 21:54:33,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:54:33,569 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:54:33,569 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:54:33,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:54:33,570 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:33" (1/1) ... [2023-12-15 21:54:33,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:54:33,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:33,605 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-15 21:54:33,626 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-12-15 21:54:33,627 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-12-15 21:54:33,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:54:33,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:54:33,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-15 21:54:33,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-15 21:54:33,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:54:33,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-15 21:54:33,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-15 21:54:33,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-15 21:54:33,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-15 21:54:33,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-15 21:54:33,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-15 21:54:33,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-15 21:54:33,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-15 21:54:33,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-15 21:54:33,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-15 21:54:33,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-15 21:54:33,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:54:33,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:54:33,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 21:54:33,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:54:33,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:54:33,622 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-15 21:54:33,747 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:54:33,748 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:54:33,788 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-12-15 21:54:33,905 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:54:33,923 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:54:33,923 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-15 21:54:33,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:54:33 BoogieIcfgContainer [2023-12-15 21:54:33,923 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:54:33,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:54:33,925 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:54:33,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:54:33,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:54:33" (1/3) ... [2023-12-15 21:54:33,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e18eba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:54:33, skipping insertion in model container [2023-12-15 21:54:33,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:33" (2/3) ... [2023-12-15 21:54:33,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e18eba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:54:33, skipping insertion in model container [2023-12-15 21:54:33,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:54:33" (3/3) ... [2023-12-15 21:54:33,929 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all.i [2023-12-15 21:54:33,940 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:54:33,941 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:54:33,969 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:54:33,974 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;@217a40f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:54:33,974 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:54:33,977 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:33,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-15 21:54:33,982 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:33,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:33,982 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:33,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:33,986 INFO L85 PathProgramCache]: Analyzing trace with hash -282809828, now seen corresponding path program 1 times [2023-12-15 21:54:33,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:33,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142059387] [2023-12-15 21:54:33,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:33,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:34,109 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-15 21:54:34,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:34,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142059387] [2023-12-15 21:54:34,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142059387] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:54:34,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:54:34,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:54:34,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029142195] [2023-12-15 21:54:34,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:34,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:54:34,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:34,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:54:34,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:54:34,133 INFO L87 Difference]: Start difference. First operand has 19 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-15 21:54:34,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:34,157 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2023-12-15 21:54:34,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:54:34,159 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-15 21:54:34,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:34,163 INFO L225 Difference]: With dead ends: 29 [2023-12-15 21:54:34,174 INFO L226 Difference]: Without dead ends: 14 [2023-12-15 21:54:34,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-15 21:54:34,179 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:34,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:34,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-15 21:54:34,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-12-15 21:54:34,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:34,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2023-12-15 21:54:34,215 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 7 [2023-12-15 21:54:34,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:34,215 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2023-12-15 21:54:34,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-15 21:54:34,216 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2023-12-15 21:54:34,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-15 21:54:34,216 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:34,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:34,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:54:34,217 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:34,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:34,218 INFO L85 PathProgramCache]: Analyzing trace with hash -827210562, now seen corresponding path program 1 times [2023-12-15 21:54:34,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:34,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705136347] [2023-12-15 21:54:34,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:34,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:34,296 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-15 21:54:34,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:34,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705136347] [2023-12-15 21:54:34,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705136347] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:54:34,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:54:34,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:54:34,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092660263] [2023-12-15 21:54:34,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:34,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:54:34,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:34,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:54:34,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:54:34,299 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-15 21:54:34,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:34,318 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2023-12-15 21:54:34,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:54:34,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-15 21:54:34,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:34,320 INFO L225 Difference]: With dead ends: 27 [2023-12-15 21:54:34,320 INFO L226 Difference]: Without dead ends: 19 [2023-12-15 21:54:34,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-15 21:54:34,321 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:34,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 23 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:34,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-15 21:54:34,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2023-12-15 21:54:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:34,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-12-15 21:54:34,328 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 7 [2023-12-15 21:54:34,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:34,328 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-12-15 21:54:34,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-15 21:54:34,329 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-12-15 21:54:34,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-15 21:54:34,331 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:34,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:34,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:54:34,331 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:34,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:34,333 INFO L85 PathProgramCache]: Analyzing trace with hash -741965758, now seen corresponding path program 1 times [2023-12-15 21:54:34,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:34,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022317117] [2023-12-15 21:54:34,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:34,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:34,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:54:34,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:34,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022317117] [2023-12-15 21:54:34,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022317117] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:54:34,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:54:34,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:54:34,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952891041] [2023-12-15 21:54:34,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:34,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:54:34,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:34,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:54:34,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:54:34,423 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:34,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:34,451 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2023-12-15 21:54:34,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:54:34,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-15 21:54:34,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:34,453 INFO L225 Difference]: With dead ends: 32 [2023-12-15 21:54:34,453 INFO L226 Difference]: Without dead ends: 19 [2023-12-15 21:54:34,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-15 21:54:34,456 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:34,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 22 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:34,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-15 21:54:34,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2023-12-15 21:54:34,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:34,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-12-15 21:54:34,459 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 12 [2023-12-15 21:54:34,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:34,460 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-12-15 21:54:34,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:34,460 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-12-15 21:54:34,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-15 21:54:34,460 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:34,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:34,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:54:34,461 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:34,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:34,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1551312384, now seen corresponding path program 1 times [2023-12-15 21:54:34,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:34,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712358268] [2023-12-15 21:54:34,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:34,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:34,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:54:34,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:34,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712358268] [2023-12-15 21:54:34,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712358268] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:34,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450384020] [2023-12-15 21:54:34,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:34,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:34,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:34,584 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:54:34,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 21:54:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:34,690 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-15 21:54:34,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:54:34,734 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:54:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:54:34,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450384020] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:54:34,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:54:34,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-12-15 21:54:34,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337053844] [2023-12-15 21:54:34,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:54:34,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:54:34,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:34,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:54:34,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:54:34,775 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:34,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:34,802 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2023-12-15 21:54:34,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:54:34,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-15 21:54:34,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:34,804 INFO L225 Difference]: With dead ends: 28 [2023-12-15 21:54:34,804 INFO L226 Difference]: Without dead ends: 20 [2023-12-15 21:54:34,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:54:34,805 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:34,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 41 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:34,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-15 21:54:34,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-15 21:54:34,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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-15 21:54:34,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-12-15 21:54:34,808 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2023-12-15 21:54:34,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:34,808 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-12-15 21:54:34,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:34,809 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-12-15 21:54:34,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-15 21:54:34,809 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:34,809 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:34,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-15 21:54:35,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:35,016 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:35,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:35,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1280023488, now seen corresponding path program 1 times [2023-12-15 21:54:35,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:35,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876933796] [2023-12-15 21:54:35,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:35,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:35,132 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 21:54:35,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:35,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876933796] [2023-12-15 21:54:35,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876933796] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:54:35,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:54:35,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:54:35,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853396168] [2023-12-15 21:54:35,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:35,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:54:35,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:35,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:54:35,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:54:35,137 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:35,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:35,160 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2023-12-15 21:54:35,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:54:35,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-15 21:54:35,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:35,161 INFO L225 Difference]: With dead ends: 27 [2023-12-15 21:54:35,162 INFO L226 Difference]: Without dead ends: 23 [2023-12-15 21:54:35,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:54:35,163 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:35,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 25 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:35,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-15 21:54:35,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2023-12-15 21:54:35,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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-15 21:54:35,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-12-15 21:54:35,171 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 17 [2023-12-15 21:54:35,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:35,171 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-12-15 21:54:35,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:35,172 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-12-15 21:54:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-15 21:54:35,173 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:35,173 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:35,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:54:35,175 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:35,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:35,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1016345580, now seen corresponding path program 1 times [2023-12-15 21:54:35,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:35,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283941781] [2023-12-15 21:54:35,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:35,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:35,296 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 21:54:35,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:35,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283941781] [2023-12-15 21:54:35,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283941781] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:35,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036054044] [2023-12-15 21:54:35,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:35,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:35,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:35,298 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:54:35,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 21:54:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:35,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-15 21:54:35,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:35,462 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 21:54:35,462 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:54:35,503 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 21:54:35,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036054044] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:54:35,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:54:35,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-12-15 21:54:35,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682942498] [2023-12-15 21:54:35,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:54:35,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:54:35,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:35,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:54:35,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:54:35,504 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:35,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:35,527 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2023-12-15 21:54:35,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:54:35,534 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-15 21:54:35,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:35,535 INFO L225 Difference]: With dead ends: 28 [2023-12-15 21:54:35,535 INFO L226 Difference]: Without dead ends: 24 [2023-12-15 21:54:35,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:54:35,536 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:35,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 35 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:35,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-15 21:54:35,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-15 21:54:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-12-15 21:54:35,539 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 20 [2023-12-15 21:54:35,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:35,539 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-12-15 21:54:35,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:35,539 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2023-12-15 21:54:35,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-15 21:54:35,539 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:35,539 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:35,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 21:54:35,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-15 21:54:35,745 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:35,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:35,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1282972736, now seen corresponding path program 2 times [2023-12-15 21:54:35,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:35,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729841595] [2023-12-15 21:54:35,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:35,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:37,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:54:37,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:37,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729841595] [2023-12-15 21:54:37,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729841595] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:37,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713270590] [2023-12-15 21:54:37,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 21:54:37,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:37,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:37,469 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:54:37,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-15 21:54:37,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-15 21:54:37,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:54:37,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 78 conjunts are in the unsatisfiable core [2023-12-15 21:54:37,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:37,618 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 5 [2023-12-15 21:54:37,661 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 14 treesize of output 15 [2023-12-15 21:54:37,667 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 14 treesize of output 15 [2023-12-15 21:54:37,779 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-15 21:54:37,779 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 11 treesize of output 11 [2023-12-15 21:54:37,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 21 [2023-12-15 21:54:37,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-12-15 21:54:37,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 21 [2023-12-15 21:54:37,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-12-15 21:54:37,944 INFO L349 Elim1Store]: treesize reduction 110, result has 14.7 percent of original size [2023-12-15 21:54:37,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 138 treesize of output 82 [2023-12-15 21:54:37,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 32 [2023-12-15 21:54:38,166 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:54:38,167 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:54:38,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:54:38,189 INFO L349 Elim1Store]: treesize reduction 158, result has 18.1 percent of original size [2023-12-15 21:54:38,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 69 [2023-12-15 21:54:38,205 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:54:38,205 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:54:38,211 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2023-12-15 21:54:38,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 43 [2023-12-15 21:54:38,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 109 [2023-12-15 21:54:38,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 88 [2023-12-15 21:54:38,409 INFO L349 Elim1Store]: treesize reduction 70, result has 4.1 percent of original size [2023-12-15 21:54:38,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 83 treesize of output 41 [2023-12-15 21:54:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:54:38,438 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:54:38,610 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 84 treesize of output 64 [2023-12-15 21:54:38,612 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 68 treesize of output 48 [2023-12-15 21:54:50,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:50,151 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 126 [2023-12-15 21:54:50,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:50,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 86 [2023-12-15 21:54:50,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:50,180 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 106 [2023-12-15 21:54:50,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:50,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 86 [2023-12-15 21:54:50,205 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((v_arrayElimArr_6 (Array Int Int)) (|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_ArrVal_367 Int) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_364 Int)) (let ((.cse0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_6 .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= (select v_arrayElimArr_6 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8)) 0)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_5 .cse0))) (= (let ((.cse1 (let ((.cse4 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_5))) (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 v_ArrVal_364))))) (select (select .cse1 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_6))) (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 v_ArrVal_367))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) (+ (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) 4))) 0)))) (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_ArrVal_367 Int) (v_ArrVal_364 Int) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse5 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 .cse5) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_4))) (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 v_ArrVal_367))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) (+ 4 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_3))) (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 v_ArrVal_364))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse5))) 0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_3 .cse5))) (not (= (select v_arrayElimArr_4 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8)) 0))))))) is different from false [2023-12-15 21:54:50,717 INFO L349 Elim1Store]: treesize reduction 551, result has 28.6 percent of original size [2023-12-15 21:54:50,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 623 treesize of output 622 [2023-12-15 21:54:50,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:50,740 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 662 treesize of output 577 [2023-12-15 21:54:50,775 INFO L349 Elim1Store]: treesize reduction 12, result has 76.5 percent of original size [2023-12-15 21:54:50,777 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 5 case distinctions, treesize of input 859 treesize of output 828 [2023-12-15 21:54:50,806 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 591 treesize of output 573 [2023-12-15 21:54:50,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:50,824 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 17 treesize of output 9 [2023-12-15 21:54:50,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 495 treesize of output 451 [2023-12-15 21:54:50,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:50,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 595 treesize of output 555 [2023-12-15 21:54:51,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-15 21:54:51,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-15 21:54:51,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2023-12-15 21:54:51,710 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:54:51,712 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:54:51,713 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:54:51,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:54:51,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:51,721 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2023-12-15 21:54:51,723 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:54:51,724 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 39 treesize of output 33 [2023-12-15 21:54:51,726 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:54:51,728 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:54:51,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:54:51,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2023-12-15 21:54:51,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-15 21:54:51,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-15 21:54:51,809 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-15 21:54:51,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713270590] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:54:51,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:54:51,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 38 [2023-12-15 21:54:51,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486750250] [2023-12-15 21:54:51,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:54:51,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-15 21:54:51,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:51,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-15 21:54:51,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1291, Unknown=3, NotChecked=72, Total=1482 [2023-12-15 21:54:51,812 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 39 states, 39 states have (on average 1.564102564102564) internal successors, (61), 38 states have internal predecessors, (61), 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-15 21:54:53,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:53,212 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2023-12-15 21:54:53,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-15 21:54:53,214 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.564102564102564) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-15 21:54:53,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:53,214 INFO L225 Difference]: With dead ends: 62 [2023-12-15 21:54:53,214 INFO L226 Difference]: Without dead ends: 46 [2023-12-15 21:54:53,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=266, Invalid=2597, Unknown=3, NotChecked=104, Total=2970 [2023-12-15 21:54:53,216 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 41 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:53,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 173 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 662 Invalid, 0 Unknown, 48 Unchecked, 0.7s Time] [2023-12-15 21:54:53,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-15 21:54:53,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2023-12-15 21:54:53,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 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-15 21:54:53,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2023-12-15 21:54:53,226 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 23 [2023-12-15 21:54:53,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:53,226 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2023-12-15 21:54:53,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.564102564102564) internal successors, (61), 38 states have internal predecessors, (61), 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-15 21:54:53,226 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2023-12-15 21:54:53,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-15 21:54:53,227 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:53,227 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:53,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-15 21:54:53,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:53,428 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:53,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:53,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1996978838, now seen corresponding path program 1 times [2023-12-15 21:54:53,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:53,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493761093] [2023-12-15 21:54:53,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:53,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 21:54:53,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:53,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493761093] [2023-12-15 21:54:53,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493761093] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:53,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333675979] [2023-12-15 21:54:53,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:53,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:53,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:53,571 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:54:53,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-15 21:54:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:53,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-15 21:54:53,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 21:54:53,725 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:54:53,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333675979] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:54:53,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:54:53,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-12-15 21:54:53,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610048378] [2023-12-15 21:54:53,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:53,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:54:53,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:53,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:54:53,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:54:53,727 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:53,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:53,755 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2023-12-15 21:54:53,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:54:53,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-15 21:54:53,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:53,756 INFO L225 Difference]: With dead ends: 47 [2023-12-15 21:54:53,756 INFO L226 Difference]: Without dead ends: 29 [2023-12-15 21:54:53,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:54:53,758 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:53,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 39 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:53,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-15 21:54:53,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-15 21:54:53,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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-15 21:54:53,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-12-15 21:54:53,764 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 26 [2023-12-15 21:54:53,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:53,764 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-12-15 21:54:53,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:53,765 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-12-15 21:54:53,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-15 21:54:53,765 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:53,765 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:53,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-15 21:54:53,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:53,970 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:53,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:53,970 INFO L85 PathProgramCache]: Analyzing trace with hash 436924800, now seen corresponding path program 3 times [2023-12-15 21:54:53,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:53,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391021089] [2023-12-15 21:54:53,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:53,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:54,036 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-15 21:54:54,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:54,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391021089] [2023-12-15 21:54:54,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391021089] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:54,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343565798] [2023-12-15 21:54:54,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-15 21:54:54,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:54,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:54,038 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:54:54,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-15 21:54:54,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-15 21:54:54,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:54:54,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 21:54:54,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:54,581 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-15 21:54:54,581 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:54:54,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343565798] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:54:54,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:54:54,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-12-15 21:54:54,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943555726] [2023-12-15 21:54:54,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:54,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:54:54,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:54,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:54:54,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:54:54,582 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-15 21:54:54,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:54,591 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2023-12-15 21:54:54,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:54:54,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-15 21:54:54,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:54,592 INFO L225 Difference]: With dead ends: 29 [2023-12-15 21:54:54,592 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 21:54:54,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:54:54,592 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:54,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:54,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 21:54:54,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 21:54:54,593 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-15 21:54:54,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 21:54:54,593 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2023-12-15 21:54:54,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:54,593 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 21:54:54,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-15 21:54:54,593 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 21:54:54,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 21:54:54,596 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:54:54,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-15 21:54:54,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:54,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 21:54:54,959 INFO L899 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2023-12-15 21:54:54,959 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 572 574) the Hoare annotation is: true [2023-12-15 21:54:54,959 INFO L899 garLoopResultBuilder]: For program point myexitEXIT(lines 572 574) no Hoare annotation was computed. [2023-12-15 21:54:54,959 INFO L899 garLoopResultBuilder]: For program point L605(lines 605 607) no Hoare annotation was computed. [2023-12-15 21:54:54,959 INFO L899 garLoopResultBuilder]: For program point L605-2(lines 605 607) no Hoare annotation was computed. [2023-12-15 21:54:54,960 INFO L899 garLoopResultBuilder]: For program point L589(lines 589 591) no Hoare annotation was computed. [2023-12-15 21:54:54,960 INFO L899 garLoopResultBuilder]: For program point L589-1(lines 589 591) no Hoare annotation was computed. [2023-12-15 21:54:54,960 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 611 625) no Hoare annotation was computed. [2023-12-15 21:54:54,960 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 623) no Hoare annotation was computed. [2023-12-15 21:54:54,960 INFO L902 garLoopResultBuilder]: At program point L590(line 590) the Hoare annotation is: true [2023-12-15 21:54:54,960 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 621) no Hoare annotation was computed. [2023-12-15 21:54:54,960 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 21:54:54,960 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 597) no Hoare annotation was computed. [2023-12-15 21:54:54,960 INFO L899 garLoopResultBuilder]: For program point L595-2(lines 595 597) no Hoare annotation was computed. [2023-12-15 21:54:54,960 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 21:54:54,960 INFO L895 garLoopResultBuilder]: At program point L587-2(lines 587 600) the Hoare annotation is: (let ((.cse7 (select |#memory_$Pointer$#2.base| |ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse6 (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse0 (= (select .cse6 4) 0)) (.cse1 (= (select .cse7 8) 0)) (.cse2 (select .cse7 4)) (.cse3 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse4 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))) (or (and .cse0 (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) .cse1 (= .cse2 0) .cse3 .cse4 (= |ULTIMATE.start_dll_create_~len#1| 1) .cse5 (= (select .cse6 8) 0)) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$#2.base| .cse2) 4) 0) (= (select (select |#memory_$Pointer$#2.offset| .cse2) 4) 0) .cse3 (<= |ULTIMATE.start_dll_create_~len#1| 0) .cse4 .cse5 (not (= .cse2 |ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= 2 |ULTIMATE.start_dll_create_~len#1|) .cse3 .cse4 .cse5 (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))))) [2023-12-15 21:54:54,960 INFO L899 garLoopResultBuilder]: For program point L587-3(lines 587 600) no Hoare annotation was computed. [2023-12-15 21:54:54,960 INFO L895 garLoopResultBuilder]: At program point L616-3(lines 616 618) the Hoare annotation is: (let ((.cse12 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse13 (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (= (select .cse13 |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (.cse2 (= (select .cse12 |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (.cse3 (= (select .cse13 0) 0)) (.cse7 (select .cse12 0)) (.cse6 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse0 (= |ULTIMATE.start_main_~len~0#1| 2))) (or (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0) .cse0 .cse1 .cse2) (and (= (select (select |#memory_$Pointer$#2.offset| 0) 4) 0) .cse0 .cse1 .cse2 (= (select (select |#memory_$Pointer$#2.base| 0) 4) 0)) (let ((.cse5 (select |#memory_$Pointer$#2.base| .cse7))) (let ((.cse4 (select .cse5 4))) (and .cse3 (= (select (select |#memory_$Pointer$#2.base| .cse4) 4) 0) (= (select .cse5 8) 0) (= |ULTIMATE.start_main_~i~0#1| 1) .cse6 (= (select (select |#memory_$Pointer$#2.offset| .cse4) 4) 0) .cse0 (= (select (select |#memory_$Pointer$#2.offset| .cse7) 4) 0)))) (and .cse3 (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((v_arrayElimCell_18 Int) (v_arrayElimCell_17 Int)) (let ((.cse11 (select |#memory_$Pointer$#2.base| v_arrayElimCell_17)) (.cse8 (+ 4 v_arrayElimCell_18))) (let ((.cse10 (select .cse11 .cse8))) (let ((.cse9 (select |#memory_$Pointer$#2.offset| .cse10))) (and (= (select (select |#memory_$Pointer$#2.offset| v_arrayElimCell_17) .cse8) 0) (= (select .cse9 4) 0) (not (= .cse10 v_arrayElimCell_17)) (= (select .cse11 (+ 8 v_arrayElimCell_18)) 0) (= (select .cse9 8) 0) (= .cse7 .cse10) (= 0 (select (select |#memory_$Pointer$#2.base| .cse10) 4))))))) .cse6 .cse0)))) [2023-12-15 21:54:54,961 INFO L899 garLoopResultBuilder]: For program point L616-4(lines 616 618) no Hoare annotation was computed. [2023-12-15 21:54:54,961 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 611 625) no Hoare annotation was computed. [2023-12-15 21:54:54,963 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:54,964 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:54:54,975 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset] could not be translated [2023-12-15 21:54:54,975 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset] could not be translated [2023-12-15 21:54:54,975 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[0][4] could not be translated [2023-12-15 21:54:54,975 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset] could not be translated [2023-12-15 21:54:54,975 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset] could not be translated [2023-12-15 21:54:54,975 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[0][4] could not be translated [2023-12-15 21:54:54,976 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0] could not be translated [2023-12-15 21:54:54,976 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4]][4] could not be translated [2023-12-15 21:54:54,976 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][8] could not be translated [2023-12-15 21:54:54,976 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4]][4] could not be translated [2023-12-15 21:54:54,976 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][0]][4] could not be translated [2023-12-15 21:54:54,976 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0] could not be translated [2023-12-15 21:54:54,976 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_18 : int, v_arrayElimCell_17 : int :: (((((#memory_$Pointer$#2.offset[v_arrayElimCell_17][4 + v_arrayElimCell_18] == 0 && #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[v_arrayElimCell_17][4 + v_arrayElimCell_18]][4] == 0) && !(#memory_$Pointer$#2.base[v_arrayElimCell_17][4 + v_arrayElimCell_18] == v_arrayElimCell_17)) && #memory_$Pointer$#2.base[v_arrayElimCell_17][8 + v_arrayElimCell_18] == 0) && #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[v_arrayElimCell_17][4 + v_arrayElimCell_18]][8] == 0) && #memory_$Pointer$#1.base[~#s~0!base][0] == #memory_$Pointer$#2.base[v_arrayElimCell_17][4 + v_arrayElimCell_18]) && 0 == #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_arrayElimCell_17][4 + v_arrayElimCell_18]][4]) could not be translated [2023-12-15 21:54:54,980 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head~0!base][4] could not be translated [2023-12-15 21:54:54,980 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-15 21:54:54,980 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][8] could not be translated [2023-12-15 21:54:54,980 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][4] could not be translated [2023-12-15 21:54:54,980 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head~0!base][8] could not be translated [2023-12-15 21:54:54,981 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head~0!base][4] could not be translated [2023-12-15 21:54:54,981 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][8] could not be translated [2023-12-15 21:54:54,981 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[~head~0!base][4]][4] could not be translated [2023-12-15 21:54:54,985 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[~head~0!base][4]][4] could not be translated [2023-12-15 21:54:54,986 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][4] could not be translated [2023-12-15 21:54:54,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:54:54 BoogieIcfgContainer [2023-12-15 21:54:54,987 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:54:54,987 INFO L158 Benchmark]: Toolchain (without parser) took 21862.24ms. Allocated memory was 231.7MB in the beginning and 464.5MB in the end (delta: 232.8MB). Free memory was 190.3MB in the beginning and 282.9MB in the end (delta: -92.6MB). Peak memory consumption was 142.1MB. Max. memory is 8.0GB. [2023-12-15 21:54:54,988 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 231.7MB. Free memory was 184.6MB in the beginning and 184.5MB in the end (delta: 125.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:54:54,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.92ms. Allocated memory is still 231.7MB. Free memory was 190.3MB in the beginning and 172.3MB in the end (delta: 18.0MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-15 21:54:54,989 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.51ms. Allocated memory is still 231.7MB. Free memory was 172.3MB in the beginning and 170.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:54:54,989 INFO L158 Benchmark]: Boogie Preprocessor took 59.22ms. Allocated memory is still 231.7MB. Free memory was 170.2MB in the beginning and 167.7MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 21:54:54,989 INFO L158 Benchmark]: RCFGBuilder took 354.20ms. Allocated memory is still 231.7MB. Free memory was 167.7MB in the beginning and 152.4MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-15 21:54:54,990 INFO L158 Benchmark]: TraceAbstraction took 21062.09ms. Allocated memory was 231.7MB in the beginning and 464.5MB in the end (delta: 232.8MB). Free memory was 151.7MB in the beginning and 282.9MB in the end (delta: -131.2MB). Peak memory consumption was 103.3MB. Max. memory is 8.0GB. [2023-12-15 21:54:54,991 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.44ms. Allocated memory is still 231.7MB. Free memory was 184.6MB in the beginning and 184.5MB in the end (delta: 125.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 337.92ms. Allocated memory is still 231.7MB. Free memory was 190.3MB in the beginning and 172.3MB in the end (delta: 18.0MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.51ms. Allocated memory is still 231.7MB. Free memory was 172.3MB in the beginning and 170.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.22ms. Allocated memory is still 231.7MB. Free memory was 170.2MB in the beginning and 167.7MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 354.20ms. Allocated memory is still 231.7MB. Free memory was 167.7MB in the beginning and 152.4MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 21062.09ms. Allocated memory was 231.7MB in the beginning and 464.5MB in the end (delta: 232.8MB). Free memory was 151.7MB in the beginning and 282.9MB in the end (delta: -131.2MB). Peak memory consumption was 103.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[0][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[0][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][0]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][0]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_18 : int, v_arrayElimCell_17 : int :: (((((#memory_$Pointer$#2.offset[v_arrayElimCell_17][4 + v_arrayElimCell_18] == 0 && #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[v_arrayElimCell_17][4 + v_arrayElimCell_18]][4] == 0) && !(#memory_$Pointer$#2.base[v_arrayElimCell_17][4 + v_arrayElimCell_18] == v_arrayElimCell_17)) && #memory_$Pointer$#2.base[v_arrayElimCell_17][8 + v_arrayElimCell_18] == 0) && #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[v_arrayElimCell_17][4 + v_arrayElimCell_18]][8] == 0) && #memory_$Pointer$#1.base[~#s~0!base][0] == #memory_$Pointer$#2.base[v_arrayElimCell_17][4 + v_arrayElimCell_18]) && 0 == #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[v_arrayElimCell_17][4 + v_arrayElimCell_18]][4]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head~0!base][4] 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.base[~head~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][4] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 623]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.0s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 104 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104 mSDsluCounter, 394 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 48 IncrementalHoareTripleChecker+Unchecked, 284 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 751 IncrementalHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 110 mSDtfsCounter, 751 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 134 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 13.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=7, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 12 NumberOfFragments, 346 HoareAnnotationTreeSize, 4 FormulaSimplifications, 30 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FormulaSimplificationsInter, 51 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 16.7s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 299 ConstructedInterpolants, 10 QuantifiedInterpolants, 3592 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1235 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 17 InterpolantComputations, 6 PerfectInterpolantSequences, 109/155 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: 616]: Loop Invariant Derived loop invariant: ((((((i + 1) <= 0) && (len == 2)) || (len == 2)) || ((i == 1) && (len == 2))) || ((i == 0) && (len == 2))) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: ((((len == 2) && (len == 1)) || ((len <= 0) && (len == 2))) || ((2 == len) && (len == 2))) RESULT: Ultimate proved your program to be correct! [2023-12-15 21:54:55,022 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...