/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-properties/list_search-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:48:54,783 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:48:54,862 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:48:54,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:48:54,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:48:54,893 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:48:54,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:48:54,894 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:48:54,894 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:48:54,898 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:48:54,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:48:54,898 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:48:54,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:48:54,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:48:54,900 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:48:54,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:48:54,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:48:54,901 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:48:54,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:48:54,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:48:54,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:48:54,902 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:48:54,902 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:48:54,902 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:48:54,903 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:48:54,903 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:48:54,903 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:48:54,903 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:48:54,904 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:48:54,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:48:54,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:48:54,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:48:54,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:48:54,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:48:54,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:48:54,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:48:54,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:48:54,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:48:54,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:48:54,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:48:54,907 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:48:54,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:48:54,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:48:54,908 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:48:55,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:48:55,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:48:55,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:48:55,161 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:48:55,161 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:48:55,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_search-2.i [2023-12-15 21:48:56,252 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:48:56,493 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:48:56,493 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_search-2.i [2023-12-15 21:48:56,523 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec007b737/7d4d3cf2c21a4357b7f45d63c278b7bd/FLAGcd270e64c [2023-12-15 21:48:56,541 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec007b737/7d4d3cf2c21a4357b7f45d63c278b7bd [2023-12-15 21:48:56,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:48:56,545 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:48:56,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:48:56,546 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:48:56,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:48:56,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:48:56" (1/1) ... [2023-12-15 21:48:56,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c4959e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:48:56, skipping insertion in model container [2023-12-15 21:48:56,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:48:56" (1/1) ... [2023-12-15 21:48:56,605 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:48:56,747 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-properties/list_search-2.i[813,826] [2023-12-15 21:48:56,935 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:48:56,949 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:48:56,959 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-properties/list_search-2.i[813,826] [2023-12-15 21:48:56,996 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:48:57,041 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:48:57,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:48:57 WrapperNode [2023-12-15 21:48:57,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:48:57,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:48:57,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:48:57,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:48:57,048 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:48:57" (1/1) ... [2023-12-15 21:48:57,062 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:48:57" (1/1) ... [2023-12-15 21:48:57,084 INFO L138 Inliner]: procedures = 226, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 100 [2023-12-15 21:48:57,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:48:57,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:48:57,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:48:57,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:48:57,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:48:57" (1/1) ... [2023-12-15 21:48:57,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:48:57" (1/1) ... [2023-12-15 21:48:57,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:48:57" (1/1) ... [2023-12-15 21:48:57,112 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2023-12-15 21:48:57,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:48:57" (1/1) ... [2023-12-15 21:48:57,113 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:48:57" (1/1) ... [2023-12-15 21:48:57,119 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:48:57" (1/1) ... [2023-12-15 21:48:57,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:48:57" (1/1) ... [2023-12-15 21:48:57,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:48:57" (1/1) ... [2023-12-15 21:48:57,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:48:57" (1/1) ... [2023-12-15 21:48:57,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:48:57,128 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:48:57,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:48:57,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:48:57,129 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:48:57" (1/1) ... [2023-12-15 21:48:57,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:48:57,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:48:57,165 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:48:57,167 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:48:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-15 21:48:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-15 21:48:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-15 21:48:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:48:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:48:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:48:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:48:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-15 21:48:57,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:48:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-15 21:48:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-15 21:48:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2023-12-15 21:48:57,189 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2023-12-15 21:48:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:48:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:48:57,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:48:57,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:48:57,295 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:48:57,297 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:48:57,451 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:48:57,495 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:48:57,496 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-15 21:48:57,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:48:57 BoogieIcfgContainer [2023-12-15 21:48:57,496 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:48:57,498 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:48:57,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:48:57,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:48:57,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:48:56" (1/3) ... [2023-12-15 21:48:57,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb7fd90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:48:57, skipping insertion in model container [2023-12-15 21:48:57,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:48:57" (2/3) ... [2023-12-15 21:48:57,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb7fd90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:48:57, skipping insertion in model container [2023-12-15 21:48:57,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:48:57" (3/3) ... [2023-12-15 21:48:57,505 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search-2.i [2023-12-15 21:48:57,518 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:48:57,519 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:48:57,558 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:48:57,563 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;@1ef55a0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:48:57,564 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:48:57,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-15 21:48:57,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-15 21:48:57,574 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:48:57,575 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:48:57,575 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:48:57,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:48:57,580 INFO L85 PathProgramCache]: Analyzing trace with hash -591880684, now seen corresponding path program 1 times [2023-12-15 21:48:57,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:48:57,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081035003] [2023-12-15 21:48:57,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:48:57,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:48:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:58,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:48:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:58,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:48:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:58,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:48:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:58,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-15 21:48:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:58,315 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-15 21:48:58,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:48:58,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081035003] [2023-12-15 21:48:58,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081035003] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:48:58,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172056138] [2023-12-15 21:48:58,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:48:58,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:48:58,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:48:58,326 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:48:58,333 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:48:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:58,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-15 21:48:58,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:48:58,537 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-15 21:48:58,537 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:48:58,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172056138] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:48:58,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:48:58,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2023-12-15 21:48:58,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428483826] [2023-12-15 21:48:58,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:48:58,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:48:58,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:48:58,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:48:58,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:48:58,579 INFO L87 Difference]: Start difference. First operand has 30 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-15 21:48:58,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:48:58,606 INFO L93 Difference]: Finished difference Result 46 states and 68 transitions. [2023-12-15 21:48:58,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:48:58,609 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2023-12-15 21:48:58,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:48:58,615 INFO L225 Difference]: With dead ends: 46 [2023-12-15 21:48:58,615 INFO L226 Difference]: Without dead ends: 22 [2023-12-15 21:48:58,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:48:58,622 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:48:58,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:48:58,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-15 21:48:58,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-15 21:48:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-15 21:48:58,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-12-15 21:48:58,657 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 31 [2023-12-15 21:48:58,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:48:58,659 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-12-15 21:48:58,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-15 21:48:58,660 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2023-12-15 21:48:58,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-15 21:48:58,661 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:48:58,661 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:48:58,669 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:48:58,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-15 21:48:58,868 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:48:58,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:48:58,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1989752827, now seen corresponding path program 1 times [2023-12-15 21:48:58,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:48:58,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300377106] [2023-12-15 21:48:58,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:48:58,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:48:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:59,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:48:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:59,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:48:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:59,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:48:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:59,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-15 21:48:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-15 21:48:59,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:48:59,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300377106] [2023-12-15 21:48:59,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300377106] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:48:59,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333029868] [2023-12-15 21:48:59,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:48:59,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:48:59,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:48:59,159 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:48:59,187 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:48:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:59,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-15 21:48:59,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:48:59,366 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 21:48:59,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:48:59,441 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-15 21:48:59,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333029868] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:48:59,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:48:59,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2023-12-15 21:48:59,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340035375] [2023-12-15 21:48:59,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:48:59,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:48:59,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:48:59,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:48:59,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:48:59,446 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-15 21:48:59,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:48:59,580 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2023-12-15 21:48:59,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:48:59,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 33 [2023-12-15 21:48:59,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:48:59,586 INFO L225 Difference]: With dead ends: 45 [2023-12-15 21:48:59,586 INFO L226 Difference]: Without dead ends: 27 [2023-12-15 21:48:59,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:48:59,594 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 39 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:48:59,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 69 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:48:59,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-15 21:48:59,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2023-12-15 21:48:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-15 21:48:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-12-15 21:48:59,607 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 33 [2023-12-15 21:48:59,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:48:59,607 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-12-15 21:48:59,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-15 21:48:59,610 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2023-12-15 21:48:59,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-15 21:48:59,610 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:48:59,611 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:48:59,620 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:48:59,818 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,SelfDestructingSolverStorable1 [2023-12-15 21:48:59,818 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:48:59,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:48:59,819 INFO L85 PathProgramCache]: Analyzing trace with hash 119760053, now seen corresponding path program 1 times [2023-12-15 21:48:59,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:48:59,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993622198] [2023-12-15 21:48:59,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:48:59,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:48:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:59,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:48:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:59,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:48:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:59,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:48:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:59,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-15 21:48:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:48:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-15 21:48:59,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:48:59,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993622198] [2023-12-15 21:48:59,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993622198] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:48:59,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:48:59,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:48:59,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340091745] [2023-12-15 21:48:59,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:48:59,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:48:59,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:48:59,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:48:59,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:48:59,979 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-15 21:49:00,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:49:00,074 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2023-12-15 21:49:00,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:49:00,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2023-12-15 21:49:00,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:49:00,075 INFO L225 Difference]: With dead ends: 36 [2023-12-15 21:49:00,075 INFO L226 Difference]: Without dead ends: 28 [2023-12-15 21:49:00,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:49:00,078 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 23 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:49:00,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 66 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:49:00,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-15 21:49:00,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2023-12-15 21:49:00,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-15 21:49:00,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-12-15 21:49:00,087 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 33 [2023-12-15 21:49:00,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:49:00,088 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-12-15 21:49:00,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-15 21:49:00,089 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-12-15 21:49:00,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-15 21:49:00,092 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:49:00,092 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:49:00,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:49:00,094 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:49:00,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:49:00,095 INFO L85 PathProgramCache]: Analyzing trace with hash -2005311893, now seen corresponding path program 1 times [2023-12-15 21:49:00,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:49:00,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062068094] [2023-12-15 21:49:00,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:00,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:49:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:00,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:49:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:00,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:49:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:00,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:49:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:00,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-15 21:49:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-15 21:49:00,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:49:00,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062068094] [2023-12-15 21:49:00,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062068094] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:49:00,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:49:00,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:49:00,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424552091] [2023-12-15 21:49:00,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:49:00,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:49:00,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:49:00,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:49:00,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:49:00,402 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-15 21:49:00,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:49:00,451 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2023-12-15 21:49:00,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:49:00,451 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2023-12-15 21:49:00,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:49:00,452 INFO L225 Difference]: With dead ends: 32 [2023-12-15 21:49:00,452 INFO L226 Difference]: Without dead ends: 28 [2023-12-15 21:49:00,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:49:00,455 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:49:00,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 87 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:49:00,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-15 21:49:00,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-15 21:49:00,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-15 21:49:00,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-12-15 21:49:00,471 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 34 [2023-12-15 21:49:00,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:49:00,472 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-12-15 21:49:00,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-15 21:49:00,472 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-12-15 21:49:00,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-15 21:49:00,473 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:49:00,473 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:49:00,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:49:00,474 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:49:00,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:49:00,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2003464851, now seen corresponding path program 1 times [2023-12-15 21:49:00,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:49:00,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386485327] [2023-12-15 21:49:00,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:00,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:49:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:00,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:49:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:00,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:49:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:00,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:49:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:00,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-15 21:49:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:00,693 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-15 21:49:00,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:49:00,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386485327] [2023-12-15 21:49:00,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386485327] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:49:00,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693647350] [2023-12-15 21:49:00,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:00,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:49:00,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:49:00,695 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:49:00,698 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:49:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:00,851 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-15 21:49:00,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:49:00,882 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-15 21:49:00,882 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:49:00,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693647350] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:49:00,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:49:00,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 10 [2023-12-15 21:49:00,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477228884] [2023-12-15 21:49:00,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:49:00,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:49:00,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:49:00,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:49:00,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:49:00,884 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-15 21:49:00,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:49:00,956 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2023-12-15 21:49:00,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:49:00,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2023-12-15 21:49:00,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:49:00,959 INFO L225 Difference]: With dead ends: 40 [2023-12-15 21:49:00,959 INFO L226 Difference]: Without dead ends: 32 [2023-12-15 21:49:00,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-15 21:49:00,960 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 24 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:49:00,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 74 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:49:00,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-15 21:49:00,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-12-15 21:49:00,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-15 21:49:00,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-12-15 21:49:00,968 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 34 [2023-12-15 21:49:00,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:49:00,968 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-12-15 21:49:00,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-15 21:49:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-12-15 21:49:00,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-15 21:49:00,970 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:49:00,970 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:49:00,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 21:49:01,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:49:01,177 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:49:01,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:49:01,177 INFO L85 PathProgramCache]: Analyzing trace with hash -2075934852, now seen corresponding path program 1 times [2023-12-15 21:49:01,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:49:01,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368507851] [2023-12-15 21:49:01,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:01,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:49:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:01,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:49:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:01,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:49:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:01,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:49:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:01,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-15 21:49:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:01,724 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 21:49:01,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:49:01,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368507851] [2023-12-15 21:49:01,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368507851] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:49:01,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384657453] [2023-12-15 21:49:01,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:01,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:49:01,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:49:01,726 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:49:01,736 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:49:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:01,906 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-15 21:49:01,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:49:01,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:49:02,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-15 21:49:02,059 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-15 21:49:02,059 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:49:02,201 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-15 21:49:02,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384657453] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:49:02,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:49:02,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 22 [2023-12-15 21:49:02,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460790261] [2023-12-15 21:49:02,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:49:02,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-15 21:49:02,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:49:02,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-15 21:49:02,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2023-12-15 21:49:02,204 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 22 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 3 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-15 21:49:02,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:49:02,694 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2023-12-15 21:49:02,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-15 21:49:02,696 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 3 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37 [2023-12-15 21:49:02,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:49:02,697 INFO L225 Difference]: With dead ends: 47 [2023-12-15 21:49:02,697 INFO L226 Difference]: Without dead ends: 36 [2023-12-15 21:49:02,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2023-12-15 21:49:02,700 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 86 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:49:02,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 144 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:49:02,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-15 21:49:02,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2023-12-15 21:49:02,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-15 21:49:02,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-12-15 21:49:02,705 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 37 [2023-12-15 21:49:02,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:49:02,705 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-12-15 21:49:02,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 3 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-15 21:49:02,706 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-12-15 21:49:02,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-15 21:49:02,706 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:49:02,706 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:49:02,714 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:49:02,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:49:02,914 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:49:02,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:49:02,914 INFO L85 PathProgramCache]: Analyzing trace with hash 301592114, now seen corresponding path program 2 times [2023-12-15 21:49:02,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:49:02,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495175370] [2023-12-15 21:49:02,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:02,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:49:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:03,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:49:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:03,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:49:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:03,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:49:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:03,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-15 21:49:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:03,435 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 21:49:03,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:49:03,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495175370] [2023-12-15 21:49:03,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495175370] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:49:03,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881880912] [2023-12-15 21:49:03,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 21:49:03,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:49:03,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:49:03,441 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:49:03,456 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:49:03,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-15 21:49:03,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:49:03,622 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-15 21:49:03,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:49:03,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:49:03,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-15 21:49:03,767 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-15 21:49:03,768 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:49:03,949 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-15 21:49:03,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881880912] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:49:03,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:49:03,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 23 [2023-12-15 21:49:03,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884149837] [2023-12-15 21:49:03,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:49:03,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-15 21:49:03,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:49:03,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-15 21:49:03,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2023-12-15 21:49:03,952 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 23 states, 20 states have (on average 2.25) internal successors, (45), 21 states have internal predecessors, (45), 3 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-15 21:49:04,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:49:04,471 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2023-12-15 21:49:04,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-15 21:49:04,472 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.25) internal successors, (45), 21 states have internal predecessors, (45), 3 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 38 [2023-12-15 21:49:04,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:49:04,473 INFO L225 Difference]: With dead ends: 48 [2023-12-15 21:49:04,473 INFO L226 Difference]: Without dead ends: 40 [2023-12-15 21:49:04,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=291, Invalid=1269, Unknown=0, NotChecked=0, Total=1560 [2023-12-15 21:49:04,474 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 83 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:49:04,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 146 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:49:04,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-15 21:49:04,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2023-12-15 21:49:04,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-15 21:49:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2023-12-15 21:49:04,479 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 38 [2023-12-15 21:49:04,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:49:04,479 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2023-12-15 21:49:04,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.25) internal successors, (45), 21 states have internal predecessors, (45), 3 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-15 21:49:04,480 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2023-12-15 21:49:04,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-15 21:49:04,480 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:49:04,480 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:49:04,494 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:49:04,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:49:04,690 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:49:04,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:49:04,690 INFO L85 PathProgramCache]: Analyzing trace with hash -61018985, now seen corresponding path program 3 times [2023-12-15 21:49:04,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:49:04,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781302390] [2023-12-15 21:49:04,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:04,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:49:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:05,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:49:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:05,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:49:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:05,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:49:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:05,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-15 21:49:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:05,630 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-15 21:49:05,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:49:05,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781302390] [2023-12-15 21:49:05,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781302390] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:49:05,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949680290] [2023-12-15 21:49:05,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-15 21:49:05,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:49:05,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:49:05,632 INFO L229 MonitoredProcess]: Starting monitored process 7 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:49:05,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-15 21:49:05,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-15 21:49:05,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:49:05,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-15 21:49:05,820 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:49:05,824 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:49:05,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-15 21:49:05,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-15 21:49:06,002 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 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-15 21:49:06,009 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 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-15 21:49:06,119 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-15 21:49:06,119 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 1 case distinctions, treesize of input 34 treesize of output 37 [2023-12-15 21:49:06,134 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-15 21:49:06,135 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 1 case distinctions, treesize of input 28 treesize of output 31 [2023-12-15 21:49:06,178 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-15 21:49:06,178 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 15 treesize of output 15 [2023-12-15 21:49:06,383 INFO L349 Elim1Store]: treesize reduction 8, result has 86.9 percent of original size [2023-12-15 21:49:06,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 103 [2023-12-15 21:49:06,429 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2023-12-15 21:49:06,430 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 98 [2023-12-15 21:49:06,644 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-15 21:49:06,644 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:49:06,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:06,842 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 1 case distinctions, treesize of input 16 treesize of output 20 [2023-12-15 21:49:06,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:06,850 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 1 case distinctions, treesize of input 16 treesize of output 20 [2023-12-15 21:49:06,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949680290] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:49:06,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:49:06,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 28 [2023-12-15 21:49:06,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693387024] [2023-12-15 21:49:06,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 21:49:06,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-15 21:49:06,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:49:06,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-15 21:49:06,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2023-12-15 21:49:06,924 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 28 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-15 21:49:08,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:49:08,021 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2023-12-15 21:49:08,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-15 21:49:08,021 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 41 [2023-12-15 21:49:08,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:49:08,022 INFO L225 Difference]: With dead ends: 63 [2023-12-15 21:49:08,022 INFO L226 Difference]: Without dead ends: 49 [2023-12-15 21:49:08,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=363, Invalid=2393, Unknown=0, NotChecked=0, Total=2756 [2023-12-15 21:49:08,024 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 148 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:49:08,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 173 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 21:49:08,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-15 21:49:08,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 38. [2023-12-15 21:49:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-15 21:49:08,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2023-12-15 21:49:08,031 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 41 [2023-12-15 21:49:08,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:49:08,031 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2023-12-15 21:49:08,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-15 21:49:08,032 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2023-12-15 21:49:08,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-15 21:49:08,032 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:49:08,032 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:49:08,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-15 21:49:08,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:49:08,241 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:49:08,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:49:08,242 INFO L85 PathProgramCache]: Analyzing trace with hash -602992484, now seen corresponding path program 4 times [2023-12-15 21:49:08,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:49:08,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981080017] [2023-12-15 21:49:08,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:08,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:49:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:09,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:49:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:09,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:49:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:09,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:49:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:09,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-15 21:49:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:10,112 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 13 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 21:49:10,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:49:10,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981080017] [2023-12-15 21:49:10,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981080017] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:49:10,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706845576] [2023-12-15 21:49:10,113 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-15 21:49:10,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:49:10,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:49:10,117 INFO L229 MonitoredProcess]: Starting monitored process 8 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:49:10,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-15 21:49:10,308 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-15 21:49:10,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:49:10,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 98 conjunts are in the unsatisfiable core [2023-12-15 21:49:10,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:49:10,383 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:49:10,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:49:10,570 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 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-15 21:49:10,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:49:10,684 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-12-15 21:49:10,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-12-15 21:49:10,698 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 21 treesize of output 16 [2023-12-15 21:49:10,834 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 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-15 21:49:10,844 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 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-15 21:49:10,976 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-15 21:49:10,976 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 1 case distinctions, treesize of input 20 treesize of output 23 [2023-12-15 21:49:10,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:49:10,996 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-15 21:49:10,996 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 43 [2023-12-15 21:49:11,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:49:11,007 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-12-15 21:49:11,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2023-12-15 21:49:11,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:49:11,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-12-15 21:49:11,488 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-15 21:49:11,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 30 [2023-12-15 21:49:11,493 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-15 21:49:11,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:49:11,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:11,849 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 1 case distinctions, treesize of input 40 treesize of output 41 [2023-12-15 21:49:11,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:11,855 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 1 case distinctions, treesize of input 34 treesize of output 38 [2023-12-15 21:49:11,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706845576] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:49:11,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:49:11,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 44 [2023-12-15 21:49:11,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267540288] [2023-12-15 21:49:11,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 21:49:11,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-15 21:49:11,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:49:11,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-15 21:49:11,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2272, Unknown=0, NotChecked=0, Total=2450 [2023-12-15 21:49:11,926 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 44 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 40 states have internal predecessors, (64), 6 states have call successors, (8), 5 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-15 21:49:14,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:49:14,302 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2023-12-15 21:49:14,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-12-15 21:49:14,302 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 40 states have internal predecessors, (64), 6 states have call successors, (8), 5 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 45 [2023-12-15 21:49:14,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:49:14,303 INFO L225 Difference]: With dead ends: 67 [2023-12-15 21:49:14,303 INFO L226 Difference]: Without dead ends: 59 [2023-12-15 21:49:14,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1756 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=800, Invalid=6006, Unknown=0, NotChecked=0, Total=6806 [2023-12-15 21:49:14,306 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 213 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 21:49:14,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 206 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 21:49:14,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-15 21:49:14,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2023-12-15 21:49:14,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-12-15 21:49:14,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2023-12-15 21:49:14,318 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 45 [2023-12-15 21:49:14,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:49:14,318 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2023-12-15 21:49:14,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 40 states have internal predecessors, (64), 6 states have call successors, (8), 5 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-15 21:49:14,319 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2023-12-15 21:49:14,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-15 21:49:14,319 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:49:14,319 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:49:14,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-15 21:49:14,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:49:14,531 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:49:14,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:49:14,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1915962899, now seen corresponding path program 5 times [2023-12-15 21:49:14,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:49:14,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073780269] [2023-12-15 21:49:14,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:14,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:49:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:16,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:49:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:16,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:49:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:16,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:49:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:16,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-15 21:49:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:17,149 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 39 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 21:49:17,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:49:17,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073780269] [2023-12-15 21:49:17,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073780269] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:49:17,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506214675] [2023-12-15 21:49:17,150 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-15 21:49:17,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:49:17,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:49:17,151 INFO L229 MonitoredProcess]: Starting monitored process 9 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:49:17,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-15 21:49:17,382 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-12-15 21:49:17,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:49:17,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-15 21:49:17,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:49:17,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-15 21:49:17,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-15 21:49:17,943 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 23 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-15 21:49:17,943 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:49:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-15 21:49:18,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506214675] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:49:18,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:49:18,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 14, 12] total 46 [2023-12-15 21:49:18,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88546606] [2023-12-15 21:49:18,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:49:18,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-12-15 21:49:18,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:49:18,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-12-15 21:49:18,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1931, Unknown=0, NotChecked=0, Total=2070 [2023-12-15 21:49:18,436 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 46 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 45 states have internal predecessors, (83), 4 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-15 21:49:20,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:49:20,669 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2023-12-15 21:49:20,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-15 21:49:20,669 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 45 states have internal predecessors, (83), 4 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 48 [2023-12-15 21:49:20,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:49:20,669 INFO L225 Difference]: With dead ends: 71 [2023-12-15 21:49:20,670 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 21:49:20,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=385, Invalid=4871, Unknown=0, NotChecked=0, Total=5256 [2023-12-15 21:49:20,672 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 76 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-15 21:49:20,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 108 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-15 21:49:20,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 21:49:20,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 21:49:20,672 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:49:20,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 21:49:20,672 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2023-12-15 21:49:20,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:49:20,673 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 21:49:20,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 45 states have internal predecessors, (83), 4 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-15 21:49:20,673 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 21:49:20,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 21:49:20,675 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:49:20,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-15 21:49:20,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-15 21:49:20,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 21:49:21,707 INFO L899 garLoopResultBuilder]: For program point insert_listEXIT(lines 791 802) no Hoare annotation was computed. [2023-12-15 21:49:21,707 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 791 802) the Hoare annotation is: (or (not (= |old(~head~0.offset)| 0)) (and (= |old(#length)| |#length|) (= |old(~head~0.base)| ~head~0.base) (= ~head~0.offset 0) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|))) [2023-12-15 21:49:21,707 INFO L899 garLoopResultBuilder]: For program point L793(lines 793 799) no Hoare annotation was computed. [2023-12-15 21:49:21,707 INFO L899 garLoopResultBuilder]: For program point L793-2(lines 793 799) no Hoare annotation was computed. [2023-12-15 21:49:21,707 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2023-12-15 21:49:21,708 INFO L895 garLoopResultBuilder]: At program point L812-2(lines 812 814) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#1.base| ~head~0.base) 4))) (let ((.cse0 (select (select |#memory_$Pointer$#1.base| .cse1) 4))) (let ((.cse2 (select (select |#memory_$Pointer$#1.base| .cse0) 4))) (and (= (select (select |#memory_$Pointer$#1.offset| .cse0) 4) 0) (not (= .cse0 0)) (= (select |#valid| .cse1) 1) (= ~head~0.offset 0) (not (= .cse0 .cse1)) (= (select (select |#memory_int#1| .cse2) 0) 2) (not (= ~head~0.base .cse0)) (not (= .cse2 0)) (= (select |#valid| ~head~0.base) 1) (= (select (select |#memory_$Pointer$#1.offset| .cse1) 4) 0) (not (= .cse1 0)) (not (= ~head~0.base 0)) (= (select (select |#memory_$Pointer$#1.offset| ~head~0.base) 4) 0))))) [2023-12-15 21:49:21,708 INFO L899 garLoopResultBuilder]: For program point L812-3(lines 812 814) no Hoare annotation was computed. [2023-12-15 21:49:21,708 INFO L895 garLoopResultBuilder]: At program point L808(line 808) the Hoare annotation is: (and (= |ULTIMATE.start_main_~mylist~0#1.base| (select (select |#memory_$Pointer$#1.base| ~head~0.base) 4)) (= ~head~0.offset 0) (= (select (select |#memory_$Pointer$#1.offset| ~head~0.base) 4) |ULTIMATE.start_main_~mylist~0#1.offset|) (= (select |#valid| ~head~0.base) 1) (= (select (select |#memory_int#1| ~head~0.base) 0) 2) (not (= ~head~0.base 0))) [2023-12-15 21:49:21,708 INFO L899 garLoopResultBuilder]: For program point L808-1(line 808) no Hoare annotation was computed. [2023-12-15 21:49:21,708 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2023-12-15 21:49:21,708 INFO L899 garLoopResultBuilder]: For program point L780(lines 780 786) no Hoare annotation was computed. [2023-12-15 21:49:21,708 INFO L899 garLoopResultBuilder]: For program point L780-1(lines 780 786) no Hoare annotation was computed. [2023-12-15 21:49:21,708 INFO L895 garLoopResultBuilder]: At program point L809(line 809) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$#1.base| ~head~0.base) 4))) (and (= |ULTIMATE.start_main_~mylist~0#1.base| (select (select |#memory_$Pointer$#1.base| .cse0) 4)) (= 2 (select (select |#memory_int#1| .cse0) 0)) (= (select |#valid| .cse0) 1) (= ~head~0.offset 0) (= (select (select |#memory_$Pointer$#1.offset| .cse0) 4) |ULTIMATE.start_main_~mylist~0#1.offset|) (= (select |#valid| ~head~0.base) 1) (not (= .cse0 0)) (not (= ~head~0.base 0)) (= (select (select |#memory_$Pointer$#1.offset| ~head~0.base) 4) 0))) [2023-12-15 21:49:21,708 INFO L899 garLoopResultBuilder]: For program point L809-1(line 809) no Hoare annotation was computed. [2023-12-15 21:49:21,708 INFO L899 garLoopResultBuilder]: For program point L772-1(line 772) no Hoare annotation was computed. [2023-12-15 21:49:21,708 INFO L899 garLoopResultBuilder]: For program point L772-3(lines 772 774) no Hoare annotation was computed. [2023-12-15 21:49:21,708 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 21:49:21,709 INFO L895 garLoopResultBuilder]: At program point L772-5(lines 772 774) the Hoare annotation is: (let ((.cse26 (select (select |#memory_$Pointer$#1.base| ~head~0.base) 4))) (let ((.cse28 (select (select |#memory_$Pointer$#1.base| .cse26) 4))) (let ((.cse27 (select (select |#memory_$Pointer$#1.base| .cse28) 4)) (.cse19 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_search_list_~l#1.base|) 4))) (let ((.cse4 (select (select |#memory_$Pointer$#1.base| .cse19) 4)) (.cse15 (not (= .cse19 0))) (.cse17 (= (select (select |#memory_$Pointer$#1.offset| .cse19) 4) 0)) (.cse12 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_search_list_~l#1.base|) 4) 0)) (.cse0 (= |ULTIMATE.start_search_list_~l#1.offset| 0)) (.cse1 (= (select (select |#memory_$Pointer$#1.offset| .cse28) 4) 0)) (.cse2 (not (= .cse28 0))) (.cse3 (= (select |#valid| .cse26) 1)) (.cse5 (= ~head~0.offset 0)) (.cse6 (not (= .cse28 .cse26))) (.cse7 (= (select (select |#memory_int#1| .cse27) 0) 2)) (.cse8 (not (= ~head~0.base .cse28))) (.cse9 (not (= .cse27 0))) (.cse10 (not (= |ULTIMATE.start_search_list_~l#1.base| 0))) (.cse11 (= (select |#valid| ~head~0.base) 1)) (.cse13 (= |ULTIMATE.start_search_list_~k#1| 2)) (.cse16 (= (select (select |#memory_$Pointer$#1.offset| .cse26) 4) 0)) (.cse18 (not (= .cse26 0))) (.cse20 (not (= ~head~0.base 0))) (.cse21 (= (select (select |#memory_$Pointer$#1.offset| ~head~0.base) 4) 0))) (or (let ((.cse14 (select (select |#memory_$Pointer$#1.base| .cse4) 4))) (and .cse0 .cse1 .cse2 .cse3 (not (= .cse4 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= .cse14 0)) .cse15 (not (= |ULTIMATE.start_search_list_~l#1.base| .cse4)) (= (select (select |#memory_$Pointer$#1.offset| .cse4) 4) 0) .cse16 .cse17 .cse18 (= (select (select |#memory_int#1| .cse14) 0) 2) (not (= .cse19 .cse4)) .cse20 .cse21)) (and (= 2 (select (select |#memory_int#1| .cse4) 0)) .cse0 .cse1 .cse2 .cse3 (exists ((|v_ULTIMATE.start_search_list_~l#1.base_23| Int)) (let ((.cse23 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_23|) 4))) (let ((.cse22 (select (select |#memory_$Pointer$#1.base| .cse23) 4))) (and (= (select (select |#memory_$Pointer$#1.offset| |v_ULTIMATE.start_search_list_~l#1.base_23|) 4) 0) (not (= |v_ULTIMATE.start_search_list_~l#1.base_23| .cse22)) (= |ULTIMATE.start_search_list_~l#1.base| .cse23) (not (= .cse22 .cse23)) (= (select (select |#memory_$Pointer$#1.offset| .cse23) 4) 0) (not (= (select (select |#memory_$Pointer$#1.base| .cse22) 4) 0)))))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21) (and (= 2 (select (select |#memory_int#1| .cse19) 0)) (exists ((|v_ULTIMATE.start_search_list_~l#1.base_23| Int)) (let ((.cse25 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_search_list_~l#1.base_23|) 4))) (let ((.cse24 (select (select |#memory_$Pointer$#1.base| .cse25) 4))) (and (not (= |v_ULTIMATE.start_search_list_~l#1.base_23| .cse24)) (= |ULTIMATE.start_search_list_~l#1.base| .cse24) (not (= .cse24 .cse25)) (not (= .cse25 0)) (not (= (select (select |#memory_$Pointer$#1.base| .cse24) 4) 0)))))) .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse18 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 (select (select |#memory_int#1| |ULTIMATE.start_search_list_~l#1.base|) 0)) .cse10 .cse11 .cse13 .cse16 .cse18 .cse20 .cse21)))))) [2023-12-15 21:49:21,709 INFO L899 garLoopResultBuilder]: For program point L772-6(lines 772 774) no Hoare annotation was computed. [2023-12-15 21:49:21,709 INFO L899 garLoopResultBuilder]: For program point L781-1(lines 781 783) no Hoare annotation was computed. [2023-12-15 21:49:21,710 INFO L895 garLoopResultBuilder]: At program point L810(line 810) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#1.base| ~head~0.base) 4))) (let ((.cse0 (select (select |#memory_$Pointer$#1.base| .cse1) 4))) (and (not (= .cse0 0)) (= |ULTIMATE.start_main_~mylist~0#1.offset| (select (select |#memory_$Pointer$#1.offset| .cse0) 4)) (= (select |#valid| .cse1) 1) (= |ULTIMATE.start_main_~mylist~0#1.base| (select (select |#memory_$Pointer$#1.base| .cse0) 4)) (= ~head~0.offset 0) (= (select |#valid| .cse0) 1) (= (select (select |#memory_int#1| .cse0) 0) 2) (= (select |#valid| ~head~0.base) 1) (not (= ~head~0.base .cse1)) (= (select (select |#memory_$Pointer$#1.offset| .cse1) 4) 0) (not (= .cse1 0)) (not (= ~head~0.base 0)) (= (select (select |#memory_$Pointer$#1.offset| ~head~0.base) 4) 0)))) [2023-12-15 21:49:21,710 INFO L902 garLoopResultBuilder]: At program point L781-3(lines 781 783) the Hoare annotation is: true [2023-12-15 21:49:21,710 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 21:49:21,710 INFO L899 garLoopResultBuilder]: For program point L810-1(line 810) no Hoare annotation was computed. [2023-12-15 21:49:21,710 INFO L902 garLoopResultBuilder]: At program point L819-2(lines 819 821) the Hoare annotation is: true [2023-12-15 21:49:21,710 INFO L899 garLoopResultBuilder]: For program point L819-3(lines 819 821) no Hoare annotation was computed. [2023-12-15 21:49:21,710 INFO L899 garLoopResultBuilder]: For program point L14(lines 14 16) no Hoare annotation was computed. [2023-12-15 21:49:21,710 INFO L899 garLoopResultBuilder]: For program point L14-2(lines 13 18) no Hoare annotation was computed. [2023-12-15 21:49:21,710 INFO L895 garLoopResultBuilder]: At program point L807(line 807) the Hoare annotation is: (and (= |ULTIMATE.start_main_~mylist~0#1.offset| 0) (or (not (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~mylist~0#1.base|) 4) 0)) (let ((.cse2 (select (select |#memory_$Pointer$#1.base| ~head~0.base) 4)) (.cse3 (+ (select (select |#memory_$Pointer$#1.offset| ~head~0.base) 4) 4))) (let ((.cse0 (select (select |#memory_$Pointer$#1.base| .cse2) .cse3)) (.cse1 (+ 4 (select (select |#memory_$Pointer$#1.offset| .cse2) .cse3)))) (and (= (select (select |#memory_$Pointer$#1.offset| .cse0) .cse1) 0) (= (select (select |#memory_$Pointer$#1.base| .cse0) .cse1) 0)))) (not (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~mylist~0#1.base|) 4) 0))) (= ~head~0.offset 0) (= |ULTIMATE.start_main_~mylist~0#1.base| ~head~0.base)) [2023-12-15 21:49:21,710 INFO L899 garLoopResultBuilder]: For program point L807-1(line 807) no Hoare annotation was computed. [2023-12-15 21:49:21,713 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2023-12-15 21:49:21,715 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:49:21,733 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~l!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:49:21,736 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-12-15 21:49:21,736 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-12-15 21:49:21,736 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[~head~0!base][4]] could not be translated [2023-12-15 21:49:21,736 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4] could not be translated [2023-12-15 21:49:21,737 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-12-15 21:49:21,737 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-12-15 21:49:21,737 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4]][0] could not be translated [2023-12-15 21:49:21,737 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-12-15 21:49:21,737 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-12-15 21:49:21,737 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:49:21,737 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-15 21:49:21,738 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~l!base][4] could not be translated [2023-12-15 21:49:21,738 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4]][4] could not be translated [2023-12-15 21:49:21,738 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~l!base][4] could not be translated [2023-12-15 21:49:21,738 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:49:21,738 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4] could not be translated [2023-12-15 21:49:21,738 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4]][4] could not be translated [2023-12-15 21:49:21,738 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-12-15 21:49:21,738 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~l!base][4]][4] could not be translated [2023-12-15 21:49:21,739 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-12-15 21:49:21,739 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4]][4]][0] could not be translated [2023-12-15 21:49:21,739 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~l!base][4] could not be translated [2023-12-15 21:49:21,739 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4] could not be translated [2023-12-15 21:49:21,739 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated [2023-12-15 21:49:21,739 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4]][0] could not be translated [2023-12-15 21:49:21,739 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~l!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:49:21,739 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-12-15 21:49:21,739 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-12-15 21:49:21,740 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[~head~0!base][4]] could not be translated [2023-12-15 21:49:21,740 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_search_list_~l#1.base_23 : int :: ((((#memory_$Pointer$#1.offset[v_ULTIMATE.start_search_list_~l#1.base_23][4] == 0 && !(v_ULTIMATE.start_search_list_~l#1.base_23 == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_23][4]][4])) && ~l!base == #memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_23][4]) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_23][4]][4] == #memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_23][4])) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_23][4]][4] == 0) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_23][4]][4]][4] == 0)) could not be translated [2023-12-15 21:49:21,740 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-12-15 21:49:21,740 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-12-15 21:49:21,740 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4]][0] could not be translated [2023-12-15 21:49:21,740 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-12-15 21:49:21,740 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-12-15 21:49:21,741 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:49:21,741 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-15 21:49:21,741 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~l!base][4] could not be translated [2023-12-15 21:49:21,741 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-12-15 21:49:21,741 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~l!base][4]][4] could not be translated [2023-12-15 21:49:21,741 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-12-15 21:49:21,741 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated [2023-12-15 21:49:21,741 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~l!base][4]][0] could not be translated [2023-12-15 21:49:21,741 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_search_list_~l#1.base_23 : int :: (((!(v_ULTIMATE.start_search_list_~l#1.base_23 == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_23][4]][4]) && ~l!base == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_23][4]][4]) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_23][4]][4] == #memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_23][4])) && !(#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_23][4] == 0)) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_23][4]][4]][4] == 0)) could not be translated [2023-12-15 21:49:21,742 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~l!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:49:21,742 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-12-15 21:49:21,742 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-12-15 21:49:21,742 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[~head~0!base][4]] could not be translated [2023-12-15 21:49:21,742 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-12-15 21:49:21,742 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-12-15 21:49:21,742 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4]][0] could not be translated [2023-12-15 21:49:21,742 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-12-15 21:49:21,742 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-12-15 21:49:21,743 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:49:21,743 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-15 21:49:21,743 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~l!base][4] could not be translated [2023-12-15 21:49:21,743 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-12-15 21:49:21,743 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-12-15 21:49:21,743 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated [2023-12-15 21:49:21,743 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~l!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:49:21,743 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-12-15 21:49:21,743 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-12-15 21:49:21,744 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[~head~0!base][4]] could not be translated [2023-12-15 21:49:21,744 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-12-15 21:49:21,744 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-12-15 21:49:21,744 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4]][0] could not be translated [2023-12-15 21:49:21,744 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-12-15 21:49:21,744 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-12-15 21:49:21,744 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~l!base][0] could not be translated [2023-12-15 21:49:21,744 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:49:21,744 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-15 21:49:21,745 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-12-15 21:49:21,745 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-12-15 21:49:21,745 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated [2023-12-15 21:49:21,746 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-12-15 21:49:21,746 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-12-15 21:49:21,746 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[~head~0!base][4]] could not be translated [2023-12-15 21:49:21,746 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-12-15 21:49:21,747 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-12-15 21:49:21,747 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4]][0] could not be translated [2023-12-15 21:49:21,747 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-12-15 21:49:21,747 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated [2023-12-15 21:49:21,747 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-15 21:49:21,747 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated [2023-12-15 21:49:21,747 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated [2023-12-15 21:49:21,747 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated [2023-12-15 21:49:21,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:49:21 BoogieIcfgContainer [2023-12-15 21:49:21,748 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:49:21,748 INFO L158 Benchmark]: Toolchain (without parser) took 25203.14ms. Allocated memory was 187.7MB in the beginning and 520.1MB in the end (delta: 332.4MB). Free memory was 132.9MB in the beginning and 283.1MB in the end (delta: -150.1MB). Peak memory consumption was 183.3MB. Max. memory is 8.0GB. [2023-12-15 21:49:21,757 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 187.7MB. Free memory was 139.6MB in the beginning and 139.5MB in the end (delta: 136.6kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:49:21,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.89ms. Allocated memory is still 187.7MB. Free memory was 132.4MB in the beginning and 107.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-12-15 21:49:21,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.90ms. Allocated memory is still 187.7MB. Free memory was 107.3MB in the beginning and 104.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:49:21,758 INFO L158 Benchmark]: Boogie Preprocessor took 42.69ms. Allocated memory is still 187.7MB. Free memory was 104.6MB in the beginning and 102.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 21:49:21,758 INFO L158 Benchmark]: RCFGBuilder took 367.89ms. Allocated memory is still 187.7MB. Free memory was 102.0MB in the beginning and 84.7MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-15 21:49:21,759 INFO L158 Benchmark]: TraceAbstraction took 24249.27ms. Allocated memory was 187.7MB in the beginning and 520.1MB in the end (delta: 332.4MB). Free memory was 84.2MB in the beginning and 283.1MB in the end (delta: -198.9MB). Peak memory consumption was 134.0MB. Max. memory is 8.0GB. [2023-12-15 21:49:21,760 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.12ms. Allocated memory is still 187.7MB. Free memory was 139.6MB in the beginning and 139.5MB in the end (delta: 136.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 495.89ms. Allocated memory is still 187.7MB. Free memory was 132.4MB in the beginning and 107.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.90ms. Allocated memory is still 187.7MB. Free memory was 107.3MB in the beginning and 104.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.69ms. Allocated memory is still 187.7MB. Free memory was 104.6MB in the beginning and 102.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 367.89ms. Allocated memory is still 187.7MB. Free memory was 102.0MB in the beginning and 84.7MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 24249.27ms. Allocated memory was 187.7MB in the beginning and 520.1MB in the end (delta: 332.4MB). Free memory was 84.2MB in the beginning and 283.1MB in the end (delta: -198.9MB). Peak memory consumption was 134.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~l!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[~head~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~l!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~l!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~l!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~l!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~l!base][4]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~l!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[~head~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_search_list_~l#1.base_23 : int :: ((((#memory_$Pointer$#1.offset[v_ULTIMATE.start_search_list_~l#1.base_23][4] == 0 && !(v_ULTIMATE.start_search_list_~l#1.base_23 == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_23][4]][4])) && ~l!base == #memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_23][4]) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_23][4]][4] == #memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_23][4])) && #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_23][4]][4] == 0) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_23][4]][4]][4] == 0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~l!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~l!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~l!base][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_search_list_~l#1.base_23 : int :: (((!(v_ULTIMATE.start_search_list_~l#1.base_23 == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_23][4]][4]) && ~l!base == #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_23][4]][4]) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_23][4]][4] == #memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_23][4])) && !(#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_23][4] == 0)) && !(#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[v_ULTIMATE.start_search_list_~l#1.base_23][4]][4]][4] == 0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~l!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[~head~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~l!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~l!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[~head~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~l!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~l!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[#memory_$Pointer$#1.base[~head~0!base][4]] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~head~0!base][4]][4]][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$#1.offset[#memory_$Pointer$#1.base[~head~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~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: 15]: 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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.2s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 698 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 698 mSDsluCounter, 1107 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 929 mSDsCounter, 218 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3059 IncrementalHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 218 mSolverCounterUnsat, 178 mSDtfsCounter, 3059 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 814 GetRequests, 496 SyntacticMatches, 0 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3524 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=9, InterpolantAutomatonStates: 165, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 32 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 16 PreInvPairs, 31 NumberOfFragments, 1403 HoareAnnotationTreeSize, 16 FormulaSimplifications, 6141 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FormulaSimplificationsInter, 4046 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 681 NumberOfCodeBlocks, 670 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 815 ConstructedInterpolants, 13 QuantifiedInterpolants, 9281 SizeOfPredicates, 62 NumberOfNonLiveVariables, 2899 ConjunctsInSsa, 269 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 514/741 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: 772]: Loop Invariant Derived loop invariant: ((((k == 2) || (k == 2)) || (k == 2)) || (k == 2)) - InvariantResult [Line: 819]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 812]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 781]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-12-15 21:49:21,782 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...