./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_update_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 07:02:14,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 07:02:14,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 07:02:14,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 07:02:14,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 07:02:15,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 07:02:15,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 07:02:15,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 07:02:15,018 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 07:02:15,018 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 07:02:15,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 07:02:15,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 07:02:15,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 07:02:15,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 07:02:15,020 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 07:02:15,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 07:02:15,021 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 07:02:15,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 07:02:15,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 07:02:15,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 07:02:15,027 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 07:02:15,028 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 07:02:15,028 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 07:02:15,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 07:02:15,028 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 07:02:15,028 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 07:02:15,029 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 07:02:15,029 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 07:02:15,029 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 07:02:15,029 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 07:02:15,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 07:02:15,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 07:02:15,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 07:02:15,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:02:15,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 07:02:15,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 07:02:15,032 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 07:02:15,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 07:02:15,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 07:02:15,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 07:02:15,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 07:02:15,035 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 07:02:15,035 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 [2024-11-19 07:02:15,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 07:02:15,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 07:02:15,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 07:02:15,319 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 07:02:15,319 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 07:02:15,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all.i [2024-11-19 07:02:16,767 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 07:02:17,038 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 07:02:17,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i [2024-11-19 07:02:17,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8633e745b/b59fd7aa7b1949a2bda04b85470be5a4/FLAG81a3499e1 [2024-11-19 07:02:17,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8633e745b/b59fd7aa7b1949a2bda04b85470be5a4 [2024-11-19 07:02:17,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 07:02:17,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 07:02:17,082 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 07:02:17,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 07:02:17,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 07:02:17,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:02:17" (1/1) ... [2024-11-19 07:02:17,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3919f2a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:17, skipping insertion in model container [2024-11-19 07:02:17,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:02:17" (1/1) ... [2024-11-19 07:02:17,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 07:02:17,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:02:17,445 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 07:02:17,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:02:17,536 INFO L204 MainTranslator]: Completed translation [2024-11-19 07:02:17,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:17 WrapperNode [2024-11-19 07:02:17,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 07:02:17,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 07:02:17,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 07:02:17,539 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 07:02:17,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:17" (1/1) ... [2024-11-19 07:02:17,559 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:17" (1/1) ... [2024-11-19 07:02:17,596 INFO L138 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-11-19 07:02:17,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 07:02:17,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 07:02:17,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 07:02:17,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 07:02:17,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:17" (1/1) ... [2024-11-19 07:02:17,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:17" (1/1) ... [2024-11-19 07:02:17,612 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:17" (1/1) ... [2024-11-19 07:02:17,627 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-19 07:02:17,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:17" (1/1) ... [2024-11-19 07:02:17,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:17" (1/1) ... [2024-11-19 07:02:17,635 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:17" (1/1) ... [2024-11-19 07:02:17,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:17" (1/1) ... [2024-11-19 07:02:17,640 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:17" (1/1) ... [2024-11-19 07:02:17,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:17" (1/1) ... [2024-11-19 07:02:17,645 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 07:02:17,646 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 07:02:17,646 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 07:02:17,647 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 07:02:17,647 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:17" (1/1) ... [2024-11-19 07:02:17,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:02:17,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:17,685 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) [2024-11-19 07:02:17,687 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 [2024-11-19 07:02:17,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 07:02:17,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 07:02:17,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 07:02:17,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 07:02:17,727 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-19 07:02:17,727 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-19 07:02:17,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 07:02:17,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 07:02:17,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 07:02:17,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 07:02:17,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 07:02:17,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 07:02:17,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 07:02:17,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 07:02:17,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 07:02:17,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 07:02:17,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 07:02:17,840 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 07:02:17,843 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 07:02:18,230 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-19 07:02:18,230 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 07:02:18,245 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 07:02:18,246 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-19 07:02:18,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:02:18 BoogieIcfgContainer [2024-11-19 07:02:18,247 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 07:02:18,249 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 07:02:18,249 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 07:02:18,252 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 07:02:18,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:02:17" (1/3) ... [2024-11-19 07:02:18,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c60eca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:02:18, skipping insertion in model container [2024-11-19 07:02:18,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:17" (2/3) ... [2024-11-19 07:02:18,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c60eca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:02:18, skipping insertion in model container [2024-11-19 07:02:18,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:02:18" (3/3) ... [2024-11-19 07:02:18,254 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2024-11-19 07:02:18,270 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 07:02:18,270 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2024-11-19 07:02:18,308 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 07:02:18,314 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@9293915, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 07:02:18,314 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-11-19 07:02:18,318 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 82 states have internal predecessors, (98), 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) [2024-11-19 07:02:18,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 07:02:18,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:18,326 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 07:02:18,327 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:18,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:18,334 INFO L85 PathProgramCache]: Analyzing trace with hash 894752021, now seen corresponding path program 1 times [2024-11-19 07:02:18,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:18,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602225405] [2024-11-19 07:02:18,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:18,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:18,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:18,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:18,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602225405] [2024-11-19 07:02:18,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602225405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:18,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:18,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:02:18,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456738002] [2024-11-19 07:02:18,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:18,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:02:18,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:18,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:02:18,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:02:18,624 INFO L87 Difference]: Start difference. First operand has 86 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 82 states have internal predecessors, (98), 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, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:02:18,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:18,719 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2024-11-19 07:02:18,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:02:18,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-19 07:02:18,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:18,729 INFO L225 Difference]: With dead ends: 83 [2024-11-19 07:02:18,729 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 07:02:18,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:02:18,736 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 143 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:18,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 143 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:02:18,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 07:02:18,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-19 07:02:18,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 76 states have internal predecessors, (83), 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) [2024-11-19 07:02:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2024-11-19 07:02:18,782 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 6 [2024-11-19 07:02:18,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:18,783 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2024-11-19 07:02:18,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:02:18,783 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2024-11-19 07:02:18,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 07:02:18,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:18,785 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 07:02:18,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 07:02:18,786 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:18,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:18,787 INFO L85 PathProgramCache]: Analyzing trace with hash 894752022, now seen corresponding path program 1 times [2024-11-19 07:02:18,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:18,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70525910] [2024-11-19 07:02:18,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:18,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:18,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:18,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:18,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70525910] [2024-11-19 07:02:18,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70525910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:18,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:18,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:02:18,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256126507] [2024-11-19 07:02:18,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:18,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:02:18,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:18,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:02:18,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:02:18,946 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:02:19,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:19,005 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2024-11-19 07:02:19,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:02:19,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-19 07:02:19,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:19,009 INFO L225 Difference]: With dead ends: 78 [2024-11-19 07:02:19,009 INFO L226 Difference]: Without dead ends: 78 [2024-11-19 07:02:19,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:02:19,012 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 2 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:19,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 144 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:02:19,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-19 07:02:19,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-19 07:02:19,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.588235294117647) internal successors, (81), 74 states have internal predecessors, (81), 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) [2024-11-19 07:02:19,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2024-11-19 07:02:19,022 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2024-11-19 07:02:19,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:19,023 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2024-11-19 07:02:19,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:02:19,023 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2024-11-19 07:02:19,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 07:02:19,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:19,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:19,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 07:02:19,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:19,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:19,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1374205737, now seen corresponding path program 1 times [2024-11-19 07:02:19,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:19,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936952410] [2024-11-19 07:02:19,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:19,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:19,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:19,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936952410] [2024-11-19 07:02:19,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936952410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:19,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:19,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:02:19,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534008995] [2024-11-19 07:02:19,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:19,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:02:19,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:19,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:02:19,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:02:19,123 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2024-11-19 07:02:19,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:19,137 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2024-11-19 07:02:19,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:02:19,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2024-11-19 07:02:19,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:19,140 INFO L225 Difference]: With dead ends: 85 [2024-11-19 07:02:19,140 INFO L226 Difference]: Without dead ends: 85 [2024-11-19 07:02:19,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:02:19,141 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 5 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:19,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 161 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:02:19,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-19 07:02:19,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2024-11-19 07:02:19,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 75 states have internal predecessors, (82), 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) [2024-11-19 07:02:19,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2024-11-19 07:02:19,152 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 13 [2024-11-19 07:02:19,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:19,153 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2024-11-19 07:02:19,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2024-11-19 07:02:19,153 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2024-11-19 07:02:19,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 07:02:19,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:19,154 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:19,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 07:02:19,155 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:19,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:19,156 INFO L85 PathProgramCache]: Analyzing trace with hash -469621220, now seen corresponding path program 1 times [2024-11-19 07:02:19,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:19,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470292053] [2024-11-19 07:02:19,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:19,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:19,349 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 07:02:19,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:19,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470292053] [2024-11-19 07:02:19,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470292053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:19,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:19,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 07:02:19,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722295212] [2024-11-19 07:02:19,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:19,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:02:19,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:19,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:02:19,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:02:19,354 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:19,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:19,488 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2024-11-19 07:02:19,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 07:02:19,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-19 07:02:19,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:19,489 INFO L225 Difference]: With dead ends: 78 [2024-11-19 07:02:19,489 INFO L226 Difference]: Without dead ends: 78 [2024-11-19 07:02:19,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:02:19,490 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:19,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 281 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:02:19,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-19 07:02:19,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-19 07:02:19,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 74 states have internal predecessors, (81), 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) [2024-11-19 07:02:19,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2024-11-19 07:02:19,503 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 22 [2024-11-19 07:02:19,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:19,505 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2024-11-19 07:02:19,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:19,505 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2024-11-19 07:02:19,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 07:02:19,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:19,506 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:19,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 07:02:19,507 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:19,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:19,507 INFO L85 PathProgramCache]: Analyzing trace with hash -469621219, now seen corresponding path program 1 times [2024-11-19 07:02:19,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:19,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076696108] [2024-11-19 07:02:19,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:19,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:19,730 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:02:19,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:19,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076696108] [2024-11-19 07:02:19,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076696108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:19,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:19,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 07:02:19,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945940904] [2024-11-19 07:02:19,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:19,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:02:19,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:19,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:02:19,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:02:19,733 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:19,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:19,845 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2024-11-19 07:02:19,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 07:02:19,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-19 07:02:19,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:19,848 INFO L225 Difference]: With dead ends: 77 [2024-11-19 07:02:19,848 INFO L226 Difference]: Without dead ends: 77 [2024-11-19 07:02:19,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:02:19,850 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 1 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:19,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 303 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:02:19,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-19 07:02:19,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-19 07:02:19,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 73 states have internal predecessors, (80), 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) [2024-11-19 07:02:19,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2024-11-19 07:02:19,861 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 22 [2024-11-19 07:02:19,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:19,862 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2024-11-19 07:02:19,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2024-11-19 07:02:19,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 07:02:19,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:19,864 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:19,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 07:02:19,865 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:19,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:19,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1777293115, now seen corresponding path program 1 times [2024-11-19 07:02:19,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:19,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946246270] [2024-11-19 07:02:19,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:19,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:20,222 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:02:20,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:20,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946246270] [2024-11-19 07:02:20,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946246270] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:20,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564055164] [2024-11-19 07:02:20,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:20,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:20,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:20,225 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) [2024-11-19 07:02:20,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 07:02:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:20,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 07:02:20,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:20,393 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 [2024-11-19 07:02:20,424 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-19 07:02:20,457 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 07:02:20,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-19 07:02:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-19 07:02:20,477 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:20,639 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:02:20,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564055164] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:02:20,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:02:20,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 11 [2024-11-19 07:02:20,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788124662] [2024-11-19 07:02:20,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:20,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 07:02:20,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:20,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 07:02:20,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-11-19 07:02:20,641 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:20,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:20,830 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2024-11-19 07:02:20,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 07:02:20,830 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2024-11-19 07:02:20,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:20,833 INFO L225 Difference]: With dead ends: 76 [2024-11-19 07:02:20,833 INFO L226 Difference]: Without dead ends: 76 [2024-11-19 07:02:20,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=101, Unknown=1, NotChecked=20, Total=156 [2024-11-19 07:02:20,834 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 1 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:20,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 418 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 210 Invalid, 0 Unknown, 76 Unchecked, 0.1s Time] [2024-11-19 07:02:20,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-19 07:02:20,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-19 07:02:20,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 72 states have internal predecessors, (79), 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) [2024-11-19 07:02:20,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2024-11-19 07:02:20,845 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 25 [2024-11-19 07:02:20,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:20,846 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2024-11-19 07:02:20,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:20,846 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2024-11-19 07:02:20,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 07:02:20,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:20,847 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:20,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 07:02:21,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-19 07:02:21,048 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:21,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:21,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1777293114, now seen corresponding path program 1 times [2024-11-19 07:02:21,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:21,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567874072] [2024-11-19 07:02:21,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:21,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:21,484 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:21,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:21,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567874072] [2024-11-19 07:02:21,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567874072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:21,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738565466] [2024-11-19 07:02:21,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:21,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:21,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:21,490 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) [2024-11-19 07:02:21,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 07:02:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:21,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 07:02:21,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:21,606 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 8 treesize of output 1 [2024-11-19 07:02:21,610 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 [2024-11-19 07:02:21,767 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-19 07:02:21,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:21,817 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 14 treesize of output 9 [2024-11-19 07:02:21,826 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:02:21,826 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 [2024-11-19 07:02:21,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-19 07:02:21,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:22,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738565466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:22,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 07:02:22,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2024-11-19 07:02:22,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164644753] [2024-11-19 07:02:22,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:22,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 07:02:22,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:22,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 07:02:22,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=257, Unknown=1, NotChecked=32, Total=342 [2024-11-19 07:02:22,009 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 17 states, 16 states have (on average 2.5) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 07:02:22,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:22,264 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2024-11-19 07:02:22,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 07:02:22,265 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.5) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2024-11-19 07:02:22,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:22,267 INFO L225 Difference]: With dead ends: 83 [2024-11-19 07:02:22,267 INFO L226 Difference]: Without dead ends: 83 [2024-11-19 07:02:22,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=319, Unknown=1, NotChecked=36, Total=420 [2024-11-19 07:02:22,268 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 2 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:22,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 482 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 255 Invalid, 0 Unknown, 87 Unchecked, 0.2s Time] [2024-11-19 07:02:22,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-19 07:02:22,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2024-11-19 07:02:22,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 77 states have internal predecessors, (85), 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) [2024-11-19 07:02:22,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2024-11-19 07:02:22,279 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 25 [2024-11-19 07:02:22,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:22,280 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2024-11-19 07:02:22,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.5) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 07:02:22,280 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2024-11-19 07:02:22,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 07:02:22,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:22,281 INFO L215 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] [2024-11-19 07:02:22,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 07:02:22,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-19 07:02:22,486 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:22,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:22,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1307976759, now seen corresponding path program 1 times [2024-11-19 07:02:22,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:22,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146978415] [2024-11-19 07:02:22,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:22,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:22,646 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 07:02:22,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:22,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146978415] [2024-11-19 07:02:22,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146978415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:22,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:22,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 07:02:22,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529353833] [2024-11-19 07:02:22,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:22,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 07:02:22,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:22,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 07:02:22,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:02:22,648 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:22,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:22,847 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2024-11-19 07:02:22,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 07:02:22,848 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-19 07:02:22,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:22,849 INFO L225 Difference]: With dead ends: 85 [2024-11-19 07:02:22,849 INFO L226 Difference]: Without dead ends: 85 [2024-11-19 07:02:22,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-19 07:02:22,850 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 43 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:22,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 402 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 07:02:22,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-19 07:02:22,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-19 07:02:22,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 80 states have internal predecessors, (91), 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) [2024-11-19 07:02:22,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2024-11-19 07:02:22,859 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 30 [2024-11-19 07:02:22,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:22,859 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2024-11-19 07:02:22,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:22,860 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2024-11-19 07:02:22,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 07:02:22,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:22,861 INFO L215 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] [2024-11-19 07:02:22,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 07:02:22,862 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:22,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:22,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1307976758, now seen corresponding path program 1 times [2024-11-19 07:02:22,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:22,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442783101] [2024-11-19 07:02:22,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:22,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:23,110 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:02:23,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:23,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442783101] [2024-11-19 07:02:23,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442783101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:23,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:23,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 07:02:23,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784491414] [2024-11-19 07:02:23,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:23,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 07:02:23,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:23,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 07:02:23,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:02:23,113 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:23,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:23,272 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2024-11-19 07:02:23,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 07:02:23,273 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-19 07:02:23,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:23,274 INFO L225 Difference]: With dead ends: 85 [2024-11-19 07:02:23,274 INFO L226 Difference]: Without dead ends: 85 [2024-11-19 07:02:23,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-19 07:02:23,275 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 40 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:23,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 451 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:02:23,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-19 07:02:23,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-19 07:02:23,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 80 states have internal predecessors, (89), 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) [2024-11-19 07:02:23,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2024-11-19 07:02:23,279 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 30 [2024-11-19 07:02:23,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:23,279 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2024-11-19 07:02:23,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:23,280 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2024-11-19 07:02:23,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 07:02:23,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:23,281 INFO L215 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] [2024-11-19 07:02:23,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 07:02:23,281 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:23,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:23,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1458520006, now seen corresponding path program 1 times [2024-11-19 07:02:23,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:23,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576325889] [2024-11-19 07:02:23,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:23,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:23,343 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 07:02:23,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:23,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576325889] [2024-11-19 07:02:23,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576325889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:23,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:23,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 07:02:23,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227746759] [2024-11-19 07:02:23,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:23,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 07:02:23,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:23,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 07:02:23,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 07:02:23,345 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2024-11-19 07:02:23,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:23,366 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2024-11-19 07:02:23,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 07:02:23,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 [2024-11-19 07:02:23,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:23,367 INFO L225 Difference]: With dead ends: 116 [2024-11-19 07:02:23,367 INFO L226 Difference]: Without dead ends: 116 [2024-11-19 07:02:23,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 07:02:23,368 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 62 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:23,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 183 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:02:23,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-19 07:02:23,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 87. [2024-11-19 07:02:23,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.467741935483871) internal successors, (91), 82 states have internal predecessors, (91), 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) [2024-11-19 07:02:23,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2024-11-19 07:02:23,373 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 32 [2024-11-19 07:02:23,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:23,373 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2024-11-19 07:02:23,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2024-11-19 07:02:23,373 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2024-11-19 07:02:23,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 07:02:23,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:23,374 INFO L215 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, 1] [2024-11-19 07:02:23,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 07:02:23,375 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:23,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:23,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1990660867, now seen corresponding path program 1 times [2024-11-19 07:02:23,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:23,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228791606] [2024-11-19 07:02:23,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:23,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 07:02:23,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:23,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228791606] [2024-11-19 07:02:23,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228791606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:23,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:23,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 07:02:23,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663757577] [2024-11-19 07:02:23,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:23,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 07:02:23,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:23,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 07:02:23,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 07:02:23,461 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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) [2024-11-19 07:02:23,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:23,487 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2024-11-19 07:02:23,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 07:02:23,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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 33 [2024-11-19 07:02:23,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:23,489 INFO L225 Difference]: With dead ends: 107 [2024-11-19 07:02:23,489 INFO L226 Difference]: Without dead ends: 107 [2024-11-19 07:02:23,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:02:23,490 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 21 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:23,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 224 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:02:23,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-19 07:02:23,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 88. [2024-11-19 07:02:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 83 states have internal predecessors, (92), 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) [2024-11-19 07:02:23,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2024-11-19 07:02:23,497 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 33 [2024-11-19 07:02:23,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:23,497 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2024-11-19 07:02:23,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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) [2024-11-19 07:02:23,497 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2024-11-19 07:02:23,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 07:02:23,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:23,500 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:23,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 07:02:23,500 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:23,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:23,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1379691596, now seen corresponding path program 2 times [2024-11-19 07:02:23,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:23,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958793674] [2024-11-19 07:02:23,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:02:23,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:23,527 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 07:02:23,527 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:02:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 07:02:23,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:23,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958793674] [2024-11-19 07:02:23,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958793674] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:23,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092499932] [2024-11-19 07:02:23,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:02:23,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:23,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:23,597 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) [2024-11-19 07:02:23,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 07:02:23,726 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 07:02:23,727 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:02:23,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 07:02:23,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:23,750 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 07:02:23,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 07:02:23,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092499932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:23,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 07:02:23,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-19 07:02:23,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514520783] [2024-11-19 07:02:23,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:23,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 07:02:23,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:23,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 07:02:23,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:02:23,753 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) [2024-11-19 07:02:23,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:23,766 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2024-11-19 07:02:23,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 07:02:23,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 37 [2024-11-19 07:02:23,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:23,767 INFO L225 Difference]: With dead ends: 81 [2024-11-19 07:02:23,768 INFO L226 Difference]: Without dead ends: 81 [2024-11-19 07:02:23,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:02:23,769 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 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 [2024-11-19 07:02:23,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:02:23,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-19 07:02:23,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-19 07:02:23,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 77 states have internal predecessors, (84), 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) [2024-11-19 07:02:23,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2024-11-19 07:02:23,776 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 37 [2024-11-19 07:02:23,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:23,776 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2024-11-19 07:02:23,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) [2024-11-19 07:02:23,777 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2024-11-19 07:02:23,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 07:02:23,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:23,777 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-19 07:02:23,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 07:02:23,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:23,978 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:23,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:23,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1726822302, now seen corresponding path program 1 times [2024-11-19 07:02:23,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:23,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131265566] [2024-11-19 07:02:23,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:23,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:24,051 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 07:02:24,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:24,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131265566] [2024-11-19 07:02:24,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131265566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:24,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:24,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 07:02:24,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487323168] [2024-11-19 07:02:24,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:24,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 07:02:24,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:24,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 07:02:24,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 07:02:24,055 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) [2024-11-19 07:02:24,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:24,079 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2024-11-19 07:02:24,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 07:02:24,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 37 [2024-11-19 07:02:24,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:24,081 INFO L225 Difference]: With dead ends: 96 [2024-11-19 07:02:24,081 INFO L226 Difference]: Without dead ends: 96 [2024-11-19 07:02:24,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:02:24,082 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 16 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:24,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 221 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:02:24,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-19 07:02:24,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 82. [2024-11-19 07:02:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 78 states have internal predecessors, (85), 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) [2024-11-19 07:02:24,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2024-11-19 07:02:24,086 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 37 [2024-11-19 07:02:24,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:24,087 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2024-11-19 07:02:24,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) [2024-11-19 07:02:24,087 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2024-11-19 07:02:24,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 07:02:24,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:24,088 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-19 07:02:24,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 07:02:24,088 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:24,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:24,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1726822357, now seen corresponding path program 1 times [2024-11-19 07:02:24,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:24,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77078533] [2024-11-19 07:02:24,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:24,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:24,227 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 07:02:24,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:24,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77078533] [2024-11-19 07:02:24,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77078533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:24,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:24,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 07:02:24,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222509081] [2024-11-19 07:02:24,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:24,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 07:02:24,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:24,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 07:02:24,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:02:24,230 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:24,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:24,403 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2024-11-19 07:02:24,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 07:02:24,403 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-11-19 07:02:24,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:24,404 INFO L225 Difference]: With dead ends: 85 [2024-11-19 07:02:24,404 INFO L226 Difference]: Without dead ends: 85 [2024-11-19 07:02:24,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-19 07:02:24,405 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 34 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:24,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 384 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 07:02:24,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-19 07:02:24,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-19 07:02:24,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.467741935483871) internal successors, (91), 81 states have internal predecessors, (91), 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) [2024-11-19 07:02:24,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2024-11-19 07:02:24,407 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 37 [2024-11-19 07:02:24,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:24,408 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2024-11-19 07:02:24,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:24,408 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2024-11-19 07:02:24,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 07:02:24,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:24,409 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-19 07:02:24,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 07:02:24,409 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:24,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:24,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1726822356, now seen corresponding path program 1 times [2024-11-19 07:02:24,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:24,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217003377] [2024-11-19 07:02:24,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:24,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 07:02:24,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:24,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217003377] [2024-11-19 07:02:24,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217003377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:24,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131235682] [2024-11-19 07:02:24,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:24,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:24,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:24,533 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) [2024-11-19 07:02:24,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 07:02:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:24,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 07:02:24,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 07:02:24,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:24,767 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 07:02:24,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131235682] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:02:24,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:02:24,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-19 07:02:24,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513854521] [2024-11-19 07:02:24,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:24,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 07:02:24,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:24,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 07:02:24,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-19 07:02:24,770 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:24,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:24,820 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2024-11-19 07:02:24,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 07:02:24,820 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2024-11-19 07:02:24,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:24,821 INFO L225 Difference]: With dead ends: 132 [2024-11-19 07:02:24,821 INFO L226 Difference]: Without dead ends: 132 [2024-11-19 07:02:24,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:02:24,822 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 177 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:24,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 294 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:02:24,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-19 07:02:24,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 95. [2024-11-19 07:02:24,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 91 states have internal predecessors, (103), 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) [2024-11-19 07:02:24,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2024-11-19 07:02:24,825 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 37 [2024-11-19 07:02:24,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:24,825 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2024-11-19 07:02:24,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:24,826 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2024-11-19 07:02:24,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 07:02:24,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:24,826 INFO L215 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, 1, 1, 1] [2024-11-19 07:02:24,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 07:02:25,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 07:02:25,031 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:25,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:25,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1952024607, now seen corresponding path program 1 times [2024-11-19 07:02:25,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:25,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505005477] [2024-11-19 07:02:25,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:25,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:25,690 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:25,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:25,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505005477] [2024-11-19 07:02:25,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505005477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:25,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172221504] [2024-11-19 07:02:25,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:25,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:25,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:25,693 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) [2024-11-19 07:02:25,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 07:02:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:25,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-19 07:02:25,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:25,851 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 [2024-11-19 07:02:25,945 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:02:25,946 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 [2024-11-19 07:02:26,004 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 [2024-11-19 07:02:26,079 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:26,080 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 34 treesize of output 33 [2024-11-19 07:02:26,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:26,244 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 17 [2024-11-19 07:02:26,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 07:02:26,308 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:02:26,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:26,339 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= v_ArrVal_768 (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_768 .cse0))))))) is different from false [2024-11-19 07:02:26,459 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-11-19 07:02:26,459 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 19 treesize of output 18 [2024-11-19 07:02:26,463 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_767 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_767) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2024-11-19 07:02:26,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:26,534 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 18 treesize of output 19 [2024-11-19 07:02:26,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-19 07:02:26,542 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 5 treesize of output 3 [2024-11-19 07:02:26,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172221504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:26,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 07:02:26,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 31 [2024-11-19 07:02:26,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847993094] [2024-11-19 07:02:26,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:26,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 07:02:26,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:26,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 07:02:26,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1161, Unknown=14, NotChecked=138, Total=1406 [2024-11-19 07:02:26,617 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 32 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 07:02:27,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:27,303 INFO L93 Difference]: Finished difference Result 143 states and 168 transitions. [2024-11-19 07:02:27,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 07:02:27,303 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-11-19 07:02:27,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:27,305 INFO L225 Difference]: With dead ends: 143 [2024-11-19 07:02:27,305 INFO L226 Difference]: Without dead ends: 143 [2024-11-19 07:02:27,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=142, Invalid=1743, Unknown=15, NotChecked=170, Total=2070 [2024-11-19 07:02:27,306 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 116 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:27,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1079 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 07:02:27,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-19 07:02:27,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 105. [2024-11-19 07:02:27,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 101 states have internal predecessors, (118), 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) [2024-11-19 07:02:27,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2024-11-19 07:02:27,310 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 122 transitions. Word has length 38 [2024-11-19 07:02:27,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:27,310 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 122 transitions. [2024-11-19 07:02:27,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 28 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 07:02:27,311 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 122 transitions. [2024-11-19 07:02:27,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 07:02:27,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:27,311 INFO L215 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, 1, 1, 1] [2024-11-19 07:02:27,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 07:02:27,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-19 07:02:27,516 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:27,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:27,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1952024606, now seen corresponding path program 1 times [2024-11-19 07:02:27,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:27,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168726878] [2024-11-19 07:02:27,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:27,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:28,612 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:28,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:28,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168726878] [2024-11-19 07:02:28,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168726878] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:28,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025357239] [2024-11-19 07:02:28,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:28,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:28,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:28,614 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) [2024-11-19 07:02:28,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 07:02:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:28,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-19 07:02:28,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:28,761 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 8 treesize of output 1 [2024-11-19 07:02:28,764 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 [2024-11-19 07:02:28,915 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:02:28,916 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 [2024-11-19 07:02:28,922 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 14 treesize of output 9 [2024-11-19 07:02:28,997 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 [2024-11-19 07:02:29,002 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 [2024-11-19 07:02:29,106 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:29,106 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 50 treesize of output 45 [2024-11-19 07:02:29,112 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 24 treesize of output 11 [2024-11-19 07:02:29,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:29,306 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 27 treesize of output 11 [2024-11-19 07:02:29,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:29,313 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 17 [2024-11-19 07:02:29,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 07:02:29,387 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 7 treesize of output 3 [2024-11-19 07:02:29,397 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:02:29,397 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:29,610 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (and (forall ((v_ArrVal_869 (Array Int Int))) (or (not (= v_ArrVal_869 (store .cse0 .cse1 (select v_ArrVal_869 .cse1)))) (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_869) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_870 (Array Int Int))) (or (forall ((v_ArrVal_869 (Array Int Int))) (or (< (+ 7 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_869) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_870) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= v_ArrVal_869 (store .cse0 .cse1 (select v_ArrVal_869 .cse1)))))) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_870 .cse1)) v_ArrVal_870)))))) is different from false [2024-11-19 07:02:29,849 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_868 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_867) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_868 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_868) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2024-11-19 07:02:29,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:29,970 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 37 treesize of output 38 [2024-11-19 07:02:29,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:29,976 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 29 treesize of output 30 [2024-11-19 07:02:29,980 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 52 treesize of output 44 [2024-11-19 07:02:29,983 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 82 treesize of output 70 [2024-11-19 07:02:29,994 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 11 treesize of output 9 [2024-11-19 07:02:29,998 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 9 treesize of output 7 [2024-11-19 07:02:30,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:30,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-11-19 07:02:30,008 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:30,010 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 18 treesize of output 10 [2024-11-19 07:02:30,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025357239] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:30,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 07:02:30,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 32 [2024-11-19 07:02:30,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139376899] [2024-11-19 07:02:30,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:30,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-19 07:02:30,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:30,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-19 07:02:30,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1663, Unknown=25, NotChecked=166, Total=1980 [2024-11-19 07:02:30,228 INFO L87 Difference]: Start difference. First operand 105 states and 122 transitions. Second operand has 33 states, 32 states have (on average 1.8125) internal successors, (58), 29 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 07:02:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:30,975 INFO L93 Difference]: Finished difference Result 153 states and 181 transitions. [2024-11-19 07:02:30,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 07:02:30,976 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.8125) internal successors, (58), 29 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-11-19 07:02:30,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:30,977 INFO L225 Difference]: With dead ends: 153 [2024-11-19 07:02:30,977 INFO L226 Difference]: Without dead ends: 153 [2024-11-19 07:02:30,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=184, Invalid=2344, Unknown=30, NotChecked=198, Total=2756 [2024-11-19 07:02:30,978 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 79 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:30,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1192 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 07:02:30,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-19 07:02:30,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 113. [2024-11-19 07:02:30,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 109 states have internal predecessors, (129), 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) [2024-11-19 07:02:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2024-11-19 07:02:30,982 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 38 [2024-11-19 07:02:30,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:30,982 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2024-11-19 07:02:30,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.8125) internal successors, (58), 29 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 07:02:30,983 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2024-11-19 07:02:30,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 07:02:30,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:30,984 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:30,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 07:02:31,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-19 07:02:31,188 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:31,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:31,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1093777893, now seen corresponding path program 2 times [2024-11-19 07:02:31,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:31,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261531808] [2024-11-19 07:02:31,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:02:31,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:31,210 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 07:02:31,210 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:02:31,272 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 07:02:31,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:31,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261531808] [2024-11-19 07:02:31,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261531808] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:31,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444706052] [2024-11-19 07:02:31,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:02:31,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:31,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:31,275 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) [2024-11-19 07:02:31,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 07:02:31,445 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 07:02:31,446 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:02:31,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 07:02:31,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:31,483 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 07:02:31,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:31,523 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 07:02:31,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444706052] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:02:31,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:02:31,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-11-19 07:02:31,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402930495] [2024-11-19 07:02:31,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:31,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 07:02:31,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:31,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 07:02:31,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:02:31,526 INFO L87 Difference]: Start difference. First operand 113 states and 133 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:31,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:31,546 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2024-11-19 07:02:31,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 07:02:31,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2024-11-19 07:02:31,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:31,551 INFO L225 Difference]: With dead ends: 99 [2024-11-19 07:02:31,551 INFO L226 Difference]: Without dead ends: 99 [2024-11-19 07:02:31,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:02:31,552 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 24 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:31,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 177 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:02:31,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-19 07:02:31,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-19 07:02:31,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 95 states have internal predecessors, (108), 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) [2024-11-19 07:02:31,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2024-11-19 07:02:31,558 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 41 [2024-11-19 07:02:31,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:31,558 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2024-11-19 07:02:31,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:31,558 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2024-11-19 07:02:31,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 07:02:31,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:31,559 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:31,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 07:02:31,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:31,760 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:31,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:31,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1377321232, now seen corresponding path program 2 times [2024-11-19 07:02:31,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:31,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418453654] [2024-11-19 07:02:31,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:02:31,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:31,776 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 07:02:31,776 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:02:31,959 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 07:02:31,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:31,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418453654] [2024-11-19 07:02:31,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418453654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:31,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:31,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 07:02:31,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324934283] [2024-11-19 07:02:31,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:31,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 07:02:31,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:31,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 07:02:31,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:02:31,961 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:32,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:32,072 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2024-11-19 07:02:32,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 07:02:32,074 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2024-11-19 07:02:32,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:32,075 INFO L225 Difference]: With dead ends: 99 [2024-11-19 07:02:32,075 INFO L226 Difference]: Without dead ends: 99 [2024-11-19 07:02:32,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-19 07:02:32,076 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 28 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:32,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 433 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:02:32,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-19 07:02:32,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-19 07:02:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 95 states have internal predecessors, (105), 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) [2024-11-19 07:02:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2024-11-19 07:02:32,079 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 42 [2024-11-19 07:02:32,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:32,079 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2024-11-19 07:02:32,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:32,079 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2024-11-19 07:02:32,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 07:02:32,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:32,080 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:32,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 07:02:32,081 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:32,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:32,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1554940935, now seen corresponding path program 3 times [2024-11-19 07:02:32,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:32,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077945262] [2024-11-19 07:02:32,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 07:02:32,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:32,107 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 07:02:32,107 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:02:32,193 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 07:02:32,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:32,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077945262] [2024-11-19 07:02:32,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077945262] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:32,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959210506] [2024-11-19 07:02:32,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 07:02:32,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:32,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:32,196 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) [2024-11-19 07:02:32,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 07:02:32,407 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 07:02:32,408 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:02:32,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 07:02:32,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 07:02:32,460 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 07:02:32,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959210506] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:02:32,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:02:32,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2024-11-19 07:02:32,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936472689] [2024-11-19 07:02:32,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:32,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 07:02:32,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:32,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 07:02:32,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-19 07:02:32,516 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:32,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:32,579 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2024-11-19 07:02:32,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 07:02:32,580 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2024-11-19 07:02:32,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:32,580 INFO L225 Difference]: With dead ends: 93 [2024-11-19 07:02:32,581 INFO L226 Difference]: Without dead ends: 93 [2024-11-19 07:02:32,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 83 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-19 07:02:32,581 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 68 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:32,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 536 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:02:32,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-19 07:02:32,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2024-11-19 07:02:32,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 85 states have internal predecessors, (90), 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) [2024-11-19 07:02:32,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2024-11-19 07:02:32,584 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 46 [2024-11-19 07:02:32,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:32,584 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2024-11-19 07:02:32,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2024-11-19 07:02:32,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 07:02:32,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:32,585 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:32,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-19 07:02:32,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:32,786 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:32,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:32,786 INFO L85 PathProgramCache]: Analyzing trace with hash 667135142, now seen corresponding path program 1 times [2024-11-19 07:02:32,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:32,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410516097] [2024-11-19 07:02:32,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:32,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:34,304 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:34,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:34,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410516097] [2024-11-19 07:02:34,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410516097] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:34,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446938254] [2024-11-19 07:02:34,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:34,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:34,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:34,309 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:34,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 07:02:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:34,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-19 07:02:34,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:34,503 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 [2024-11-19 07:02:34,725 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:02:34,725 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 [2024-11-19 07:02:34,807 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 [2024-11-19 07:02:34,889 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:34,889 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 25 treesize of output 26 [2024-11-19 07:02:35,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-19 07:02:35,048 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 [2024-11-19 07:02:35,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-19 07:02:35,300 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 18 treesize of output 13 [2024-11-19 07:02:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:35,535 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:35,670 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1232 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1232) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2024-11-19 07:02:35,813 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1232 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1232) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2024-11-19 07:02:35,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:35,825 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 29 treesize of output 30 [2024-11-19 07:02:35,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:35,833 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 50 treesize of output 49 [2024-11-19 07:02:35,837 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 14 [2024-11-19 07:02:36,080 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1228 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1228) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2024-11-19 07:02:36,090 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1228 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1228) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) is different from false [2024-11-19 07:02:36,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:36,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-11-19 07:02:36,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-19 07:02:36,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-19 07:02:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2024-11-19 07:02:36,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446938254] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:02:36,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:02:36,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 27] total 74 [2024-11-19 07:02:36,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450653660] [2024-11-19 07:02:36,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:36,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-11-19 07:02:36,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:36,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-11-19 07:02:36,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=4574, Unknown=37, NotChecked=556, Total=5402 [2024-11-19 07:02:36,450 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 74 states, 73 states have (on average 1.6986301369863013) internal successors, (124), 66 states have internal predecessors, (124), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 07:02:38,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:38,269 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2024-11-19 07:02:38,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-19 07:02:38,269 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 73 states have (on average 1.6986301369863013) internal successors, (124), 66 states have internal predecessors, (124), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2024-11-19 07:02:38,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:38,270 INFO L225 Difference]: With dead ends: 89 [2024-11-19 07:02:38,270 INFO L226 Difference]: Without dead ends: 89 [2024-11-19 07:02:38,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1603 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=461, Invalid=7706, Unknown=39, NotChecked=724, Total=8930 [2024-11-19 07:02:38,274 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 192 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:38,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1884 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1398 Invalid, 0 Unknown, 232 Unchecked, 0.8s Time] [2024-11-19 07:02:38,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-19 07:02:38,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-19 07:02:38,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 85 states have internal predecessors, (89), 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) [2024-11-19 07:02:38,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2024-11-19 07:02:38,277 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 51 [2024-11-19 07:02:38,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:38,277 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2024-11-19 07:02:38,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 1.6986301369863013) internal successors, (124), 66 states have internal predecessors, (124), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 07:02:38,278 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2024-11-19 07:02:38,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 07:02:38,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:38,278 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:38,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-19 07:02:38,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:38,479 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:38,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:38,479 INFO L85 PathProgramCache]: Analyzing trace with hash 132747908, now seen corresponding path program 1 times [2024-11-19 07:02:38,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:38,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849371139] [2024-11-19 07:02:38,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:38,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:38,596 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-19 07:02:38,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:38,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849371139] [2024-11-19 07:02:38,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849371139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:38,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097685459] [2024-11-19 07:02:38,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:38,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:38,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:38,599 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:38,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 07:02:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:38,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 07:02:38,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:38,815 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-19 07:02:38,816 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:38,849 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-19 07:02:38,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097685459] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:02:38,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:02:38,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-11-19 07:02:38,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662178991] [2024-11-19 07:02:38,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:38,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 07:02:38,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:38,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 07:02:38,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:02:38,851 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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) [2024-11-19 07:02:38,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:38,898 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2024-11-19 07:02:38,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 07:02:38,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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 55 [2024-11-19 07:02:38,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:38,899 INFO L225 Difference]: With dead ends: 86 [2024-11-19 07:02:38,899 INFO L226 Difference]: Without dead ends: 86 [2024-11-19 07:02:38,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:02:38,900 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 26 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:38,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 327 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:02:38,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-19 07:02:38,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-19 07:02:38,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 82 states have internal predecessors, (85), 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) [2024-11-19 07:02:38,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2024-11-19 07:02:38,905 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 55 [2024-11-19 07:02:38,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:38,906 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2024-11-19 07:02:38,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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) [2024-11-19 07:02:38,906 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2024-11-19 07:02:38,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 07:02:38,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:38,906 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:38,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-19 07:02:39,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-19 07:02:39,107 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:39,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:39,108 INFO L85 PathProgramCache]: Analyzing trace with hash 132747853, now seen corresponding path program 1 times [2024-11-19 07:02:39,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:39,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814951820] [2024-11-19 07:02:39,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:39,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:40,029 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:02:40,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:40,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814951820] [2024-11-19 07:02:40,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814951820] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:40,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486511069] [2024-11-19 07:02:40,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:40,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:40,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:40,032 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:40,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 07:02:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:40,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-19 07:02:40,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:40,210 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 [2024-11-19 07:02:40,274 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:02:40,274 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 [2024-11-19 07:02:40,320 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 [2024-11-19 07:02:40,391 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:40,391 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 34 treesize of output 33 [2024-11-19 07:02:40,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:40,507 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 17 [2024-11-19 07:02:40,641 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:40,641 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 34 treesize of output 33 [2024-11-19 07:02:40,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 07:02:40,731 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 07:02:40,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:40,979 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int))) (or (not (= v_ArrVal_1445 (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_1445 .cse0))))) (= (select |c_#valid| (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1445))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1446)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1))) is different from false [2024-11-19 07:02:40,993 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| Int) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int))) (or (not (= v_ArrVal_1445 (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 (select v_ArrVal_1445 .cse0))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| |c_ULTIMATE.start_main_~s~0#1.offset|) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1445) (select v_ArrVal_1445 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1446) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1))) is different from false [2024-11-19 07:02:41,008 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| Int) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (not (= v_ArrVal_1445 (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse0 (select v_ArrVal_1445 .cse0))))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_ArrVal_1445) (select v_ArrVal_1445 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1446) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) 1))) is different from false [2024-11-19 07:02:41,021 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| Int) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1445) (select v_ArrVal_1445 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1446) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 1) (not (= (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_1445 .cse0))) v_ArrVal_1445)))) is different from false [2024-11-19 07:02:41,037 INFO L349 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2024-11-19 07:02:41,037 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 27 treesize of output 26 [2024-11-19 07:02:41,048 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| Int) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1444 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1444))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1445) (select v_ArrVal_1445 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1446) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= v_ArrVal_1445 (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| 4))) (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_1445 .cse1)))))))) is different from false [2024-11-19 07:02:41,077 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| Int) (v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1444 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1444))) (or (not (= (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| 4))) (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_1445 .cse1))) v_ArrVal_1445)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1445) (select v_ArrVal_1445 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1446) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_46| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) is different from false [2024-11-19 07:02:41,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:41,089 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 50 [2024-11-19 07:02:41,095 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 47 treesize of output 43 [2024-11-19 07:02:41,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:41,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2024-11-19 07:02:41,109 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:41,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:41,116 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2024-11-19 07:02:41,124 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 11 treesize of output 9 [2024-11-19 07:02:41,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 12 treesize of output 8 [2024-11-19 07:02:41,148 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:41,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-19 07:02:41,157 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 17 treesize of output 13 [2024-11-19 07:02:41,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486511069] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:41,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 07:02:41,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 37 [2024-11-19 07:02:41,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033213423] [2024-11-19 07:02:41,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:41,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-19 07:02:41,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:41,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-19 07:02:41,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1616, Unknown=72, NotChecked=522, Total=2352 [2024-11-19 07:02:41,232 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 38 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 34 states have internal predecessors, (88), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 07:02:41,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:41,821 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2024-11-19 07:02:41,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 07:02:41,822 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 34 states have internal predecessors, (88), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 55 [2024-11-19 07:02:41,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:41,823 INFO L225 Difference]: With dead ends: 85 [2024-11-19 07:02:41,823 INFO L226 Difference]: Without dead ends: 85 [2024-11-19 07:02:41,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=203, Invalid=2291, Unknown=80, NotChecked=618, Total=3192 [2024-11-19 07:02:41,825 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 41 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:41,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1118 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 07:02:41,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-19 07:02:41,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-19 07:02:41,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 81 states have internal predecessors, (84), 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) [2024-11-19 07:02:41,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2024-11-19 07:02:41,827 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 55 [2024-11-19 07:02:41,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:41,828 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2024-11-19 07:02:41,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 34 states have internal predecessors, (88), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 07:02:41,828 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2024-11-19 07:02:41,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 07:02:41,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:41,828 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:41,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-19 07:02:42,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-19 07:02:42,029 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:42,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:42,029 INFO L85 PathProgramCache]: Analyzing trace with hash 132747854, now seen corresponding path program 1 times [2024-11-19 07:02:42,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:42,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459739572] [2024-11-19 07:02:42,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:42,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:43,266 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:02:43,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:43,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459739572] [2024-11-19 07:02:43,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459739572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:43,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826944173] [2024-11-19 07:02:43,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:43,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:43,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:43,268 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:43,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-19 07:02:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:43,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-11-19 07:02:43,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:43,449 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 [2024-11-19 07:02:43,452 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 8 treesize of output 1 [2024-11-19 07:02:43,681 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:02:43,681 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 [2024-11-19 07:02:43,689 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 14 treesize of output 9 [2024-11-19 07:02:43,779 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 [2024-11-19 07:02:43,786 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 [2024-11-19 07:02:43,897 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:43,897 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 50 treesize of output 45 [2024-11-19 07:02:43,901 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 24 treesize of output 11 [2024-11-19 07:02:44,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:44,090 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 17 [2024-11-19 07:02:44,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:44,096 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 27 treesize of output 11 [2024-11-19 07:02:44,267 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:44,268 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 50 treesize of output 45 [2024-11-19 07:02:44,272 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 24 treesize of output 11 [2024-11-19 07:02:44,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 07:02:44,397 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 7 treesize of output 3 [2024-11-19 07:02:44,465 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 07:02:44,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:44,676 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1562 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1562) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1562) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1561) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2024-11-19 07:02:44,689 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1562 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1562) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (forall ((v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1562) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1561) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2024-11-19 07:02:44,699 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_1562 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1562) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (forall ((v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1562) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1561) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2024-11-19 07:02:44,866 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (and (forall ((v_ArrVal_1560 (Array Int Int))) (or (forall ((v_ArrVal_1559 (Array Int Int))) (or (forall ((v_ArrVal_1562 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1560) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1559) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1562) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (not (= (store .cse0 .cse1 (select v_ArrVal_1559 .cse1)) v_ArrVal_1559)))) (not (= v_ArrVal_1560 (store .cse2 .cse1 (select v_ArrVal_1560 .cse1)))))) (forall ((v_ArrVal_1560 (Array Int Int))) (or (forall ((v_ArrVal_1559 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_1559 .cse1)) v_ArrVal_1559)) (forall ((v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1559))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1560) .cse3 v_ArrVal_1562) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1561) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) (not (= v_ArrVal_1560 (store .cse2 .cse1 (select v_ArrVal_1560 .cse1)))))))) is different from false [2024-11-19 07:02:44,935 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| Int)) (or (< 0 (+ 5 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1560) (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1562) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (= v_ArrVal_1560 (let ((.cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| 4))) (store .cse1 .cse2 (select v_ArrVal_1560 .cse2))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_1560 (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| 4))) (or (forall ((v_ArrVal_1559 (Array Int Int))) (or (not (= v_ArrVal_1559 (store .cse0 .cse3 (select v_ArrVal_1559 .cse3)))) (forall ((v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (let ((.cse4 (select v_ArrVal_1559 |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1560) .cse4 v_ArrVal_1562) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1559) .cse4 v_ArrVal_1561) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) (not (= v_ArrVal_1560 (store .cse1 .cse3 (select v_ArrVal_1560 .cse3))))))))))) is different from false [2024-11-19 07:02:44,968 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (and (forall ((v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| Int)) (or (not (= v_ArrVal_1560 (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| 4))) (store .cse0 .cse1 (select v_ArrVal_1560 .cse1))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (< 0 (+ 5 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_ArrVal_1560) (select .cse2 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1562) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| Int)) (or (forall ((v_ArrVal_1560 (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| 4))) (or (not (= v_ArrVal_1560 (store .cse0 .cse3 (select v_ArrVal_1560 .cse3)))) (forall ((v_ArrVal_1559 (Array Int Int))) (or (not (= (store .cse2 .cse3 (select v_ArrVal_1559 .cse3)) v_ArrVal_1559)) (forall ((v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (let ((.cse4 (select v_ArrVal_1559 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_ArrVal_1560) .cse4 v_ArrVal_1562) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_ArrVal_1559) .cse4 v_ArrVal_1561) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))) is different from false [2024-11-19 07:02:45,003 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_1560 (Array Int Int))) (let ((.cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| 4))) (or (forall ((v_ArrVal_1559 (Array Int Int))) (or (forall ((v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (let ((.cse0 (select v_ArrVal_1559 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1560) .cse0 v_ArrVal_1562) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1559) .cse0 v_ArrVal_1561) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (not (= (store .cse1 .cse2 (select v_ArrVal_1559 .cse2)) v_ArrVal_1559)))) (not (= (store .cse3 .cse2 (select v_ArrVal_1560 .cse2)) v_ArrVal_1560))))))) (forall ((v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| Int)) (or (< 0 (+ 5 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1560) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1562) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= (let ((.cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| 4))) (store .cse3 .cse4 (select v_ArrVal_1560 .cse4))) v_ArrVal_1560)))))) is different from false [2024-11-19 07:02:45,059 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1557))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| 4))) (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_1560 .cse1))) v_ArrVal_1560)) (< 0 (+ 5 (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1560) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1558) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1562) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| Int)) (or (forall ((v_ArrVal_1560 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1557)) (.cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| 4))) (or (not (= (store (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_1560 .cse3)) v_ArrVal_1560)) (forall ((v_ArrVal_1559 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1558))) (or (forall ((v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (let ((.cse4 (select v_ArrVal_1559 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (<= (+ 8 (select (select (store (store .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1560) .cse4 v_ArrVal_1562) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store (store .cse5 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1559) .cse4 v_ArrVal_1561) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (not (= (store (select .cse5 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_1559 .cse3)) v_ArrVal_1559)))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2024-11-19 07:02:45,133 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1560 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1557))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (not (= (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| 4))) (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_1560 .cse1))) v_ArrVal_1560)) (< 0 (+ 5 (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1560) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1558) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1562) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))) (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_1560 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1557)) (.cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_53| 4))) (or (forall ((v_ArrVal_1559 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1558))) (or (not (= v_ArrVal_1559 (store (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3 (select v_ArrVal_1559 .cse3)))) (forall ((v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (let ((.cse5 (select v_ArrVal_1559 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (<= (+ (select (select (store (store .cse4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1560) .cse5 v_ArrVal_1562) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 8) (select |c_#length| (select (select (store (store .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1559) .cse5 v_ArrVal_1561) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))))) (not (= (store (select .cse4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3 (select v_ArrVal_1560 .cse3)) v_ArrVal_1560)))))))) is different from false [2024-11-19 07:02:45,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:45,160 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 33 treesize of output 34 [2024-11-19 07:02:45,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:45,171 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 64 treesize of output 64 [2024-11-19 07:02:45,177 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 47 treesize of output 43 [2024-11-19 07:02:45,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:45,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2024-11-19 07:02:45,193 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:45,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:45,199 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2024-11-19 07:02:45,210 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 70 treesize of output 58 [2024-11-19 07:02:45,218 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 54 treesize of output 50 [2024-11-19 07:02:45,224 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 24 treesize of output 22 [2024-11-19 07:02:45,241 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 12 treesize of output 8 [2024-11-19 07:02:45,260 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:45,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2024-11-19 07:02:45,266 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 23 treesize of output 19 [2024-11-19 07:02:45,277 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:45,278 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:45,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:45,283 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 51 treesize of output 51 [2024-11-19 07:02:45,287 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:45,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:45,293 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 62 treesize of output 62 [2024-11-19 07:02:45,300 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 17 treesize of output 15 [2024-11-19 07:02:45,308 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:45,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2024-11-19 07:02:45,314 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:45,317 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 40 treesize of output 34 [2024-11-19 07:02:45,328 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:45,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2024-11-19 07:02:45,336 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:45,339 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 36 treesize of output 28 [2024-11-19 07:02:45,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826944173] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:45,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 07:02:45,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 45 [2024-11-19 07:02:45,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870483485] [2024-11-19 07:02:45,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:45,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-19 07:02:45,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:45,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-19 07:02:45,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2674, Unknown=32, NotChecked=1008, Total=3906 [2024-11-19 07:02:45,596 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 46 states, 45 states have (on average 2.1777777777777776) internal successors, (98), 41 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 07:02:46,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:46,390 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2024-11-19 07:02:46,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 07:02:46,390 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.1777777777777776) internal successors, (98), 41 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 55 [2024-11-19 07:02:46,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:46,391 INFO L225 Difference]: With dead ends: 84 [2024-11-19 07:02:46,391 INFO L226 Difference]: Without dead ends: 84 [2024-11-19 07:02:46,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=270, Invalid=3516, Unknown=32, NotChecked=1152, Total=4970 [2024-11-19 07:02:46,392 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 49 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:46,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1339 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 07:02:46,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-19 07:02:46,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2024-11-19 07:02:46,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 79 states have internal predecessors, (82), 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) [2024-11-19 07:02:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2024-11-19 07:02:46,395 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 55 [2024-11-19 07:02:46,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:46,396 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2024-11-19 07:02:46,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.1777777777777776) internal successors, (98), 41 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 07:02:46,396 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2024-11-19 07:02:46,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-19 07:02:46,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:46,396 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:46,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-19 07:02:46,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-19 07:02:46,597 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:46,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:46,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1967923759, now seen corresponding path program 1 times [2024-11-19 07:02:46,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:46,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060979056] [2024-11-19 07:02:46,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:46,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-19 07:02:46,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:46,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060979056] [2024-11-19 07:02:46,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060979056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:46,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032494322] [2024-11-19 07:02:46,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:46,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:46,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:46,684 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:46,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-19 07:02:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:46,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 07:02:46,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:46,944 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-19 07:02:46,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:46,977 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-19 07:02:46,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032494322] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:02:46,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:02:46,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-19 07:02:46,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158198612] [2024-11-19 07:02:46,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:46,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:02:46,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:46,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:02:46,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:02:46,980 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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) [2024-11-19 07:02:47,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:47,018 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2024-11-19 07:02:47,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 07:02:47,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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 58 [2024-11-19 07:02:47,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:47,019 INFO L225 Difference]: With dead ends: 83 [2024-11-19 07:02:47,019 INFO L226 Difference]: Without dead ends: 83 [2024-11-19 07:02:47,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:02:47,020 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 44 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:47,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 211 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:02:47,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-19 07:02:47,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-19 07:02:47,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 79 states have internal predecessors, (81), 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) [2024-11-19 07:02:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2024-11-19 07:02:47,023 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 58 [2024-11-19 07:02:47,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:47,024 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2024-11-19 07:02:47,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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) [2024-11-19 07:02:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2024-11-19 07:02:47,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-19 07:02:47,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:47,025 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:47,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-19 07:02:47,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-19 07:02:47,230 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:47,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:47,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1474497120, now seen corresponding path program 1 times [2024-11-19 07:02:47,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:47,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391072697] [2024-11-19 07:02:47,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:47,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:49,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:49,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391072697] [2024-11-19 07:02:49,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391072697] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:49,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20158077] [2024-11-19 07:02:49,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:49,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:49,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:49,057 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:49,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-19 07:02:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:49,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-19 07:02:49,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:49,282 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 [2024-11-19 07:02:49,451 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:02:49,451 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 [2024-11-19 07:02:49,516 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 [2024-11-19 07:02:49,633 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:49,633 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 25 treesize of output 26 [2024-11-19 07:02:49,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:49,850 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 28 treesize of output 12 [2024-11-19 07:02:49,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 07:02:50,158 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:50,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 59 [2024-11-19 07:02:50,164 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 25 treesize of output 17 [2024-11-19 07:02:50,168 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 [2024-11-19 07:02:50,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-19 07:02:50,453 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 [2024-11-19 07:02:50,708 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:50,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:51,021 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 76 treesize of output 56 [2024-11-19 07:02:51,029 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1781 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1781) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_1779 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1779) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) is different from false [2024-11-19 07:02:51,045 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (forall ((v_ArrVal_1781 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1781) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|)) (forall ((v_ArrVal_1779 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1779) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|))) is different from false [2024-11-19 07:02:51,182 WARN L851 $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_ArrVal_1781 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1781) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0)) (forall ((v_ArrVal_1779 (Array Int Int))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1779) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2024-11-19 07:02:51,191 WARN L851 $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 (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_1781 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1781) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0)) (forall ((v_ArrVal_1779 (Array Int Int))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1779) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2024-11-19 07:02:51,201 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 205 treesize of output 189 [2024-11-19 07:02:51,204 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 77 treesize of output 73 [2024-11-19 07:02:51,207 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 73 treesize of output 71 [2024-11-19 07:02:51,227 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_1777 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1777) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_1777 .cse0))) v_ArrVal_1777))))) is different from false [2024-11-19 07:02:51,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:51,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-11-19 07:02:51,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-19 07:02:51,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-19 07:02:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2024-11-19 07:02:52,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20158077] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:02:52,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:02:52,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 31, 31] total 87 [2024-11-19 07:02:52,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028036728] [2024-11-19 07:02:52,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:52,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2024-11-19 07:02:52,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:52,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2024-11-19 07:02:52,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=6326, Unknown=75, NotChecked=820, Total=7482 [2024-11-19 07:02:52,071 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand has 87 states, 85 states have (on average 1.8235294117647058) internal successors, (155), 79 states have internal predecessors, (155), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 07:02:54,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:54,348 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2024-11-19 07:02:54,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-19 07:02:54,350 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 85 states have (on average 1.8235294117647058) internal successors, (155), 79 states have internal predecessors, (155), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 61 [2024-11-19 07:02:54,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:54,350 INFO L225 Difference]: With dead ends: 79 [2024-11-19 07:02:54,350 INFO L226 Difference]: Without dead ends: 79 [2024-11-19 07:02:54,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2667 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=544, Invalid=10954, Unknown=78, NotChecked=1080, Total=12656 [2024-11-19 07:02:54,354 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 77 mSDsluCounter, 2075 mSDsCounter, 0 mSdLazyCounter, 1964 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 2121 SdHoareTripleChecker+Invalid, 2236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 259 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:54,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 2121 Invalid, 2236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1964 Invalid, 0 Unknown, 259 Unchecked, 0.9s Time] [2024-11-19 07:02:54,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-19 07:02:54,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-19 07:02:54,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 75 states have internal predecessors, (77), 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) [2024-11-19 07:02:54,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2024-11-19 07:02:54,357 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 61 [2024-11-19 07:02:54,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:54,357 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2024-11-19 07:02:54,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 85 states have (on average 1.8235294117647058) internal successors, (155), 79 states have internal predecessors, (155), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 07:02:54,358 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2024-11-19 07:02:54,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 07:02:54,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:54,358 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:54,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-19 07:02:54,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:54,559 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:54,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:54,560 INFO L85 PathProgramCache]: Analyzing trace with hash -334230315, now seen corresponding path program 1 times [2024-11-19 07:02:54,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:54,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058286744] [2024-11-19 07:02:54,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:54,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 07:02:54,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:54,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058286744] [2024-11-19 07:02:54,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058286744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:54,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:54,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 07:02:54,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080117545] [2024-11-19 07:02:54,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:54,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 07:02:54,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:54,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 07:02:54,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:02:54,739 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:54,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:54,887 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2024-11-19 07:02:54,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 07:02:54,887 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2024-11-19 07:02:54,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:54,888 INFO L225 Difference]: With dead ends: 93 [2024-11-19 07:02:54,888 INFO L226 Difference]: Without dead ends: 93 [2024-11-19 07:02:54,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:02:54,888 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 17 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:54,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 266 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:02:54,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-19 07:02:54,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2024-11-19 07:02:54,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 78 states have internal predecessors, (83), 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) [2024-11-19 07:02:54,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2024-11-19 07:02:54,892 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 63 [2024-11-19 07:02:54,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:54,892 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2024-11-19 07:02:54,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:54,892 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2024-11-19 07:02:54,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 07:02:54,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:54,893 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:54,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 07:02:54,893 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:54,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:54,893 INFO L85 PathProgramCache]: Analyzing trace with hash -334230314, now seen corresponding path program 1 times [2024-11-19 07:02:54,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:54,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17049853] [2024-11-19 07:02:54,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:54,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 07:02:55,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:55,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17049853] [2024-11-19 07:02:55,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17049853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:55,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:55,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 07:02:55,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823528102] [2024-11-19 07:02:55,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:55,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 07:02:55,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:55,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 07:02:55,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:02:55,177 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:55,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:55,315 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-11-19 07:02:55,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 07:02:55,315 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2024-11-19 07:02:55,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:55,316 INFO L225 Difference]: With dead ends: 80 [2024-11-19 07:02:55,316 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 07:02:55,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:02:55,317 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:55,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 300 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:02:55,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 07:02:55,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-19 07:02:55,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 76 states have internal predecessors, (80), 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) [2024-11-19 07:02:55,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-11-19 07:02:55,320 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 63 [2024-11-19 07:02:55,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:55,321 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-11-19 07:02:55,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:55,321 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-11-19 07:02:55,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 07:02:55,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:55,321 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:55,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 07:02:55,322 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:55,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:55,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1771171289, now seen corresponding path program 1 times [2024-11-19 07:02:55,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:55,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404076647] [2024-11-19 07:02:55,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:55,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:55,457 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 07:02:55,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:55,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404076647] [2024-11-19 07:02:55,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404076647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:55,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:55,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 07:02:55,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124535834] [2024-11-19 07:02:55,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:55,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 07:02:55,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:55,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 07:02:55,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:02:55,461 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:55,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:55,553 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2024-11-19 07:02:55,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 07:02:55,553 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 64 [2024-11-19 07:02:55,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:55,554 INFO L225 Difference]: With dead ends: 80 [2024-11-19 07:02:55,554 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 07:02:55,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:02:55,555 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 17 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:55,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 354 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:02:55,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 07:02:55,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-19 07:02:55,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.144927536231884) internal successors, (79), 76 states have internal predecessors, (79), 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) [2024-11-19 07:02:55,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2024-11-19 07:02:55,557 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 64 [2024-11-19 07:02:55,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:55,557 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2024-11-19 07:02:55,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2024-11-19 07:02:55,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 07:02:55,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:55,562 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:55,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 07:02:55,562 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:55,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:55,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1321041315, now seen corresponding path program 1 times [2024-11-19 07:02:55,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:55,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975751160] [2024-11-19 07:02:55,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:55,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:55,770 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 07:02:55,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:55,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975751160] [2024-11-19 07:02:55,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975751160] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:55,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448314566] [2024-11-19 07:02:55,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:55,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:55,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:55,773 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:55,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-19 07:02:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:56,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-19 07:02:56,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:56,025 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 [2024-11-19 07:02:56,142 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:02:56,143 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 [2024-11-19 07:02:56,186 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 [2024-11-19 07:02:56,236 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:56,236 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 34 treesize of output 33 [2024-11-19 07:02:56,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:56,337 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 17 [2024-11-19 07:02:56,463 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:56,463 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 34 treesize of output 33 [2024-11-19 07:02:56,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 07:02:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 07:02:56,580 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:56,621 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2048 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2048) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2024-11-19 07:02:56,778 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2047 (Array Int Int))) (or (not (= v_ArrVal_2047 (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_2047 .cse0))))) (= (select |c_#valid| (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2047))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2048)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1))) is different from false [2024-11-19 07:02:56,797 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| Int) (v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2047 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (= (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 (select v_ArrVal_2047 .cse0))) v_ArrVal_2047)) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2047) (select v_ArrVal_2047 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2048) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1))) is different from false [2024-11-19 07:02:56,810 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| Int) (v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2047 (Array Int Int))) (or (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_ArrVal_2047) (select v_ArrVal_2047 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_2048) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) 1) (not (= (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse0 (select v_ArrVal_2047 .cse0))) v_ArrVal_2047)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) is different from false [2024-11-19 07:02:56,821 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| Int) (v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2047 (Array Int Int))) (or (not (= v_ArrVal_2047 (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_2047 .cse0))))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_2047) (select v_ArrVal_2047 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2048) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 1) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2024-11-19 07:02:56,836 INFO L349 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2024-11-19 07:02:56,837 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 27 treesize of output 26 [2024-11-19 07:02:56,848 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| Int) (v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2047 (Array Int Int)) (v_ArrVal_2046 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2046))) (or (not (= (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| 4))) (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_2047 .cse1))) v_ArrVal_2047)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_2047) (select v_ArrVal_2047 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2048) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) is different from false [2024-11-19 07:02:56,873 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| Int) (v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2047 (Array Int Int)) (v_ArrVal_2046 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2046))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_2047) (select v_ArrVal_2047 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2048) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (not (= v_ArrVal_2047 (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| 4))) (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_2047 .cse1))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_68| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) is different from false [2024-11-19 07:02:56,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:56,882 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 50 [2024-11-19 07:02:56,886 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 47 treesize of output 43 [2024-11-19 07:02:56,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:56,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2024-11-19 07:02:56,898 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:56,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:56,904 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2024-11-19 07:02:56,910 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 11 treesize of output 9 [2024-11-19 07:02:56,922 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 12 treesize of output 8 [2024-11-19 07:02:56,933 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-19 07:02:56,935 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 19 treesize of output 13 [2024-11-19 07:02:56,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448314566] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:56,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 07:02:56,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 22] total 27 [2024-11-19 07:02:57,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656047988] [2024-11-19 07:02:57,000 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:57,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-19 07:02:57,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:57,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 07:02:57,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=876, Unknown=50, NotChecked=462, Total=1482 [2024-11-19 07:02:57,001 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 28 states, 27 states have (on average 3.6666666666666665) internal successors, (99), 25 states have internal predecessors, (99), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:57,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:57,438 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-11-19 07:02:57,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 07:02:57,438 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.6666666666666665) internal successors, (99), 25 states have internal predecessors, (99), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 66 [2024-11-19 07:02:57,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:57,439 INFO L225 Difference]: With dead ends: 87 [2024-11-19 07:02:57,439 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 07:02:57,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=1322, Unknown=58, NotChecked=560, Total=2070 [2024-11-19 07:02:57,440 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 33 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:57,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 600 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 07:02:57,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 07:02:57,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2024-11-19 07:02:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.1428571428571428) internal successors, (80), 76 states have internal predecessors, (80), 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) [2024-11-19 07:02:57,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-11-19 07:02:57,442 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 66 [2024-11-19 07:02:57,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:57,443 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-11-19 07:02:57,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.6666666666666665) internal successors, (99), 25 states have internal predecessors, (99), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:57,443 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-11-19 07:02:57,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 07:02:57,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:57,443 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:57,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-19 07:02:57,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:57,648 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:57,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:57,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1321041314, now seen corresponding path program 1 times [2024-11-19 07:02:57,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:57,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771395312] [2024-11-19 07:02:57,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:57,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:02:58,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:58,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771395312] [2024-11-19 07:02:58,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771395312] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:58,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984902164] [2024-11-19 07:02:58,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:58,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:58,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:58,879 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:58,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-19 07:02:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:59,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-11-19 07:02:59,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:59,121 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 [2024-11-19 07:02:59,201 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:02:59,201 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 [2024-11-19 07:02:59,266 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 [2024-11-19 07:02:59,270 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 [2024-11-19 07:02:59,364 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:59,364 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 50 treesize of output 45 [2024-11-19 07:02:59,368 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 24 treesize of output 11 [2024-11-19 07:02:59,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:59,527 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 17 [2024-11-19 07:02:59,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:59,533 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 27 treesize of output 11 [2024-11-19 07:02:59,713 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:59,714 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 50 treesize of output 45 [2024-11-19 07:02:59,719 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 24 treesize of output 11 [2024-11-19 07:02:59,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 07:02:59,900 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 7 treesize of output 3 [2024-11-19 07:02:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 07:02:59,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:00,112 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2161) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_2162 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2024-11-19 07:03:00,120 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2162 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2161) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2024-11-19 07:03:00,126 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_2162 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2162) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2162) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2161) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2024-11-19 07:03:00,244 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (and (forall ((v_ArrVal_2159 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_2159 .cse1)) v_ArrVal_2159)) (forall ((v_ArrVal_2160 (Array Int Int))) (or (forall ((v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2159))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2160) .cse2 v_ArrVal_2162) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2161) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (not (= (store .cse4 .cse1 (select v_ArrVal_2160 .cse1)) v_ArrVal_2160)))))) (forall ((v_ArrVal_2159 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_2159 .cse1)) v_ArrVal_2159)) (forall ((v_ArrVal_2160 (Array Int Int))) (or (not (= (store .cse4 .cse1 (select v_ArrVal_2160 .cse1)) v_ArrVal_2160)) (forall ((v_ArrVal_2162 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2160) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2159) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2162) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))))) is different from false [2024-11-19 07:03:00,300 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((v_ArrVal_2160 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| Int)) (or (not (= v_ArrVal_2160 (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| 4))) (store .cse0 .cse1 (select v_ArrVal_2160 .cse1))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| |c_ULTIMATE.start_main_~s~0#1.offset|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2160) (select .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2162) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 1)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| Int)) (or (forall ((v_ArrVal_2159 (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| 4))) (or (not (= v_ArrVal_2159 (store .cse2 .cse3 (select v_ArrVal_2159 .cse3)))) (forall ((v_ArrVal_2160 (Array Int Int))) (or (not (= v_ArrVal_2160 (store .cse0 .cse3 (select v_ArrVal_2160 .cse3)))) (forall ((v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (let ((.cse4 (select v_ArrVal_2159 |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2160) .cse4 v_ArrVal_2162) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2159) .cse4 v_ArrVal_2161) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2024-11-19 07:03:00,330 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (forall ((v_ArrVal_2159 (Array Int Int))) (let ((.cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| 4))) (or (forall ((v_ArrVal_2160 (Array Int Int))) (or (forall ((v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (let ((.cse0 (select v_ArrVal_2159 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_ArrVal_2160) .cse0 v_ArrVal_2162) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_ArrVal_2159) .cse0 v_ArrVal_2161) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))) (not (= (store .cse1 .cse2 (select v_ArrVal_2160 .cse2)) v_ArrVal_2160)))) (not (= v_ArrVal_2159 (store .cse3 .cse2 (select v_ArrVal_2159 .cse2))))))))) (forall ((v_ArrVal_2160 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| Int)) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_ArrVal_2160) (select .cse3 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_2162) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 1)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (not (= (let ((.cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| 4))) (store .cse1 .cse4 (select v_ArrVal_2160 .cse4))) v_ArrVal_2160)))))) is different from false [2024-11-19 07:03:00,351 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (forall ((v_ArrVal_2160 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| Int)) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_2160) (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2162) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 1)) (not (= (let ((.cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| 4))) (store .cse1 .cse2 (select v_ArrVal_2160 .cse2))) v_ArrVal_2160)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| Int)) (or (forall ((v_ArrVal_2159 (Array Int Int))) (let ((.cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| 4))) (or (forall ((v_ArrVal_2160 (Array Int Int))) (or (not (= (store .cse1 .cse3 (select v_ArrVal_2160 .cse3)) v_ArrVal_2160)) (forall ((v_ArrVal_2162 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (let ((.cse4 (select v_ArrVal_2159 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_2160) .cse4 v_ArrVal_2162) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_2159) .cse4 v_ArrVal_2161) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (not (= v_ArrVal_2159 (store .cse0 .cse3 (select v_ArrVal_2159 .cse3))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2024-11-19 07:03:00,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:00,373 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 133 treesize of output 137 [2024-11-19 07:03:00,493 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_18 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int)) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_17))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_prenex_15) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_16) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 1)) (not (= (let ((.cse1 (+ v_prenex_19 4))) (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 (select v_prenex_15 .cse1))) v_prenex_15)) (< v_prenex_19 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| Int)) (or (forall ((v_ArrVal_2159 (Array Int Int)) (v_ArrVal_2158 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2158))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store (store .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_2159) (select v_ArrVal_2159 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2161) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= (let ((.cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| 4))) (store (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3 (select v_ArrVal_2159 .cse3))) v_ArrVal_2159))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| Int)) (or (forall ((v_ArrVal_2160 (Array Int Int)) (v_ArrVal_2157 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2157))) (or (not (= (let ((.cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| 4))) (store (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_2160 .cse5))) v_ArrVal_2160)) (forall ((v_ArrVal_2158 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (< (select (select (store (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_2160) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2158) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2162) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 1)))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2024-11-19 07:03:00,564 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_18 (Array Int Int)) (v_prenex_19 Int) (v_prenex_17 (Array Int Int)) (v_prenex_16 (Array Int Int)) (v_prenex_15 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_17))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_15) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_16) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_prenex_18) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 1)) (not (= v_prenex_15 (let ((.cse1 (+ v_prenex_19 4))) (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 (select v_prenex_15 .cse1))))) (< v_prenex_19 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| Int)) (or (forall ((v_ArrVal_2160 (Array Int Int)) (v_ArrVal_2157 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2157))) (or (forall ((v_ArrVal_2158 (Array Int Int)) (v_ArrVal_2162 (Array Int Int))) (< (select (select (store (store .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_2160) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2158) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2162) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 1))) (not (= v_ArrVal_2160 (let ((.cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| 4))) (store (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3 (select v_ArrVal_2160 .cse3)))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_2159 (Array Int Int)) (v_ArrVal_2158 (Array Int Int)) (v_ArrVal_2161 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2158))) (or (not (= v_ArrVal_2159 (let ((.cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_75| 4))) (store (select .cse4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse5 (select v_ArrVal_2159 .cse5))))) (= (select (select (store (store .cse4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_2159) (select v_ArrVal_2159 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2161) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))))))) is different from false [2024-11-19 07:03:00,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:00,581 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 33 treesize of output 34 [2024-11-19 07:03:00,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:00,589 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 64 treesize of output 64 [2024-11-19 07:03:00,594 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 66 treesize of output 54 [2024-11-19 07:03:00,599 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 50 treesize of output 46 [2024-11-19 07:03:00,609 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 59 treesize of output 55 [2024-11-19 07:03:00,612 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:00,614 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 50 treesize of output 46 [2024-11-19 07:03:00,618 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:00,620 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 36 treesize of output 34 [2024-11-19 07:03:00,624 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 22 treesize of output 20 [2024-11-19 07:03:00,638 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:00,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:00,643 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 50 treesize of output 50 [2024-11-19 07:03:00,646 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:00,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-19 07:03:00,656 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:00,658 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 30 treesize of output 22 [2024-11-19 07:03:00,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:00,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2024-11-19 07:03:00,672 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:00,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:00,677 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 64 treesize of output 64 [2024-11-19 07:03:00,680 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:00,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-19 07:03:00,685 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:00,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-19 07:03:00,692 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:00,695 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 14 treesize of output 10 [2024-11-19 07:03:00,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984902164] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:00,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 07:03:00,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 22] total 42 [2024-11-19 07:03:00,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108570701] [2024-11-19 07:03:00,861 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:00,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-19 07:03:00,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:00,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-19 07:03:00,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2365, Unknown=32, NotChecked=954, Total=3540 [2024-11-19 07:03:00,863 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 43 states, 42 states have (on average 2.4047619047619047) internal successors, (101), 39 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 07:03:01,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:01,361 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2024-11-19 07:03:01,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 07:03:01,362 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.4047619047619047) internal successors, (101), 39 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 66 [2024-11-19 07:03:01,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:01,363 INFO L225 Difference]: With dead ends: 82 [2024-11-19 07:03:01,363 INFO L226 Difference]: Without dead ends: 82 [2024-11-19 07:03:01,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=242, Invalid=3067, Unknown=33, NotChecked=1080, Total=4422 [2024-11-19 07:03:01,364 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 40 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:01,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 826 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 07:03:01,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-19 07:03:01,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-19 07:03:01,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.125) internal successors, (81), 78 states have internal predecessors, (81), 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) [2024-11-19 07:03:01,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2024-11-19 07:03:01,366 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 66 [2024-11-19 07:03:01,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:01,366 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2024-11-19 07:03:01,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.4047619047619047) internal successors, (101), 39 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 07:03:01,367 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2024-11-19 07:03:01,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 07:03:01,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:01,367 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:01,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-19 07:03:01,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:01,568 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:03:01,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:01,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1997390812, now seen corresponding path program 1 times [2024-11-19 07:03:01,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:01,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982716987] [2024-11-19 07:03:01,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:01,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:01,747 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 07:03:01,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:01,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982716987] [2024-11-19 07:03:01,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982716987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:01,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:01,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 07:03:01,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256206049] [2024-11-19 07:03:01,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:01,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 07:03:01,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:01,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 07:03:01,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:03:01,749 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:03:01,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:01,868 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2024-11-19 07:03:01,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 07:03:01,869 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2024-11-19 07:03:01,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:01,870 INFO L225 Difference]: With dead ends: 81 [2024-11-19 07:03:01,870 INFO L226 Difference]: Without dead ends: 81 [2024-11-19 07:03:01,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:03:01,870 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 11 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:01,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 300 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:01,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-19 07:03:01,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-19 07:03:01,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 77 states have internal predecessors, (79), 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) [2024-11-19 07:03:01,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2024-11-19 07:03:01,874 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 67 [2024-11-19 07:03:01,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:01,874 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2024-11-19 07:03:01,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:03:01,875 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2024-11-19 07:03:01,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-19 07:03:01,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:01,875 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:01,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 07:03:01,876 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:03:01,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:01,876 INFO L85 PathProgramCache]: Analyzing trace with hash -356388511, now seen corresponding path program 1 times [2024-11-19 07:03:01,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:01,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134552389] [2024-11-19 07:03:01,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:01,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:02,813 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 07:03:02,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:02,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134552389] [2024-11-19 07:03:02,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134552389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:02,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464050002] [2024-11-19 07:03:02,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:02,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:02,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:02,814 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:02,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-19 07:03:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:03,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-19 07:03:03,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:03,058 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 [2024-11-19 07:03:03,098 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 5 treesize of output 3 [2024-11-19 07:03:03,160 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:03:03,160 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 [2024-11-19 07:03:03,224 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 [2024-11-19 07:03:03,302 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:03:03,302 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 34 treesize of output 33 [2024-11-19 07:03:03,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:03,448 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 17 [2024-11-19 07:03:03,594 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:03:03,594 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 34 treesize of output 33 [2024-11-19 07:03:03,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 07:03:03,755 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 07:03:03,755 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:04,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:04,641 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 50 [2024-11-19 07:03:04,644 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 47 treesize of output 43 [2024-11-19 07:03:04,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:04,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2024-11-19 07:03:04,652 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:04,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:04,656 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2024-11-19 07:03:04,660 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 13 treesize of output 11 [2024-11-19 07:03:04,669 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 12 treesize of output 8 [2024-11-19 07:03:04,673 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:04,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-19 07:03:04,680 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 25 treesize of output 19 [2024-11-19 07:03:04,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464050002] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:04,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 07:03:04,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 41 [2024-11-19 07:03:04,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937041670] [2024-11-19 07:03:04,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:04,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-19 07:03:04,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:04,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-19 07:03:04,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=3072, Unknown=20, NotChecked=0, Total=3306 [2024-11-19 07:03:04,851 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 42 states, 41 states have (on average 2.5609756097560976) internal successors, (105), 38 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 07:03:05,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:05,557 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2024-11-19 07:03:05,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 07:03:05,557 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.5609756097560976) internal successors, (105), 38 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 69 [2024-11-19 07:03:05,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:05,558 INFO L225 Difference]: With dead ends: 82 [2024-11-19 07:03:05,558 INFO L226 Difference]: Without dead ends: 82 [2024-11-19 07:03:05,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=305, Invalid=4231, Unknown=20, NotChecked=0, Total=4556 [2024-11-19 07:03:05,559 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 64 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:05,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 725 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 07:03:05,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-19 07:03:05,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-19 07:03:05,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 73 states have (on average 1.095890410958904) internal successors, (80), 78 states have internal predecessors, (80), 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) [2024-11-19 07:03:05,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2024-11-19 07:03:05,561 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 69 [2024-11-19 07:03:05,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:05,561 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2024-11-19 07:03:05,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.5609756097560976) internal successors, (105), 38 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 07:03:05,561 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2024-11-19 07:03:05,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-19 07:03:05,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:05,562 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:05,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-19 07:03:05,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:05,762 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:03:05,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:05,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1792929467, now seen corresponding path program 1 times [2024-11-19 07:03:05,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:05,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343626265] [2024-11-19 07:03:05,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:05,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:06,579 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 07:03:06,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:06,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343626265] [2024-11-19 07:03:06,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343626265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:06,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596536172] [2024-11-19 07:03:06,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:06,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:06,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:06,583 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:06,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-19 07:03:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:06,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-19 07:03:06,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:06,839 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 [2024-11-19 07:03:06,898 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:03:06,899 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 [2024-11-19 07:03:06,961 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 [2024-11-19 07:03:07,024 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:03:07,025 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 25 treesize of output 26 [2024-11-19 07:03:07,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:07,068 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 28 treesize of output 12 [2024-11-19 07:03:07,160 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:03:07,160 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 25 treesize of output 26 [2024-11-19 07:03:07,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:07,231 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 16 treesize of output 16 [2024-11-19 07:03:07,328 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 07:03:07,328 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:07,490 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2434 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2434) |c_ULTIMATE.start_main_~s~0#1.base|) 0)))) is different from false [2024-11-19 07:03:07,494 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2434 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_2434) |c_ULTIMATE.start_main_~s~0#1.base|) 0)))) is different from false [2024-11-19 07:03:07,498 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2434 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2434) |c_ULTIMATE.start_main_~s~0#1.base|) 0)))) is different from false [2024-11-19 07:03:07,510 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2433 (Array Int Int))) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2433))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2434)) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_2433 .cse1))) v_ArrVal_2433)))) is different from false [2024-11-19 07:03:07,526 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_89| Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2433 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2433) (select v_ArrVal_2433 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2434) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= v_ArrVal_2433 (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_89| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 (select v_ArrVal_2433 .cse0))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_89| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-11-19 07:03:07,534 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_89| Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2433 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_89| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_ArrVal_2433) (select v_ArrVal_2433 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_2434) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (not (= v_ArrVal_2433 (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_89| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse0 (select v_ArrVal_2433 .cse0))))))) is different from false [2024-11-19 07:03:07,542 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_89| Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2433 (Array Int Int))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_2433) (select v_ArrVal_2433 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2434) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (not (= v_ArrVal_2433 (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_89| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0 (select v_ArrVal_2433 .cse0))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_89| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2024-11-19 07:03:07,551 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_89| Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2433 (Array Int Int)) (v_ArrVal_2432 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2432))) (or (not (= (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_89| 4))) (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_2433 .cse1))) v_ArrVal_2433)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_2433) (select v_ArrVal_2433 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2434) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_89| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2024-11-19 07:03:07,566 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_89| Int) (v_ArrVal_2434 (Array Int Int)) (v_ArrVal_2433 (Array Int Int)) (v_ArrVal_2432 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2432))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_2433) (select v_ArrVal_2433 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2434) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_89| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (not (= v_ArrVal_2433 (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_89| 4))) (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 (select v_ArrVal_2433 .cse1)))))))) is different from false [2024-11-19 07:03:07,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:07,572 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 53 treesize of output 53 [2024-11-19 07:03:07,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2024-11-19 07:03:07,578 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:07,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:07,582 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 50 [2024-11-19 07:03:07,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:07,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2024-11-19 07:03:07,596 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 26 treesize of output 24 [2024-11-19 07:03:07,612 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 12 treesize of output 8 [2024-11-19 07:03:07,617 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:07,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:07,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2024-11-19 07:03:07,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:07,647 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 24 treesize of output 26 [2024-11-19 07:03:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 10 not checked. [2024-11-19 07:03:07,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596536172] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:07,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:07,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 26] total 58 [2024-11-19 07:03:07,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200223050] [2024-11-19 07:03:07,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:07,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-19 07:03:07,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:07,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-19 07:03:07,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2216, Unknown=21, NotChecked=918, Total=3306 [2024-11-19 07:03:07,995 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand has 58 states, 58 states have (on average 2.310344827586207) internal successors, (134), 52 states have internal predecessors, (134), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 07:03:08,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:08,972 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2024-11-19 07:03:08,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 07:03:08,973 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.310344827586207) internal successors, (134), 52 states have internal predecessors, (134), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 70 [2024-11-19 07:03:08,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:08,973 INFO L225 Difference]: With dead ends: 80 [2024-11-19 07:03:08,973 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 07:03:08,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 108 SyntacticMatches, 8 SemanticMatches, 67 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=225, Invalid=3330, Unknown=21, NotChecked=1116, Total=4692 [2024-11-19 07:03:08,974 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 78 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 1840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 592 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:08,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1073 Invalid, 1840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1244 Invalid, 0 Unknown, 592 Unchecked, 0.6s Time] [2024-11-19 07:03:08,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 07:03:08,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2024-11-19 07:03:08,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 75 states have internal predecessors, (76), 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) [2024-11-19 07:03:08,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2024-11-19 07:03:08,977 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 70 [2024-11-19 07:03:08,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:08,977 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2024-11-19 07:03:08,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.310344827586207) internal successors, (134), 52 states have internal predecessors, (134), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 07:03:08,978 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2024-11-19 07:03:08,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-19 07:03:08,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:08,978 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:08,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-19 07:03:09,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:09,179 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:03:09,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:09,180 INFO L85 PathProgramCache]: Analyzing trace with hash -10816926, now seen corresponding path program 1 times [2024-11-19 07:03:09,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:09,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875824634] [2024-11-19 07:03:09,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:09,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:10,673 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 07:03:10,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:10,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875824634] [2024-11-19 07:03:10,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875824634] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:10,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870806498] [2024-11-19 07:03:10,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:10,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:10,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:10,675 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:10,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-19 07:03:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:10,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-19 07:03:10,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:10,928 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 [2024-11-19 07:03:11,022 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:03:11,022 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 [2024-11-19 07:03:11,105 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 [2024-11-19 07:03:11,109 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 [2024-11-19 07:03:11,190 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-19 07:03:11,190 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 47 treesize of output 33 [2024-11-19 07:03:11,193 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 27 treesize of output 22 [2024-11-19 07:03:11,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:11,344 INFO L349 Elim1Store]: treesize reduction 47, result has 13.0 percent of original size [2024-11-19 07:03:11,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 32 [2024-11-19 07:03:11,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:11,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-11-19 07:03:11,540 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-19 07:03:11,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 58 [2024-11-19 07:03:11,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2024-11-19 07:03:11,828 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-11-19 07:03:11,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 36 [2024-11-19 07:03:11,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:11,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2024-11-19 07:03:11,929 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 07:03:11,930 INFO L311 TraceCheckSpWp]: Computing backward predicates...