/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:54:08,849 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:54:08,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 21:54:08,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:54:08,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:54:08,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:54:08,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:54:08,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:54:08,929 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:54:08,929 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:54:08,929 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:54:08,930 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:54:08,930 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:54:08,931 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:54:08,931 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:54:08,931 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:54:08,932 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:54:08,932 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:54:08,932 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:54:08,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:54:08,933 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:54:08,933 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:54:08,934 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:54:08,934 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:54:08,934 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:54:08,934 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:54:08,935 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:54:08,935 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:54:08,935 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:54:08,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:54:08,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:54:08,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:54:08,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:54:08,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:54:08,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:54:08,938 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:54:08,938 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:54:08,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:54:08,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:54:08,939 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:54:08,939 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:54:08,940 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:54:08,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:54:08,940 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 21:54:09,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:54:09,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:54:09,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:54:09,135 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:54:09,136 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:54:09,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i [2023-12-15 21:54:10,386 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:54:10,613 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:54:10,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i [2023-12-15 21:54:10,627 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ee3a7d36/4eb7e7124c954484a5f96ffd7bb70256/FLAGae9402d6e [2023-12-15 21:54:10,638 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ee3a7d36/4eb7e7124c954484a5f96ffd7bb70256 [2023-12-15 21:54:10,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:54:10,640 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:54:10,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:54:10,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:54:10,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:54:10,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:54:10" (1/1) ... [2023-12-15 21:54:10,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7451810a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:10, skipping insertion in model container [2023-12-15 21:54:10,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:54:10" (1/1) ... [2023-12-15 21:54:10,686 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:54:10,969 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i[24556,24569] [2023-12-15 21:54:10,978 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:54:10,986 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:54:11,048 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i[24556,24569] [2023-12-15 21:54:11,051 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:54:11,084 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:54:11,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:11 WrapperNode [2023-12-15 21:54:11,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:54:11,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:54:11,088 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:54:11,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:54:11,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:11" (1/1) ... [2023-12-15 21:54:11,115 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:11" (1/1) ... [2023-12-15 21:54:11,139 INFO L138 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 136 [2023-12-15 21:54:11,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:54:11,141 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:54:11,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:54:11,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:54:11,153 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:11" (1/1) ... [2023-12-15 21:54:11,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:11" (1/1) ... [2023-12-15 21:54:11,168 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:11" (1/1) ... [2023-12-15 21:54:11,189 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 8 writes are split as follows [0, 8]. [2023-12-15 21:54:11,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:11" (1/1) ... [2023-12-15 21:54:11,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:11" (1/1) ... [2023-12-15 21:54:11,196 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:11" (1/1) ... [2023-12-15 21:54:11,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:11" (1/1) ... [2023-12-15 21:54:11,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:11" (1/1) ... [2023-12-15 21:54:11,202 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:11" (1/1) ... [2023-12-15 21:54:11,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:54:11,205 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:54:11,205 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:54:11,205 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:54:11,206 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:11" (1/1) ... [2023-12-15 21:54:11,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:54:11,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:11,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 21:54:11,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 21:54:11,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:54:11,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:54:11,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:54:11,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:54:11,272 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-15 21:54:11,272 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-15 21:54:11,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-15 21:54:11,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:54:11,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-15 21:54:11,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-15 21:54:11,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-15 21:54:11,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-15 21:54:11,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-15 21:54:11,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:54:11,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:54:11,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:54:11,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:54:11,380 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:54:11,382 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:54:11,547 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:54:11,592 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:54:11,593 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-15 21:54:11,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:54:11 BoogieIcfgContainer [2023-12-15 21:54:11,593 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:54:11,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:54:11,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:54:11,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:54:11,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:54:10" (1/3) ... [2023-12-15 21:54:11,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c21c7f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:54:11, skipping insertion in model container [2023-12-15 21:54:11,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:11" (2/3) ... [2023-12-15 21:54:11,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c21c7f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:54:11, skipping insertion in model container [2023-12-15 21:54:11,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:54:11" (3/3) ... [2023-12-15 21:54:11,625 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2023-12-15 21:54:11,639 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:54:11,639 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:54:11,680 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:54:11,684 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;@dd8468, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:54:11,684 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:54:11,688 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.68) internal successors, (42), 26 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 21:54:11,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-15 21:54:11,701 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:11,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:11,706 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:11,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:11,714 INFO L85 PathProgramCache]: Analyzing trace with hash -455146651, now seen corresponding path program 1 times [2023-12-15 21:54:11,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:11,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972680701] [2023-12-15 21:54:11,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:11,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:11,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:54:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:54:11,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:11,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972680701] [2023-12-15 21:54:11,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972680701] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:54:11,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:54:11,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:54:11,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393416387] [2023-12-15 21:54:11,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:12,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:54:12,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:12,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:54:12,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:54:12,026 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.68) internal successors, (42), 26 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 21:54:12,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:12,101 INFO L93 Difference]: Finished difference Result 48 states and 75 transitions. [2023-12-15 21:54:12,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:54:12,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-12-15 21:54:12,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:12,109 INFO L225 Difference]: With dead ends: 48 [2023-12-15 21:54:12,110 INFO L226 Difference]: Without dead ends: 22 [2023-12-15 21:54:12,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:54:12,119 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:12,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:12,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-15 21:54:12,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-15 21:54:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 21:54:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-12-15 21:54:12,158 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15 [2023-12-15 21:54:12,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:12,159 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-12-15 21:54:12,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 21:54:12,159 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2023-12-15 21:54:12,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-15 21:54:12,164 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:12,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:12,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:54:12,166 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:12,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:12,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1566924888, now seen corresponding path program 1 times [2023-12-15 21:54:12,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:12,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226296863] [2023-12-15 21:54:12,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:12,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:12,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:54:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:12,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:54:12,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:12,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226296863] [2023-12-15 21:54:12,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226296863] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:54:12,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:54:12,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:54:12,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615840830] [2023-12-15 21:54:12,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:12,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:54:12,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:12,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:54:12,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:54:12,405 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 21:54:12,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:12,458 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2023-12-15 21:54:12,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:54:12,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-12-15 21:54:12,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:12,460 INFO L225 Difference]: With dead ends: 38 [2023-12-15 21:54:12,460 INFO L226 Difference]: Without dead ends: 27 [2023-12-15 21:54:12,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:54:12,462 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:12,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 48 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:12,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-15 21:54:12,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2023-12-15 21:54:12,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 21:54:12,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-12-15 21:54:12,472 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 15 [2023-12-15 21:54:12,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:12,473 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-12-15 21:54:12,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 21:54:12,473 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-12-15 21:54:12,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-15 21:54:12,474 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:12,475 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:12,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:54:12,475 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:12,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:12,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1754489508, now seen corresponding path program 1 times [2023-12-15 21:54:12,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:12,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781846052] [2023-12-15 21:54:12,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:12,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:12,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:54:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:12,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:54:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:12,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 21:54:12,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:12,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781846052] [2023-12-15 21:54:12,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781846052] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:54:12,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:54:12,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:54:12,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368082926] [2023-12-15 21:54:12,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:12,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:54:12,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:12,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:54:12,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:54:12,724 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 21:54:12,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:12,806 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2023-12-15 21:54:12,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:54:12,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-12-15 21:54:12,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:12,808 INFO L225 Difference]: With dead ends: 39 [2023-12-15 21:54:12,808 INFO L226 Difference]: Without dead ends: 32 [2023-12-15 21:54:12,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:54:12,812 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 35 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:12,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:12,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-15 21:54:12,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2023-12-15 21:54:12,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 21:54:12,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-12-15 21:54:12,823 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 23 [2023-12-15 21:54:12,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:12,823 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-12-15 21:54:12,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 21:54:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2023-12-15 21:54:12,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-15 21:54:12,824 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:12,824 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:12,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:54:12,825 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:12,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:12,826 INFO L85 PathProgramCache]: Analyzing trace with hash -600650578, now seen corresponding path program 1 times [2023-12-15 21:54:12,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:12,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740798294] [2023-12-15 21:54:12,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:12,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:13,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:54:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:13,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:54:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 21:54:13,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:13,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740798294] [2023-12-15 21:54:13,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740798294] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:54:13,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:54:13,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:54:13,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597510292] [2023-12-15 21:54:13,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:13,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:54:13,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:13,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:54:13,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:54:13,080 INFO L87 Difference]: Start difference. First operand 24 states and 30 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 21:54:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:13,164 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2023-12-15 21:54:13,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:54:13,164 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2023-12-15 21:54:13,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:13,166 INFO L225 Difference]: With dead ends: 43 [2023-12-15 21:54:13,166 INFO L226 Difference]: Without dead ends: 33 [2023-12-15 21:54:13,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:54:13,171 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:13,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 52 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:13,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-15 21:54:13,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2023-12-15 21:54:13,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 21:54:13,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2023-12-15 21:54:13,176 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 26 [2023-12-15 21:54:13,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:13,176 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2023-12-15 21:54:13,176 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 21:54:13,177 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2023-12-15 21:54:13,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-15 21:54:13,177 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:13,178 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:13,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:54:13,178 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:13,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:13,178 INFO L85 PathProgramCache]: Analyzing trace with hash -979971405, now seen corresponding path program 1 times [2023-12-15 21:54:13,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:13,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381122638] [2023-12-15 21:54:13,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:13,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:13,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:54:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:13,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:54:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:13,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-15 21:54:13,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:13,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381122638] [2023-12-15 21:54:13,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381122638] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:13,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873701434] [2023-12-15 21:54:13,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:13,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:13,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:13,321 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:54:13,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 21:54:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:13,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-15 21:54:13,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-15 21:54:13,554 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:54:13,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-15 21:54:13,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873701434] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:54:13,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:54:13,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2023-12-15 21:54:13,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825522562] [2023-12-15 21:54:13,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:54:13,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:54:13,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:13,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:54:13,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:54:13,613 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-15 21:54:13,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:13,683 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2023-12-15 21:54:13,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:54:13,684 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2023-12-15 21:54:13,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:13,685 INFO L225 Difference]: With dead ends: 42 [2023-12-15 21:54:13,686 INFO L226 Difference]: Without dead ends: 35 [2023-12-15 21:54:13,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:54:13,687 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 77 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:13,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 60 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:13,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-15 21:54:13,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2023-12-15 21:54:13,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 21:54:13,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2023-12-15 21:54:13,701 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 27 [2023-12-15 21:54:13,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:13,702 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2023-12-15 21:54:13,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-15 21:54:13,703 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2023-12-15 21:54:13,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-15 21:54:13,703 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:13,704 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:13,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 21:54:13,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:13,910 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:13,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:13,911 INFO L85 PathProgramCache]: Analyzing trace with hash 503841783, now seen corresponding path program 2 times [2023-12-15 21:54:13,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:13,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067055906] [2023-12-15 21:54:13,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:13,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:14,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:54:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:14,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:54:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:14,121 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-15 21:54:14,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:14,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067055906] [2023-12-15 21:54:14,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067055906] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:54:14,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:54:14,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:54:14,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172627697] [2023-12-15 21:54:14,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:14,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:54:14,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:14,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:54:14,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:54:14,123 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 21:54:14,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:14,191 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2023-12-15 21:54:14,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:54:14,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-12-15 21:54:14,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:14,193 INFO L225 Difference]: With dead ends: 41 [2023-12-15 21:54:14,193 INFO L226 Difference]: Without dead ends: 35 [2023-12-15 21:54:14,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:54:14,196 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:14,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 62 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:14,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-15 21:54:14,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2023-12-15 21:54:14,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 21:54:14,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-12-15 21:54:14,210 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 30 [2023-12-15 21:54:14,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:14,210 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-12-15 21:54:14,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 21:54:14,211 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-12-15 21:54:14,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-15 21:54:14,212 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:14,212 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:14,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 21:54:14,212 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:14,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:14,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1560754547, now seen corresponding path program 1 times [2023-12-15 21:54:14,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:14,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897618872] [2023-12-15 21:54:14,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:14,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:16,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:54:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:16,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:54:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:16,240 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-15 21:54:16,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:16,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897618872] [2023-12-15 21:54:16,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897618872] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:16,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432850359] [2023-12-15 21:54:16,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:16,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:16,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:16,242 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:54:16,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 21:54:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:16,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 107 conjunts are in the unsatisfiable core [2023-12-15 21:54:16,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:16,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-15 21:54:16,656 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-15 21:54:16,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-15 21:54:16,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:54:16,785 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-15 21:54:16,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2023-12-15 21:54:16,928 INFO L349 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2023-12-15 21:54:16,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 96 [2023-12-15 21:54:16,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 76 treesize of output 62 [2023-12-15 21:54:16,951 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 20 [2023-12-15 21:54:16,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-12-15 21:54:17,201 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-15 21:54:17,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 66 [2023-12-15 21:54:17,214 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 25 treesize of output 17 [2023-12-15 21:54:17,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:54:17,219 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 34 treesize of output 21 [2023-12-15 21:54:17,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:54:17,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:54:17,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 35 [2023-12-15 21:54:17,413 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 26 treesize of output 21 [2023-12-15 21:54:17,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:54:17,419 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 37 treesize of output 21 [2023-12-15 21:54:17,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 24 [2023-12-15 21:54:17,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 13 [2023-12-15 21:54:17,670 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-15 21:54:17,671 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:54:17,809 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_707 Int) (v_ArrVal_706 Int) (v_ArrVal_709 (Array Int Int))) (= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_709) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_706)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_707)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1))) is different from false [2023-12-15 21:54:17,854 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int) (v_ArrVal_707 Int) (v_ArrVal_706 Int) (v_ArrVal_709 (Array Int Int))) (or (= (+ (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_709) (select (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_706) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 8 (select (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_707) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2023-12-15 21:54:17,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:17,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2023-12-15 21:54:17,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:17,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 103 [2023-12-15 21:54:17,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2023-12-15 21:54:17,979 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int)) (= (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_705) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_706) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_707 Int)) (= (select (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_707) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_705) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_706) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2023-12-15 21:54:18,066 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_707 Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_704) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_707) |c_ULTIMATE.start_main_~s~0#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_705) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_706) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int)) (= (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_705) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_706) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))) is different from false [2023-12-15 21:54:18,106 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_705) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_706) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_707 Int)) (= (select (store (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_704) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_707) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= |c_ULTIMATE.start_main_~len~0#1| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int)) (or (forall ((v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int)) (= (select (store (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_705) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_706) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2023-12-15 21:54:18,138 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:54:18,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-12-15 21:54:18,142 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:54:18,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2023-12-15 21:54:18,363 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_701 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_701))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= .cse0 (select (store (select (store (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse2 .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) .cse0 v_ArrVal_705) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_706) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))))) (forall ((v_ArrVal_701 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_701) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_701 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int)) (not (= (select (store (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_701))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_705))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_706) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))))) is different from false [2023-12-15 21:54:18,390 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_701 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int) (v_ArrVal_697 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int)) (not (= (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_697) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_701))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_705))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_706) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (forall ((v_ArrVal_701 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| Int) (v_ArrVal_697 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int)) (let ((.cse4 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_697) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_701))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= .cse3 (select (store (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse5 .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) .cse3 v_ArrVal_705) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_18| 8) v_ArrVal_706) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))))) (forall ((v_ArrVal_701 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_697) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_701) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2023-12-15 21:54:18,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:54:18,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 91 [2023-12-15 21:54:18,416 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 630 treesize of output 608 [2023-12-15 21:54:18,432 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:54:18,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 101 [2023-12-15 21:54:18,442 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:54:18,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 234 [2023-12-15 21:54:18,453 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:54:18,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 177 [2023-12-15 21:54:18,460 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:54:18,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 112 [2023-12-15 21:54:18,490 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-15 21:54:18,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-12-15 21:54:18,492 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:54:18,493 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:54:18,497 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-15 21:54:18,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 1 [2023-12-15 21:54:18,882 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-12-15 21:54:18,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432850359] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:54:18,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:54:18,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 62 [2023-12-15 21:54:18,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510922383] [2023-12-15 21:54:18,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:54:18,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-12-15 21:54:18,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:18,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-12-15 21:54:18,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2787, Unknown=21, NotChecked=784, Total=3782 [2023-12-15 21:54:18,886 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 62 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 53 states have internal predecessors, (76), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-15 21:54:20,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:20,997 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2023-12-15 21:54:20,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-15 21:54:20,998 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 53 states have internal predecessors, (76), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 31 [2023-12-15 21:54:20,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:21,000 INFO L225 Difference]: With dead ends: 68 [2023-12-15 21:54:21,000 INFO L226 Difference]: Without dead ends: 66 [2023-12-15 21:54:21,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=338, Invalid=4361, Unknown=21, NotChecked=980, Total=5700 [2023-12-15 21:54:21,002 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 123 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 498 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:21,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 420 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 865 Invalid, 0 Unknown, 498 Unchecked, 0.8s Time] [2023-12-15 21:54:21,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-15 21:54:21,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2023-12-15 21:54:21,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 21:54:21,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2023-12-15 21:54:21,012 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 31 [2023-12-15 21:54:21,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:21,012 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2023-12-15 21:54:21,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 53 states have internal predecessors, (76), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-15 21:54:21,012 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2023-12-15 21:54:21,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-15 21:54:21,013 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:21,013 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:21,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 21:54:21,219 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,SelfDestructingSolverStorable6 [2023-12-15 21:54:21,220 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:21,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:21,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1138731337, now seen corresponding path program 2 times [2023-12-15 21:54:21,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:21,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587411359] [2023-12-15 21:54:21,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:21,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:21,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:54:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:21,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:54:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:21,363 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-15 21:54:21,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:21,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587411359] [2023-12-15 21:54:21,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587411359] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:54:21,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:54:21,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:54:21,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057689192] [2023-12-15 21:54:21,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:21,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:54:21,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:21,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:54:21,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:54:21,365 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 21:54:21,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:21,433 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2023-12-15 21:54:21,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:54:21,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2023-12-15 21:54:21,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:21,436 INFO L225 Difference]: With dead ends: 57 [2023-12-15 21:54:21,436 INFO L226 Difference]: Without dead ends: 51 [2023-12-15 21:54:21,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:54:21,437 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:21,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 51 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:21,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-15 21:54:21,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-12-15 21:54:21,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 21:54:21,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2023-12-15 21:54:21,453 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 32 [2023-12-15 21:54:21,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:21,453 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2023-12-15 21:54:21,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 21:54:21,453 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2023-12-15 21:54:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-15 21:54:21,456 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:21,456 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:21,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 21:54:21,457 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:21,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:21,457 INFO L85 PathProgramCache]: Analyzing trace with hash 245913690, now seen corresponding path program 3 times [2023-12-15 21:54:21,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:21,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362551522] [2023-12-15 21:54:21,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:21,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:21,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:54:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:21,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:54:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:21,593 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-15 21:54:21,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:21,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362551522] [2023-12-15 21:54:21,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362551522] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:21,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593443211] [2023-12-15 21:54:21,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-15 21:54:21,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:21,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:21,595 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:54:21,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-15 21:54:22,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-15 21:54:22,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:54:22,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-15 21:54:22,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:22,383 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 21:54:22,383 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:54:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 21:54:22,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593443211] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:22,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-15 21:54:22,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 11 [2023-12-15 21:54:22,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994563738] [2023-12-15 21:54:22,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:22,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:54:22,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:22,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:54:22,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:54:22,420 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 21:54:22,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:22,469 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2023-12-15 21:54:22,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:54:22,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2023-12-15 21:54:22,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:22,470 INFO L225 Difference]: With dead ends: 64 [2023-12-15 21:54:22,470 INFO L226 Difference]: Without dead ends: 54 [2023-12-15 21:54:22,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:54:22,471 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:22,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 66 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:22,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-15 21:54:22,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2023-12-15 21:54:22,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 21:54:22,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2023-12-15 21:54:22,503 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 32 [2023-12-15 21:54:22,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:22,504 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2023-12-15 21:54:22,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-15 21:54:22,504 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2023-12-15 21:54:22,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-15 21:54:22,506 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:22,506 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:22,518 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:54:22,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:22,714 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:22,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:22,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1034992552, now seen corresponding path program 4 times [2023-12-15 21:54:22,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:22,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083485713] [2023-12-15 21:54:22,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:22,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:22,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:54:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:22,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:54:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-15 21:54:22,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:22,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083485713] [2023-12-15 21:54:22,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083485713] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:22,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958084196] [2023-12-15 21:54:22,858 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-15 21:54:22,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:22,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:22,861 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:54:22,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-15 21:54:23,036 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-15 21:54:23,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:54:23,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-15 21:54:23,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:23,080 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-15 21:54:23,080 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:54:23,141 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-15 21:54:23,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958084196] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:54:23,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:54:23,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-12-15 21:54:23,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442084515] [2023-12-15 21:54:23,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:54:23,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-15 21:54:23,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:23,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-15 21:54:23,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:54:23,144 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-15 21:54:23,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:23,323 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2023-12-15 21:54:23,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 21:54:23,324 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2023-12-15 21:54:23,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:23,324 INFO L225 Difference]: With dead ends: 78 [2023-12-15 21:54:23,325 INFO L226 Difference]: Without dead ends: 62 [2023-12-15 21:54:23,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2023-12-15 21:54:23,325 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:23,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 157 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:54:23,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-15 21:54:23,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2023-12-15 21:54:23,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 21:54:23,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2023-12-15 21:54:23,335 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 32 [2023-12-15 21:54:23,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:23,335 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2023-12-15 21:54:23,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-15 21:54:23,335 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2023-12-15 21:54:23,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-15 21:54:23,336 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:23,336 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:23,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-15 21:54:23,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:23,542 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:23,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:23,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1337878013, now seen corresponding path program 1 times [2023-12-15 21:54:23,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:23,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672609557] [2023-12-15 21:54:23,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:23,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:24,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:54:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:24,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:54:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:24,306 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-15 21:54:24,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:24,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672609557] [2023-12-15 21:54:24,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672609557] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:24,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505376826] [2023-12-15 21:54:24,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:24,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:24,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:24,309 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:54:24,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-15 21:54:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:24,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 53 conjunts are in the unsatisfiable core [2023-12-15 21:54:24,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:24,597 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 13 treesize of output 9 [2023-12-15 21:54:24,736 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-15 21:54:24,736 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:54:24,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2023-12-15 21:54:24,902 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-15 21:54:24,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505376826] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:54:24,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:54:24,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 10] total 32 [2023-12-15 21:54:24,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338776800] [2023-12-15 21:54:24,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:54:24,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-15 21:54:24,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:24,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-15 21:54:24,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=889, Unknown=0, NotChecked=0, Total=992 [2023-12-15 21:54:24,904 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand has 32 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 30 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-15 21:54:25,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:25,486 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2023-12-15 21:54:25,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-15 21:54:25,487 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 30 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2023-12-15 21:54:25,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:25,488 INFO L225 Difference]: With dead ends: 77 [2023-12-15 21:54:25,488 INFO L226 Difference]: Without dead ends: 75 [2023-12-15 21:54:25,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=1578, Unknown=0, NotChecked=0, Total=1806 [2023-12-15 21:54:25,491 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 125 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:25,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 354 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:54:25,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-15 21:54:25,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 56. [2023-12-15 21:54:25,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 51 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 21:54:25,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2023-12-15 21:54:25,507 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 35 [2023-12-15 21:54:25,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:25,507 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2023-12-15 21:54:25,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 30 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-15 21:54:25,507 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2023-12-15 21:54:25,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-15 21:54:25,508 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:25,508 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2023-12-15 21:54:25,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-15 21:54:25,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-15 21:54:25,715 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:25,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:25,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1788889884, now seen corresponding path program 5 times [2023-12-15 21:54:25,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:25,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78774313] [2023-12-15 21:54:25,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:25,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:25,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:54:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:25,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:54:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:25,830 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 21:54:25,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:25,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78774313] [2023-12-15 21:54:25,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78774313] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:25,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521622878] [2023-12-15 21:54:25,830 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-15 21:54:25,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:25,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:25,832 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:54:25,850 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:54:26,005 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-12-15 21:54:26,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:54:26,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-15 21:54:26,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:26,041 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-15 21:54:26,042 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:54:26,089 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-15 21:54:26,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521622878] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:54:26,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:54:26,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-12-15 21:54:26,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802667237] [2023-12-15 21:54:26,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:54:26,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-15 21:54:26,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:26,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-15 21:54:26,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-12-15 21:54:26,091 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-15 21:54:26,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:26,228 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2023-12-15 21:54:26,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:54:26,229 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2023-12-15 21:54:26,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:26,229 INFO L225 Difference]: With dead ends: 88 [2023-12-15 21:54:26,229 INFO L226 Difference]: Without dead ends: 56 [2023-12-15 21:54:26,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2023-12-15 21:54:26,230 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 42 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:26,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 147 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:54:26,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-15 21:54:26,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2023-12-15 21:54:26,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 21:54:26,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2023-12-15 21:54:26,237 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 35 [2023-12-15 21:54:26,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:26,238 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2023-12-15 21:54:26,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-15 21:54:26,238 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2023-12-15 21:54:26,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-15 21:54:26,238 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:26,238 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:26,247 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:54:26,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:26,448 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:26,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:26,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1475473921, now seen corresponding path program 2 times [2023-12-15 21:54:26,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:26,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255504282] [2023-12-15 21:54:26,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:26,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:26,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:54:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:26,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:54:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 21:54:26,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:26,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255504282] [2023-12-15 21:54:26,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255504282] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:26,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573215364] [2023-12-15 21:54:26,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 21:54:26,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:26,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:26,555 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:54:26,576 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:54:26,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-15 21:54:26,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:54:26,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 21:54:26,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:26,847 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 21:54:26,847 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:54:26,899 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 21:54:26,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573215364] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:54:26,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:54:26,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2023-12-15 21:54:26,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215816182] [2023-12-15 21:54:26,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:54:26,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 21:54:26,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:26,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 21:54:26,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:54:26,901 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-15 21:54:26,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:26,972 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2023-12-15 21:54:26,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:54:26,973 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2023-12-15 21:54:26,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:26,973 INFO L225 Difference]: With dead ends: 56 [2023-12-15 21:54:26,973 INFO L226 Difference]: Without dead ends: 34 [2023-12-15 21:54:26,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:54:26,974 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:26,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 87 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:54:26,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-15 21:54:26,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-12-15 21:54:26,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 21:54:26,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2023-12-15 21:54:26,978 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 36 [2023-12-15 21:54:26,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:26,978 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2023-12-15 21:54:26,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-15 21:54:26,979 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2023-12-15 21:54:26,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-15 21:54:26,979 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:54:26,979 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:54:26,988 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:54:27,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:27,186 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:54:27,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:54:27,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1416791151, now seen corresponding path program 6 times [2023-12-15 21:54:27,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:54:27,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676903990] [2023-12-15 21:54:27,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:54:27,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:54:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:27,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 21:54:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:27,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:54:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:27,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-15 21:54:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:54:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-15 21:54:27,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:54:27,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676903990] [2023-12-15 21:54:27,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676903990] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:54:27,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937675041] [2023-12-15 21:54:27,321 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-15 21:54:27,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:54:27,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:54:27,323 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:54:27,327 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:54:27,824 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-12-15 21:54:27,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:54:27,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-15 21:54:27,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:54:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-15 21:54:27,844 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:54:27,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937675041] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:54:27,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:54:27,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-12-15 21:54:27,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038918760] [2023-12-15 21:54:27,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:54:27,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:54:27,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:54:27,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:54:27,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:54:27,845 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-15 21:54:27,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:54:27,858 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2023-12-15 21:54:27,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:54:27,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2023-12-15 21:54:27,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:54:27,859 INFO L225 Difference]: With dead ends: 37 [2023-12-15 21:54:27,859 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 21:54:27,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:54:27,860 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:54:27,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 16 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:54:27,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 21:54:27,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 21:54:27,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:54:27,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 21:54:27,861 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2023-12-15 21:54:27,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:54:27,861 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 21:54:27,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-15 21:54:27,861 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 21:54:27,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 21:54:27,863 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:54:27,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-15 21:54:28,074 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,SelfDestructingSolverStorable13 [2023-12-15 21:54:28,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 21:54:28,482 INFO L895 garLoopResultBuilder]: At program point L589(line 589) the Hoare annotation is: (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_~len#1| 2) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) [2023-12-15 21:54:28,483 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2023-12-15 21:54:28,483 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 626 645) no Hoare annotation was computed. [2023-12-15 21:54:28,483 INFO L895 garLoopResultBuilder]: At program point L631-3(lines 631 634) the Hoare annotation is: (let ((.cse7 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse5 (select .cse7 4)) (.cse6 (select .cse7 0))) (let ((.cse1 (= 3 (select (select |#memory_int#1| .cse6) 8))) (.cse0 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0)) (.cse2 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse3 (= .cse5 .cse6)) (.cse4 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0) (= 2 (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) 8)) .cse1 .cse2 .cse3 .cse4) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 (not (= .cse5 |ULTIMATE.start_main_~s~0#1.base|)) .cse1 .cse2 .cse3 .cse4) (and .cse0 (not (= |ULTIMATE.start_main_~s~0#1.base| .cse6)) (= |ULTIMATE.start_main_~i~0#1| 1) .cse2 .cse3 .cse4))))) [2023-12-15 21:54:28,483 INFO L899 garLoopResultBuilder]: For program point L631-4(lines 631 634) no Hoare annotation was computed. [2023-12-15 21:54:28,483 INFO L899 garLoopResultBuilder]: For program point L591(lines 591 593) no Hoare annotation was computed. [2023-12-15 21:54:28,483 INFO L899 garLoopResultBuilder]: For program point L591-2(lines 591 593) no Hoare annotation was computed. [2023-12-15 21:54:28,483 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 21:54:28,483 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 611) no Hoare annotation was computed. [2023-12-15 21:54:28,483 INFO L899 garLoopResultBuilder]: For program point L602(lines 602 610) no Hoare annotation was computed. [2023-12-15 21:54:28,483 INFO L895 garLoopResultBuilder]: At program point L635-3(lines 635 640) the Hoare annotation is: (let ((.cse0 (= 2 (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) 8))) (.cse2 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (let ((.cse3 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse1 (select .cse3 0))) (and (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~i~0#1| 1) .cse0 (= 3 (select (select |#memory_int#1| .cse1) 8)) .cse2 (= (select .cse3 4) .cse1) .cse4))) (and (<= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse2 .cse4))) [2023-12-15 21:54:28,484 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 643) no Hoare annotation was computed. [2023-12-15 21:54:28,484 INFO L899 garLoopResultBuilder]: For program point L635-4(lines 635 640) no Hoare annotation was computed. [2023-12-15 21:54:28,484 INFO L895 garLoopResultBuilder]: At program point L586(line 586) the Hoare annotation is: (and (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (= |ULTIMATE.start_main_~len~0#1| 2)) [2023-12-15 21:54:28,484 INFO L899 garLoopResultBuilder]: For program point L586-1(line 586) no Hoare annotation was computed. [2023-12-15 21:54:28,484 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 21:54:28,484 INFO L895 garLoopResultBuilder]: At program point L620-2(lines 620 623) the Hoare annotation is: (let ((.cse10 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse9 (select .cse10 4)) (.cse8 (select .cse10 0))) (let ((.cse1 (= 3 |ULTIMATE.start_dll_circular_update_at_~data#1|)) (.cse2 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (= |ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0)) (.cse7 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0)) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= .cse9 .cse8)) (.cse5 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse6 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and .cse0 (= |ULTIMATE.start_dll_circular_update_at_~index#1| 1) .cse1 .cse2 (not (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) 0) |ULTIMATE.start_main_~s~0#1.base|)) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_update_at_~head#1.base|) 0) 0) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 (= |ULTIMATE.start_dll_circular_update_at_~index#1| 0) .cse7 .cse2 (not .cse5) .cse3 (= |ULTIMATE.start_dll_circular_update_at_~head#1.base| .cse8) .cse4 .cse6) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 0) .cse7 (<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_dll_circular_update_at_~index#1|) (not (= .cse9 |ULTIMATE.start_main_~s~0#1.base|)) (= 2 |ULTIMATE.start_dll_circular_update_at_~data#1|) (<= |ULTIMATE.start_dll_circular_update_at_~index#1| 0) (= 3 (select (select |#memory_int#1| .cse8) 8)) .cse3 .cse4 .cse5 .cse6))))) [2023-12-15 21:54:28,484 INFO L899 garLoopResultBuilder]: For program point L620-3(lines 620 623) no Hoare annotation was computed. [2023-12-15 21:54:28,484 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 639) no Hoare annotation was computed. [2023-12-15 21:54:28,484 INFO L902 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2023-12-15 21:54:28,484 INFO L899 garLoopResultBuilder]: For program point L604-3(lines 604 608) no Hoare annotation was computed. [2023-12-15 21:54:28,484 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 626 645) no Hoare annotation was computed. [2023-12-15 21:54:28,484 INFO L895 garLoopResultBuilder]: At program point L588-2(lines 588 596) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (and .cse0 (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) 0) .cse1 (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (not .cse2)) (and .cse0 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= 2 |ULTIMATE.start_dll_circular_create_~len#1|) .cse1 .cse2))) [2023-12-15 21:54:28,484 INFO L899 garLoopResultBuilder]: For program point L588-3(lines 588 596) no Hoare annotation was computed. [2023-12-15 21:54:28,484 INFO L895 garLoopResultBuilder]: At program point L613-2(lines 613 616) the Hoare annotation is: (let ((.cse14 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse15 (select .cse14 0))) (let ((.cse6 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~s~0#1.base|) 0) 0)) (.cse1 (<= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 0)) (.cse7 (= |ULTIMATE.start_main_~i~0#1| 1)) (.cse9 (= 3 |ULTIMATE.start_main_~expected~0#1|)) (.cse0 (select (select |#memory_int#1| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) 8)) (.cse2 (= 2 (select (select |#memory_int#1| |ULTIMATE.start_main_~s~0#1.base|) 8))) (.cse11 (= 3 (select (select |#memory_int#1| .cse15) 8))) (.cse3 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse4 (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.offset| 0)) (.cse12 (= (select .cse14 4) .cse15)) (.cse5 (= |ULTIMATE.start_main_~s~0#1.offset| 0))) (or (and (= .cse0 2) (= |ULTIMATE.start_main_~i~0#1| 0) .cse1 (= 2 |ULTIMATE.start_main_~expected~0#1|) .cse2 .cse3 .cse4 .cse5) (let ((.cse13 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|))) (let ((.cse8 (select .cse13 4)) (.cse10 (select .cse13 0))) (and .cse6 .cse7 (= |ULTIMATE.start_dll_circular_get_data_at_~index#1| 1) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_get_data_at_~head#1.base|) 0) 0) (not (= |ULTIMATE.start_dll_circular_get_data_at_~head#1.base| .cse8)) .cse9 (= .cse10 .cse8) .cse2 .cse11 .cse3 .cse4 .cse12 (= (select (select |#memory_int#1| .cse10) 8) 3) .cse5))) (and .cse6 .cse1 .cse7 .cse9 (= .cse0 3) .cse2 .cse11 .cse3 .cse4 .cse12 .cse5))))) [2023-12-15 21:54:28,485 INFO L899 garLoopResultBuilder]: For program point L613-3(lines 613 616) no Hoare annotation was computed. [2023-12-15 21:54:28,485 INFO L899 garLoopResultBuilder]: For program point L577(lines 577 579) no Hoare annotation was computed. [2023-12-15 21:54:28,485 INFO L899 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2023-12-15 21:54:28,485 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 575 584) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |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:54:28,485 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 575 584) no Hoare annotation was computed. [2023-12-15 21:54:28,487 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1] [2023-12-15 21:54:28,489 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:54:28,498 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:54:28,517 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][0] could not be translated [2023-12-15 21:54:28,517 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][0] could not be translated [2023-12-15 21:54:28,517 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-15 21:54:28,517 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-12-15 21:54:28,517 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:54:28,517 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:54:28,517 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-15 21:54:28,518 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:54:28,518 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:54:28,518 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-12-15 21:54:28,518 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-15 21:54:28,518 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-12-15 21:54:28,518 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:54:28,518 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-15 21:54:28,518 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-15 21:54:28,518 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][8] could not be translated [2023-12-15 21:54:28,518 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-15 21:54:28,518 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-12-15 21:54:28,518 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:54:28,519 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-15 21:54:28,519 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8] could not be translated [2023-12-15 21:54:28,519 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][8] could not be translated [2023-12-15 21:54:28,520 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-15 21:54:28,520 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-12-15 21:54:28,520 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8] could not be translated [2023-12-15 21:54:28,521 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-15 21:54:28,521 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8] could not be translated [2023-12-15 21:54:28,521 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][8] could not be translated [2023-12-15 21:54:28,521 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-15 21:54:28,521 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-12-15 21:54:28,521 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-15 21:54:28,521 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-15 21:54:28,521 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][8] could not be translated [2023-12-15 21:54:28,522 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-15 21:54:28,522 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-12-15 21:54:28,522 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-15 21:54:28,522 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-12-15 21:54:28,522 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-15 21:54:28,522 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-12-15 21:54:28,523 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][0] could not be translated [2023-12-15 21:54:28,523 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][0] could not be translated [2023-12-15 21:54:28,523 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-15 21:54:28,524 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][8] could not be translated [2023-12-15 21:54:28,525 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8] could not be translated [2023-12-15 21:54:28,525 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:54:28,525 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-15 21:54:28,525 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][0] could not be translated [2023-12-15 21:54:28,525 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:54:28,525 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][4] could not be translated [2023-12-15 21:54:28,525 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][0] could not be translated [2023-12-15 21:54:28,525 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][4] could not be translated [2023-12-15 21:54:28,525 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8] could not be translated [2023-12-15 21:54:28,526 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][8] could not be translated [2023-12-15 21:54:28,526 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:54:28,526 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-15 21:54:28,526 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-12-15 21:54:28,526 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~head!base][0]][8] could not be translated [2023-12-15 21:54:28,526 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated [2023-12-15 21:54:28,526 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][8] could not be translated [2023-12-15 21:54:28,526 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8] could not be translated [2023-12-15 21:54:28,527 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][8] could not be translated [2023-12-15 21:54:28,527 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression [2023-12-15 21:54:28,527 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated [2023-12-15 21:54:28,527 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated [2023-12-15 21:54:28,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:54:28 BoogieIcfgContainer [2023-12-15 21:54:28,527 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:54:28,527 INFO L158 Benchmark]: Toolchain (without parser) took 17887.16ms. Allocated memory was 196.1MB in the beginning and 364.9MB in the end (delta: 168.8MB). Free memory was 152.9MB in the beginning and 239.9MB in the end (delta: -87.0MB). Peak memory consumption was 82.7MB. Max. memory is 8.0GB. [2023-12-15 21:54:28,528 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 196.1MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:54:28,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.39ms. Allocated memory is still 196.1MB. Free memory was 152.5MB in the beginning and 133.9MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-15 21:54:28,532 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.32ms. Allocated memory is still 196.1MB. Free memory was 133.9MB in the beginning and 131.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:54:28,533 INFO L158 Benchmark]: Boogie Preprocessor took 63.80ms. Allocated memory is still 196.1MB. Free memory was 131.6MB in the beginning and 128.8MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 21:54:28,533 INFO L158 Benchmark]: RCFGBuilder took 388.28ms. Allocated memory is still 196.1MB. Free memory was 128.8MB in the beginning and 110.3MB in the end (delta: 18.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-15 21:54:28,533 INFO L158 Benchmark]: TraceAbstraction took 16911.00ms. Allocated memory was 196.1MB in the beginning and 364.9MB in the end (delta: 168.8MB). Free memory was 171.9MB in the beginning and 239.9MB in the end (delta: -68.0MB). Peak memory consumption was 101.2MB. Max. memory is 8.0GB. [2023-12-15 21:54:28,539 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.16ms. Allocated memory is still 196.1MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 445.39ms. Allocated memory is still 196.1MB. Free memory was 152.5MB in the beginning and 133.9MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.32ms. Allocated memory is still 196.1MB. Free memory was 133.9MB in the beginning and 131.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 63.80ms. Allocated memory is still 196.1MB. Free memory was 131.6MB in the beginning and 128.8MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 388.28ms. Allocated memory is still 196.1MB. Free memory was 128.8MB in the beginning and 110.3MB in the end (delta: 18.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 16911.00ms. Allocated memory was 196.1MB in the beginning and 364.9MB in the end (delta: 168.8MB). Free memory was 171.9MB in the beginning and 239.9MB in the end (delta: -68.0MB). Peak memory consumption was 101.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head~0!base][0] 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_int#1[~head!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!base has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~head!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~head!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~s~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~head!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~s~0!base][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[#memory_$Pointer$#1.base[~s~0!base][0]][8] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression ~head!offset has a CASTFunctionDefinition but is no IdentifierExpression: IdentifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~s~0!base][0] 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: 643]: 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: 16.8s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 535 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 532 mSDsluCounter, 1622 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 498 IncrementalHoareTripleChecker+Unchecked, 1365 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2065 IncrementalHoareTripleChecker+Invalid, 2614 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 257 mSDtfsCounter, 2065 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 677 GetRequests, 448 SyntacticMatches, 18 SemanticMatches, 211 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1679 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=10, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 78 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 27 NumberOfFragments, 632 HoareAnnotationTreeSize, 11 FormulaSimplifications, 2470 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FormulaSimplificationsInter, 132 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 675 NumberOfCodeBlocks, 654 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 874 ConstructedInterpolants, 14 QuantifiedInterpolants, 4832 SizeOfPredicates, 55 NumberOfNonLiveVariables, 2654 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 29 InterpolantComputations, 8 PerfectInterpolantSequences, 309/409 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: 620]: Loop Invariant Derived loop invariant: ((((index == 1) && (3 == data)) || ((3 == data) && (index == 0))) || ((2 == data) && (index <= 0))) - InvariantResult [Line: 635]: Loop Invariant Derived loop invariant: (((i == 1) && (len == 2)) || ((i <= 0) && (len == 2))) - InvariantResult [Line: 631]: Loop Invariant Derived loop invariant: (((((i + 1) <= 0) && (len == 2)) || ((i == 0) && (len == 2))) || ((i == 1) && (len == 2))) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 588]: Loop Invariant Derived loop invariant: (((len == 2) && (len <= 1)) || ((2 == len) && (len == 2))) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: (((index <= 0) || (index == 1)) || (index <= 0)) RESULT: Ultimate proved your program to be correct! [2023-12-15 21:54:28,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...