./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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-ext3-properties/sll_circular_traversal-2.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 c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 08:06:17,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 08:06:17,473 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 08:06:17,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 08:06:17,481 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 08:06:17,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 08:06:17,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 08:06:17,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 08:06:17,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 08:06:17,514 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 08:06:17,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 08:06:17,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 08:06:17,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 08:06:17,515 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 08:06:17,518 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 08:06:17,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 08:06:17,519 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 08:06:17,519 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 08:06:17,519 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 08:06:17,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 08:06:17,520 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 08:06:17,521 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 08:06:17,524 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 08:06:17,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 08:06:17,525 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 08:06:17,525 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 08:06:17,525 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 08:06:17,525 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 08:06:17,526 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 08:06:17,526 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 08:06:17,526 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 08:06:17,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 08:06:17,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 08:06:17,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:06:17,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 08:06:17,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 08:06:17,528 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 08:06:17,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 08:06:17,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 08:06:17,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 08:06:17,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 08:06:17,530 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 08:06:17,530 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 -> c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc [2024-11-09 08:06:17,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 08:06:17,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 08:06:17,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 08:06:17,824 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 08:06:17,825 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 08:06:17,826 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2024-11-09 08:06:19,320 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 08:06:19,570 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 08:06:19,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2024-11-09 08:06:19,585 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/368d532de/7918f77ed81345ae8550a07cc6761d21/FLAG2ffa4c47d [2024-11-09 08:06:19,597 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/368d532de/7918f77ed81345ae8550a07cc6761d21 [2024-11-09 08:06:19,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 08:06:19,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 08:06:19,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 08:06:19,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 08:06:19,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 08:06:19,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:06:19" (1/1) ... [2024-11-09 08:06:19,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@535f45de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:19, skipping insertion in model container [2024-11-09 08:06:19,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:06:19" (1/1) ... [2024-11-09 08:06:19,649 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 08:06:20,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:06:20,044 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 08:06:20,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 08:06:20,143 INFO L204 MainTranslator]: Completed translation [2024-11-09 08:06:20,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20 WrapperNode [2024-11-09 08:06:20,144 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 08:06:20,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 08:06:20,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 08:06:20,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 08:06:20,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (1/1) ... [2024-11-09 08:06:20,172 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (1/1) ... [2024-11-09 08:06:20,194 INFO L138 Inliner]: procedures = 122, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2024-11-09 08:06:20,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 08:06:20,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 08:06:20,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 08:06:20,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 08:06:20,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (1/1) ... [2024-11-09 08:06:20,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (1/1) ... [2024-11-09 08:06:20,209 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (1/1) ... [2024-11-09 08:06:20,226 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 6 writes are split as follows [0, 6]. [2024-11-09 08:06:20,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (1/1) ... [2024-11-09 08:06:20,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (1/1) ... [2024-11-09 08:06:20,235 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (1/1) ... [2024-11-09 08:06:20,242 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (1/1) ... [2024-11-09 08:06:20,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (1/1) ... [2024-11-09 08:06:20,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (1/1) ... [2024-11-09 08:06:20,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 08:06:20,250 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 08:06:20,250 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 08:06:20,250 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 08:06:20,251 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (1/1) ... [2024-11-09 08:06:20,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 08:06:20,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:20,290 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-09 08:06:20,294 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-09 08:06:20,342 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-09 08:06:20,342 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-09 08:06:20,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 08:06:20,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 08:06:20,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 08:06:20,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 08:06:20,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 08:06:20,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 08:06:20,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 08:06:20,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 08:06:20,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 08:06:20,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 08:06:20,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 08:06:20,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 08:06:20,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 08:06:20,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 08:06:20,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 08:06:20,484 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 08:06:20,486 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 08:06:20,517 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-09 08:06:20,798 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-11-09 08:06:20,799 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 08:06:20,814 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 08:06:20,815 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 08:06:20,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:06:20 BoogieIcfgContainer [2024-11-09 08:06:20,815 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 08:06:20,818 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 08:06:20,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 08:06:20,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 08:06:20,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:06:19" (1/3) ... [2024-11-09 08:06:20,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56251e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:06:20, skipping insertion in model container [2024-11-09 08:06:20,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:06:20" (2/3) ... [2024-11-09 08:06:20,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56251e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:06:20, skipping insertion in model container [2024-11-09 08:06:20,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 08:06:20" (3/3) ... [2024-11-09 08:06:20,827 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-2.i [2024-11-09 08:06:20,844 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 08:06:20,845 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2024-11-09 08:06:20,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 08:06:20,893 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;@50ec4e5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 08:06:20,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2024-11-09 08:06:20,897 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 64 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:20,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 08:06:20,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:20,905 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 08:06:20,906 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 08:06:20,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:20,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2024-11-09 08:06:20,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:20,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389983792] [2024-11-09 08:06:20,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:20,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:21,156 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-09 08:06:21,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:21,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389983792] [2024-11-09 08:06:21,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389983792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:06:21,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:06:21,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:06:21,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573097414] [2024-11-09 08:06:21,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:06:21,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:06:21,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:21,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:06:21,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:06:21,189 INFO L87 Difference]: Start difference. First operand has 66 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 64 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:21,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:21,276 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2024-11-09 08:06:21,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:06:21,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 08:06:21,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:21,285 INFO L225 Difference]: With dead ends: 62 [2024-11-09 08:06:21,287 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 08:06:21,289 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-09 08:06:21,293 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 14 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:21,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 81 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:06:21,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 08:06:21,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-09 08:06:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:21,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2024-11-09 08:06:21,348 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 4 [2024-11-09 08:06:21,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:21,348 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2024-11-09 08:06:21,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:21,349 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2024-11-09 08:06:21,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 08:06:21,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:21,349 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 08:06:21,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 08:06:21,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 08:06:21,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:21,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2024-11-09 08:06:21,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:21,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340181526] [2024-11-09 08:06:21,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:21,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:21,500 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-09 08:06:21,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:21,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340181526] [2024-11-09 08:06:21,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340181526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:06:21,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:06:21,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:06:21,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106410077] [2024-11-09 08:06:21,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:06:21,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:06:21,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:21,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:06:21,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:06:21,506 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:21,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:21,563 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2024-11-09 08:06:21,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:06:21,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 08:06:21,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:21,564 INFO L225 Difference]: With dead ends: 53 [2024-11-09 08:06:21,565 INFO L226 Difference]: Without dead ends: 53 [2024-11-09 08:06:21,565 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-09 08:06:21,566 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 12 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:21,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 74 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:06:21,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-09 08:06:21,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-09 08:06:21,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 52 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:21,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2024-11-09 08:06:21,577 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 4 [2024-11-09 08:06:21,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:21,577 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2024-11-09 08:06:21,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:21,578 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2024-11-09 08:06:21,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 08:06:21,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:21,578 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:21,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 08:06:21,579 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 08:06:21,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:21,582 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2024-11-09 08:06:21,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:21,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900140689] [2024-11-09 08:06:21,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:21,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:21,683 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-09 08:06:21,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:21,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900140689] [2024-11-09 08:06:21,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900140689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:06:21,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:06:21,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:06:21,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745235896] [2024-11-09 08:06:21,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:06:21,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:06:21,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:21,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:06:21,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:06:21,686 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:21,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:21,742 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2024-11-09 08:06:21,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:06:21,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 08:06:21,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:21,743 INFO L225 Difference]: With dead ends: 51 [2024-11-09 08:06:21,743 INFO L226 Difference]: Without dead ends: 51 [2024-11-09 08:06:21,744 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-09 08:06:21,745 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:21,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 76 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:06:21,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-09 08:06:21,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-09 08:06:21,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:21,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2024-11-09 08:06:21,750 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 9 [2024-11-09 08:06:21,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:21,750 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2024-11-09 08:06:21,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:21,751 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2024-11-09 08:06:21,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 08:06:21,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:21,751 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:21,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 08:06:21,752 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 08:06:21,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:21,755 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2024-11-09 08:06:21,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:21,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210115253] [2024-11-09 08:06:21,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:21,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:21,944 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-09 08:06:21,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:21,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210115253] [2024-11-09 08:06:21,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210115253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:06:21,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:06:21,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 08:06:21,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454235263] [2024-11-09 08:06:21,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:06:21,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:06:21,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:21,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:06:21,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:06:21,946 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:22,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:22,004 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2024-11-09 08:06:22,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:06:22,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 08:06:22,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:22,005 INFO L225 Difference]: With dead ends: 49 [2024-11-09 08:06:22,005 INFO L226 Difference]: Without dead ends: 49 [2024-11-09 08:06:22,006 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-09 08:06:22,007 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:22,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:06:22,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-09 08:06:22,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-09 08:06:22,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2024-11-09 08:06:22,013 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 9 [2024-11-09 08:06:22,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:22,013 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2024-11-09 08:06:22,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2024-11-09 08:06:22,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 08:06:22,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:22,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:22,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 08:06:22,015 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 08:06:22,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:22,015 INFO L85 PathProgramCache]: Analyzing trace with hash 427661500, now seen corresponding path program 1 times [2024-11-09 08:06:22,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:22,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991856690] [2024-11-09 08:06:22,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:22,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:22,087 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-09 08:06:22,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:22,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991856690] [2024-11-09 08:06:22,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991856690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:06:22,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:06:22,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 08:06:22,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770561300] [2024-11-09 08:06:22,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:06:22,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 08:06:22,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:22,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 08:06:22,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 08:06:22,090 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:22,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:22,111 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2024-11-09 08:06:22,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 08:06:22,112 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 08:06:22,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:22,113 INFO L225 Difference]: With dead ends: 54 [2024-11-09 08:06:22,113 INFO L226 Difference]: Without dead ends: 54 [2024-11-09 08:06:22,114 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-09 08:06:22,115 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 4 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 93 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-09 08:06:22,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 93 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:06:22,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-09 08:06:22,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2024-11-09 08:06:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:22,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2024-11-09 08:06:22,121 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 11 [2024-11-09 08:06:22,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:22,121 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2024-11-09 08:06:22,121 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2024-11-09 08:06:22,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 08:06:22,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:22,122 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:22,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 08:06:22,123 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 08:06:22,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:22,124 INFO L85 PathProgramCache]: Analyzing trace with hash 200371689, now seen corresponding path program 1 times [2024-11-09 08:06:22,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:22,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582931520] [2024-11-09 08:06:22,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:22,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:22,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:06:22,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:22,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582931520] [2024-11-09 08:06:22,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582931520] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:06:22,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181282044] [2024-11-09 08:06:22,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:22,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:22,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:22,274 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-09 08:06:22,275 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-09 08:06:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:22,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 08:06:22,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:06:22,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:06:22,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:06:22,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:06:22,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181282044] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:06:22,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:06:22,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-09 08:06:22,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125121009] [2024-11-09 08:06:22,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:06:22,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 08:06:22,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:22,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 08:06:22,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:06:22,530 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:22,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:22,557 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2024-11-09 08:06:22,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 08:06:22,560 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 08:06:22,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:22,560 INFO L225 Difference]: With dead ends: 65 [2024-11-09 08:06:22,561 INFO L226 Difference]: Without dead ends: 65 [2024-11-09 08:06:22,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:06:22,562 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:22,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 182 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 08:06:22,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-09 08:06:22,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-09 08:06:22,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.36) internal successors, (68), 64 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:22,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2024-11-09 08:06:22,570 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 16 [2024-11-09 08:06:22,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:22,571 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2024-11-09 08:06:22,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:22,574 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2024-11-09 08:06:22,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 08:06:22,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:22,594 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:22,616 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-09 08:06:22,794 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-09 08:06:22,795 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 08:06:22,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:22,796 INFO L85 PathProgramCache]: Analyzing trace with hash 527522044, now seen corresponding path program 2 times [2024-11-09 08:06:22,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:22,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759017842] [2024-11-09 08:06:22,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:22,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:22,986 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 08:06:22,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:22,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759017842] [2024-11-09 08:06:22,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759017842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:06:22,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:06:22,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 08:06:22,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039384835] [2024-11-09 08:06:22,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:06:22,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:06:22,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:22,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:06:22,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:06:22,989 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:23,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:23,107 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2024-11-09 08:06:23,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:06:23,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 08:06:23,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:23,109 INFO L225 Difference]: With dead ends: 62 [2024-11-09 08:06:23,109 INFO L226 Difference]: Without dead ends: 62 [2024-11-09 08:06:23,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:06:23,110 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 16 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:23,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 96 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:06:23,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-09 08:06:23,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-09 08:06:23,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:23,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2024-11-09 08:06:23,114 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 31 [2024-11-09 08:06:23,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:23,115 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2024-11-09 08:06:23,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:23,115 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2024-11-09 08:06:23,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 08:06:23,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:23,116 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:23,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 08:06:23,116 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 08:06:23,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:23,117 INFO L85 PathProgramCache]: Analyzing trace with hash 527522045, now seen corresponding path program 1 times [2024-11-09 08:06:23,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:23,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139883363] [2024-11-09 08:06:23,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:23,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:23,420 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 08:06:23,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:23,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139883363] [2024-11-09 08:06:23,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139883363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:06:23,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:06:23,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 08:06:23,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977501417] [2024-11-09 08:06:23,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:06:23,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 08:06:23,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:23,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 08:06:23,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 08:06:23,422 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:23,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:23,547 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2024-11-09 08:06:23,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 08:06:23,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 08:06:23,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:23,549 INFO L225 Difference]: With dead ends: 69 [2024-11-09 08:06:23,549 INFO L226 Difference]: Without dead ends: 69 [2024-11-09 08:06:23,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 08:06:23,550 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 8 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:23,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 128 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:06:23,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-09 08:06:23,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2024-11-09 08:06:23,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:23,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2024-11-09 08:06:23,558 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 31 [2024-11-09 08:06:23,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:23,558 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2024-11-09 08:06:23,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:23,558 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2024-11-09 08:06:23,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 08:06:23,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:23,562 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:23,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 08:06:23,562 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 08:06:23,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:23,563 INFO L85 PathProgramCache]: Analyzing trace with hash -453751472, now seen corresponding path program 1 times [2024-11-09 08:06:23,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:23,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079218154] [2024-11-09 08:06:23,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:23,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:24,325 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 08:06:24,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:24,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079218154] [2024-11-09 08:06:24,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079218154] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:06:24,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789131342] [2024-11-09 08:06:24,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:24,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:24,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:24,328 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-09 08:06:24,330 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-09 08:06:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:24,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 08:06:24,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:06:24,730 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-09 08:06:24,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:06:24,825 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 25 treesize of output 13 [2024-11-09 08:06:24,937 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 08:06:24,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:06:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 08:06:25,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789131342] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:06:25,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:06:25,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2024-11-09 08:06:25,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375958028] [2024-11-09 08:06:25,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:06:25,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 08:06:25,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:25,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 08:06:25,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2024-11-09 08:06:25,335 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:25,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:25,711 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2024-11-09 08:06:25,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 08:06:25,712 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-09 08:06:25,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:25,713 INFO L225 Difference]: With dead ends: 65 [2024-11-09 08:06:25,713 INFO L226 Difference]: Without dead ends: 65 [2024-11-09 08:06:25,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 08:06:25,714 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 19 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:25,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 358 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 08:06:25,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-09 08:06:25,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-09 08:06:25,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 64 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2024-11-09 08:06:25,725 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 35 [2024-11-09 08:06:25,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:25,726 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2024-11-09 08:06:25,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:25,726 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2024-11-09 08:06:25,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 08:06:25,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:25,727 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:25,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 08:06:25,927 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,SelfDestructingSolverStorable8 [2024-11-09 08:06:25,928 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 08:06:25,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:25,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941388, now seen corresponding path program 1 times [2024-11-09 08:06:25,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:25,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785170481] [2024-11-09 08:06:25,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:25,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:27,016 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:06:27,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:27,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785170481] [2024-11-09 08:06:27,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785170481] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:06:27,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253229290] [2024-11-09 08:06:27,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:27,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:27,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:27,021 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-09 08:06:27,024 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-09 08:06:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:27,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-09 08:06:27,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:06:27,199 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-09 08:06:27,251 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:06:27,252 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 14 treesize of output 13 [2024-11-09 08:06:27,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 08:06:27,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 08:06:27,373 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 33 treesize of output 17 [2024-11-09 08:06:27,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 08:06:27,464 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 08:06:27,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2024-11-09 08:06:27,480 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:06:27,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 08:06:27,764 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 39 treesize of output 27 [2024-11-09 08:06:27,772 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 08:06:27,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 35 [2024-11-09 08:06:27,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:27,809 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 40 treesize of output 32 [2024-11-09 08:06:27,815 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 23 treesize of output 15 [2024-11-09 08:06:27,919 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:06:27,920 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:06:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:06:28,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253229290] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:06:28,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:06:28,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 29 [2024-11-09 08:06:28,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662396679] [2024-11-09 08:06:28,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:06:28,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 08:06:28,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:28,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 08:06:28,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2024-11-09 08:06:28,289 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:29,042 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2024-11-09 08:06:29,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 08:06:29,043 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-09 08:06:29,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:29,045 INFO L225 Difference]: With dead ends: 77 [2024-11-09 08:06:29,046 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 08:06:29,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=163, Invalid=1243, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 08:06:29,049 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 39 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:29,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 278 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 08:06:29,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 08:06:29,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2024-11-09 08:06:29,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 69 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:29,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2024-11-09 08:06:29,059 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 37 [2024-11-09 08:06:29,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:29,059 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2024-11-09 08:06:29,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:29,059 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2024-11-09 08:06:29,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 08:06:29,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:29,060 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:29,083 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-09 08:06:29,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:29,261 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 08:06:29,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:29,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941389, now seen corresponding path program 1 times [2024-11-09 08:06:29,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:29,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375887628] [2024-11-09 08:06:29,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:29,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:30,313 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:06:30,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:30,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375887628] [2024-11-09 08:06:30,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375887628] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:06:30,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565020049] [2024-11-09 08:06:30,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:30,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:30,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:30,316 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-09 08:06:30,317 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-09 08:06:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:30,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-09 08:06:30,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:06:30,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 8 treesize of output 1 [2024-11-09 08:06:30,538 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:06:30,539 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 14 treesize of output 13 [2024-11-09 08:06:30,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 08:06:30,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 08:06:30,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 08:06:30,695 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 33 treesize of output 17 [2024-11-09 08:06:30,781 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 08:06:30,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2024-11-09 08:06:30,794 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 08:06:30,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 08:06:31,064 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 08:06:31,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 35 [2024-11-09 08:06:31,073 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 08:06:31,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2024-11-09 08:06:31,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:31,110 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 40 treesize of output 32 [2024-11-09 08:06:31,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:31,120 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 28 treesize of output 28 [2024-11-09 08:06:31,147 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:06:31,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:06:31,789 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:06:31,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565020049] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:06:31,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:06:31,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 29 [2024-11-09 08:06:31,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470785240] [2024-11-09 08:06:31,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:06:31,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 08:06:31,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:31,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 08:06:31,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2024-11-09 08:06:31,792 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 30 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 30 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:32,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:32,519 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2024-11-09 08:06:32,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 08:06:32,520 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 30 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-09 08:06:32,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:32,521 INFO L225 Difference]: With dead ends: 76 [2024-11-09 08:06:32,521 INFO L226 Difference]: Without dead ends: 76 [2024-11-09 08:06:32,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=1240, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 08:06:32,522 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:32,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 367 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 08:06:32,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-09 08:06:32,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2024-11-09 08:06:32,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 71 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:32,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2024-11-09 08:06:32,527 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 37 [2024-11-09 08:06:32,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:32,527 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2024-11-09 08:06:32,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.6206896551724137) internal successors, (76), 30 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:32,527 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-11-09 08:06:32,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 08:06:32,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:32,530 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:32,548 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-09 08:06:32,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:32,735 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 08:06:32,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:32,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1124327534, now seen corresponding path program 1 times [2024-11-09 08:06:32,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:32,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589048751] [2024-11-09 08:06:32,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:32,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:33,008 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 08:06:33,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:33,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589048751] [2024-11-09 08:06:33,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589048751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 08:06:33,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 08:06:33,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 08:06:33,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783659647] [2024-11-09 08:06:33,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 08:06:33,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 08:06:33,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:33,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 08:06:33,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 08:06:33,011 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:33,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:33,147 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2024-11-09 08:06:33,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 08:06:33,148 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-09 08:06:33,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:33,148 INFO L225 Difference]: With dead ends: 85 [2024-11-09 08:06:33,148 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 08:06:33,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 08:06:33,149 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 29 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:33,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 136 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 08:06:33,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 08:06:33,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2024-11-09 08:06:33,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 76 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:33,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2024-11-09 08:06:33,154 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 38 [2024-11-09 08:06:33,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:33,155 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2024-11-09 08:06:33,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:33,155 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2024-11-09 08:06:33,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 08:06:33,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:33,157 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:33,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 08:06:33,158 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 08:06:33,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:33,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1642838496, now seen corresponding path program 1 times [2024-11-09 08:06:33,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:33,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387813869] [2024-11-09 08:06:33,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:33,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:34,597 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:06:34,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:34,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387813869] [2024-11-09 08:06:34,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387813869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:06:34,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100963494] [2024-11-09 08:06:34,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:34,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:34,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:34,600 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-09 08:06:34,602 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-09 08:06:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:34,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-09 08:06:34,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:06:34,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 08:06:34,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 08:06:34,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 08:06:34,983 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 08:06:34,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-09 08:06:35,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 08:06:35,043 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 35 treesize of output 19 [2024-11-09 08:06:35,056 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 08:06:35,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2024-11-09 08:06:35,145 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 08:06:35,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2024-11-09 08:06:35,161 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 08:06:35,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 08:06:35,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 27 treesize of output 15 [2024-11-09 08:06:35,479 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 08:06:35,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 37 [2024-11-09 08:06:35,497 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 08:06:35,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 46 [2024-11-09 08:06:35,507 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 08:06:35,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 42 [2024-11-09 08:06:35,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:35,600 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 42 treesize of output 34 [2024-11-09 08:06:35,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:35,609 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 30 treesize of output 30 [2024-11-09 08:06:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:06:35,765 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:06:36,236 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4))) (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1039 Int) (v_ArrVal_1044 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1039)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1044) .cse0) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) |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_~new_head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1039 Int) (v_ArrVal_1044 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1039)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1044) .cse0) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) |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_~new_head~0#1.offset|))))) is different from false [2024-11-09 08:06:48,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:48,615 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 76 treesize of output 80 [2024-11-09 08:06:48,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:48,666 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 76 treesize of output 80 [2024-11-09 08:06:48,998 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) (.cse1 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) (and (or (forall ((v_ArrVal_1036 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1039 Int) (v_ArrVal_1044 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1036) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1039)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))) .cse1) (or .cse2 (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1039 Int) (v_ArrVal_1044 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1039)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) (or (forall ((v_ArrVal_1036 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1039 Int) (v_ArrVal_1044 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1036) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1039)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))) .cse1))) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1044 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse1 .cse2) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1039 Int) (v_ArrVal_1044 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1039)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1044 (Array Int Int))) (or (= (select (select (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) .cse1))) is different from false [2024-11-09 08:06:53,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:53,278 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 43 treesize of output 34 [2024-11-09 08:06:53,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:53,288 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 95 treesize of output 97 [2024-11-09 08:06:53,296 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 65 treesize of output 61 [2024-11-09 08:06:53,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 91 treesize of output 83 [2024-11-09 08:06:53,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-09 08:06:53,369 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2024-11-09 08:06:53,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2024-11-09 08:06:53,373 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 48 treesize of output 36 [2024-11-09 08:06:53,377 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 7 [2024-11-09 08:06:53,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:06:53,387 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 18 treesize of output 19 [2024-11-09 08:06:53,390 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:06:53,391 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 16 treesize of output 8 [2024-11-09 08:06:53,419 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-09 08:06:53,420 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 2 case distinctions, treesize of input 34 treesize of output 37 [2024-11-09 08:06:53,424 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:06:53,426 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 26 treesize of output 18 [2024-11-09 08:06:53,442 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 08:06:53,442 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 37 treesize of output 1 [2024-11-09 08:06:53,561 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 7 not checked. [2024-11-09 08:06:53,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100963494] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:06:53,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:06:53,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 18] total 44 [2024-11-09 08:06:53,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992010557] [2024-11-09 08:06:53,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:06:53,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-09 08:06:53,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:53,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-09 08:06:53,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1548, Unknown=49, NotChecked=162, Total=1892 [2024-11-09 08:06:53,563 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 44 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 44 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:54,750 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2024-11-09 08:06:54,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 08:06:54,751 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 44 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-09 08:06:54,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:54,751 INFO L225 Difference]: With dead ends: 77 [2024-11-09 08:06:54,751 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 08:06:54,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=279, Invalid=2760, Unknown=49, NotChecked=218, Total=3306 [2024-11-09 08:06:54,753 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:54,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 617 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 792 Invalid, 0 Unknown, 73 Unchecked, 0.6s Time] [2024-11-09 08:06:54,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 08:06:54,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-09 08:06:54,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 76 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2024-11-09 08:06:54,757 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 41 [2024-11-09 08:06:54,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:54,757 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2024-11-09 08:06:54,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 44 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:54,758 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2024-11-09 08:06:54,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 08:06:54,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:54,759 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:54,778 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-09 08:06:54,962 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,SelfDestructingSolverStorable12 [2024-11-09 08:06:54,963 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 08:06:54,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:54,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1679000631, now seen corresponding path program 1 times [2024-11-09 08:06:54,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:54,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075686702] [2024-11-09 08:06:54,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:54,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:06:55,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:55,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075686702] [2024-11-09 08:06:55,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075686702] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:06:55,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92670644] [2024-11-09 08:06:55,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:55,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:55,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:55,548 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-09 08:06:55,550 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-09 08:06:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:55,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-09 08:06:55,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:06:55,721 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-09 08:06:55,742 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 08:06:55,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 08:06:55,758 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 08:06:55,758 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-09 08:06:55,777 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 08:06:55,777 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-09 08:06:55,804 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-09 08:06:55,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-09 08:06:55,827 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 08:06:55,851 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-09 08:06:55,882 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 17 treesize of output 12 [2024-11-09 08:06:55,946 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-09 08:06:55,952 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-09 08:06:55,955 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 08:06:55,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:06:55,971 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1218 (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_1218) |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-09 08:06:56,012 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1217 (Array Int Int))) (or (not (= v_ArrVal_1217 (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_1217 .cse0))))) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1217) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1218) |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-09 08:06:56,020 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 41 treesize of output 39 [2024-11-09 08:06:56,026 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-09 08:06:56,180 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 7 not checked. [2024-11-09 08:06:56,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92670644] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:06:56,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:06:56,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 27 [2024-11-09 08:06:56,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568362015] [2024-11-09 08:06:56,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:06:56,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 08:06:56,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:06:56,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 08:06:56,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=8, NotChecked=94, Total=702 [2024-11-09 08:06:56,182 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 27 states, 27 states have (on average 2.962962962962963) internal successors, (80), 27 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:56,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 08:06:56,426 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2024-11-09 08:06:56,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 08:06:56,427 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.962962962962963) internal successors, (80), 27 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-09 08:06:56,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 08:06:56,427 INFO L225 Difference]: With dead ends: 75 [2024-11-09 08:06:56,427 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 08:06:56,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=683, Unknown=8, NotChecked=110, Total=930 [2024-11-09 08:06:56,428 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 08:06:56,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 455 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 377 Invalid, 0 Unknown, 56 Unchecked, 0.2s Time] [2024-11-09 08:06:56,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 08:06:56,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-09 08:06:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 74 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:56,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2024-11-09 08:06:56,431 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 42 [2024-11-09 08:06:56,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 08:06:56,432 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2024-11-09 08:06:56,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.962962962962963) internal successors, (80), 27 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:06:56,432 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2024-11-09 08:06:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 08:06:56,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 08:06:56,433 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 08:06:56,449 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-09 08:06:56,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:56,634 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-11-09 08:06:56,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 08:06:56,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728484, now seen corresponding path program 2 times [2024-11-09 08:06:56,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 08:06:56,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622690555] [2024-11-09 08:06:56,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 08:06:56,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 08:06:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 08:06:58,276 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:06:58,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 08:06:58,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622690555] [2024-11-09 08:06:58,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622690555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 08:06:58,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71634287] [2024-11-09 08:06:58,277 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 08:06:58,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 08:06:58,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 08:06:58,278 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-09 08:06:58,279 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-09 08:06:58,431 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 08:06:58,431 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 08:06:58,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-11-09 08:06:58,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 08:06:58,478 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-09 08:06:58,553 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 08:06:58,554 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 14 treesize of output 13 [2024-11-09 08:06:58,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 08:06:58,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 08:06:58,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 08:06:58,641 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 33 treesize of output 17 [2024-11-09 08:06:58,699 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 08:06:58,699 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 26 treesize of output 29 [2024-11-09 08:06:58,767 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-09 08:06:58,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2024-11-09 08:06:58,782 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-09 08:06:58,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 36 [2024-11-09 08:06:58,848 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 08:06:58,848 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 1 case distinctions, treesize of input 75 treesize of output 41 [2024-11-09 08:06:58,858 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 08:06:58,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 33 [2024-11-09 08:06:58,964 INFO L349 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2024-11-09 08:06:58,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 64 [2024-11-09 08:06:58,994 INFO L349 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2024-11-09 08:06:58,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 48 [2024-11-09 08:06:59,424 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-09 08:06:59,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 82 [2024-11-09 08:06:59,431 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-09 08:06:59,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 99 [2024-11-09 08:06:59,944 INFO L349 Elim1Store]: treesize reduction 96, result has 35.1 percent of original size [2024-11-09 08:06:59,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 111 [2024-11-09 08:06:59,996 INFO L349 Elim1Store]: treesize reduction 88, result has 37.1 percent of original size [2024-11-09 08:06:59,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 88 [2024-11-09 08:07:00,369 INFO L349 Elim1Store]: treesize reduction 49, result has 47.3 percent of original size [2024-11-09 08:07:00,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 131 treesize of output 146 [2024-11-09 08:07:00,417 INFO L349 Elim1Store]: treesize reduction 49, result has 47.3 percent of original size [2024-11-09 08:07:00,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 111 treesize of output 122 [2024-11-09 08:07:01,051 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 08:07:01,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 08:07:39,675 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1406 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1411 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1403 Int) (v_ArrVal_1407 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1407))) (let ((.cse2 (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1403)) (.cse1 (select v_ArrVal_1407 0)) (.cse5 (select v_ArrVal_1406 0)) (.cse0 (select v_ArrVal_1413 0)) (.cse6 (store (select .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) (or (< .cse0 0) (not (= (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 .cse1) 4 (select v_ArrVal_1407 4)) v_ArrVal_1407)) (= (select .cse2 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1406))) (let ((.cse3 (store (select .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse3) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (store (select (store .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse3) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 4 v_ArrVal_1411)))) .cse5) .cse0)) 1) (not (= (select .cse2 .cse5) 1)) (= .cse0 0) (not (= (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 (select v_ArrVal_1406 4)) v_ArrVal_1406)) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| .cse1) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse6) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1413) .cse5) .cse0) 0) (not (= v_ArrVal_1413 (store (select (store .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse6) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 4 (select v_ArrVal_1413 4)))))))) (forall ((v_ArrVal_1406 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1413 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1403 Int) (v_ArrVal_1407 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1407))) (let ((.cse9 (select v_ArrVal_1407 0)) (.cse11 (store (select .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse10 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1406)) (.cse12 (select v_ArrVal_1406 0)) (.cse8 (select v_ArrVal_1413 0))) (or (< .cse8 0) (not (= (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 .cse9) 4 (select v_ArrVal_1407 4)) v_ArrVal_1407)) (= (select (select (store .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|)) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) (not (= (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 (select v_ArrVal_1406 4)) v_ArrVal_1406)) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| .cse9) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse11) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1413) .cse12) .cse8) 0) (not (= (select |c_#valid| .cse12) 1)) (not (= v_ArrVal_1413 (store (select (store .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse11) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 4 (select v_ArrVal_1413 4)))) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1403) (select (select .cse10 .cse12) .cse8)) 1))))) (forall ((v_ArrVal_1406 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1411 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1403 Int) (v_ArrVal_1407 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1406))) (let ((.cse19 (store (select .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (let ((.cse15 (select (store .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse19) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (let ((.cse14 (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse19) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (store .cse15 4 v_ArrVal_1411))) (.cse18 (select v_ArrVal_1406 0)) (.cse17 (select v_ArrVal_1407 0))) (or (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (select (select .cse14 (select .cse15 0)) (select (select (let ((.cse16 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1407))) (store .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0))) (not (= (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 .cse17) 4 (select v_ArrVal_1407 4)) v_ArrVal_1407)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1403) .cse18) 1)) (not (= (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 (select v_ArrVal_1406 4)) v_ArrVal_1406)) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| .cse17) (= (select |c_#valid| (select (select .cse14 .cse18) .cse17)) 1) (< .cse17 0)))))))) is different from false [2024-11-09 08:07:40,290 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse10 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse9 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1401 (Array Int Int))) (or (forall ((v_ArrVal_1402 (Array Int Int))) (or (forall ((v_ArrVal_1406 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1413 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1403 Int) (v_ArrVal_1407 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1402))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1401)) (.cse0 (store .cse7 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1407))) (let ((.cse1 (store (select .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse2 (select v_ArrVal_1413 0)) (.cse5 (select v_ArrVal_1407 0)) (.cse4 (select v_ArrVal_1406 0)) (.cse3 (store .cse6 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1406))) (or (not (= v_ArrVal_1413 (store (select (store .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse1) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 4 (select v_ArrVal_1413 4)))) (< .cse2 0) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1403) (select (select .cse3 .cse4) .cse2)) 1) (not (= (store (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 .cse5) 4 (select v_ArrVal_1407 4)) v_ArrVal_1407)) (not (= (store (store (select .cse6 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 (select v_ArrVal_1406 4)) v_ArrVal_1406)) (= (select (select (store (store .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse1) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1413) .cse4) .cse2) 0) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| .cse5) (not (= (select |c_#valid| .cse4) 1)) (= (select (select (store .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|)) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|)))))) (not (= v_ArrVal_1402 (store .cse8 .cse9 (select v_ArrVal_1402 .cse9)))))) (not (= v_ArrVal_1401 (store .cse10 .cse9 (select v_ArrVal_1401 .cse9)))))) (forall ((v_ArrVal_1401 (Array Int Int))) (or (forall ((v_ArrVal_1402 (Array Int Int))) (or (forall ((v_ArrVal_1406 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1411 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1403 Int) (v_ArrVal_1407 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1402))) (let ((.cse11 (store .cse17 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1407))) (let ((.cse12 (store (select .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse18 (select v_ArrVal_1407 0)) (.cse14 (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1403)) (.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1401)) (.cse15 (select v_ArrVal_1406 0)) (.cse13 (select v_ArrVal_1413 0))) (or (not (= v_ArrVal_1413 (store (select (store .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse12) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 4 (select v_ArrVal_1413 4)))) (< .cse13 0) (not (= (select .cse14 .cse15) 1)) (= .cse13 0) (not (= (store (store (select .cse16 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 (select v_ArrVal_1406 4)) v_ArrVal_1406)) (not (= (store (store (select .cse17 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 .cse18) 4 (select v_ArrVal_1407 4)) v_ArrVal_1407)) (= (select (select (store (store .cse17 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse12) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1413) .cse15) .cse13) 0) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| .cse18) (= (select .cse14 (select (select (let ((.cse20 (store .cse16 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1406))) (let ((.cse19 (store (select .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (store (store .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse19) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (store (select (store .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse19) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 4 v_ArrVal_1411)))) .cse15) .cse13)) 1)))))) (not (= v_ArrVal_1402 (store .cse8 .cse9 (select v_ArrVal_1402 .cse9)))))) (not (= v_ArrVal_1401 (store .cse10 .cse9 (select v_ArrVal_1401 .cse9)))))) (forall ((v_ArrVal_1401 (Array Int Int))) (or (forall ((v_ArrVal_1402 (Array Int Int))) (or (forall ((v_ArrVal_1406 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| Int) (v_ArrVal_1411 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1403 Int) (v_ArrVal_1407 (Array Int Int))) (let ((.cse26 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1401))) (let ((.cse29 (store .cse26 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1406))) (let ((.cse28 (store (select .cse29 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (let ((.cse22 (select (store .cse29 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse28) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|))) (let ((.cse24 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1402)) (.cse21 (store (store .cse26 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse28) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (store .cse22 4 v_ArrVal_1411))) (.cse25 (select v_ArrVal_1406 0)) (.cse27 (select v_ArrVal_1407 0))) (or (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| (select (select .cse21 (select .cse22 0)) (select (select (let ((.cse23 (store .cse24 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1407))) (store .cse23 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse23 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0))) (not (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54| v_ArrVal_1403) .cse25) 1)) (not (= (store (store (select .cse26 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 (select v_ArrVal_1406 4)) v_ArrVal_1406)) (not (= (store (store (select .cse24 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_54|) 0 .cse27) 4 (select v_ArrVal_1407 4)) v_ArrVal_1407)) (= (select |c_#valid| (select (select .cse21 .cse25) .cse27)) 1) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| .cse27) (< .cse27 0)))))))) (not (= v_ArrVal_1402 (store .cse8 .cse9 (select v_ArrVal_1402 .cse9)))))) (not (= v_ArrVal_1401 (store .cse10 .cse9 (select v_ArrVal_1401 .cse9)))))))) is different from false [2024-11-09 08:07:40,504 INFO L349 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2024-11-09 08:07:40,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2320 treesize of output 2314 [2024-11-09 08:07:40,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 08:07:40,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:07:40,608 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 1564 treesize of output 1572 [2024-11-09 08:07:40,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2024-11-09 08:07:40,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:07:40,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-09 08:07:41,052 INFO L349 Elim1Store]: treesize reduction 16, result has 66.7 percent of original size [2024-11-09 08:07:41,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 164 [2024-11-09 08:07:41,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 08:07:42,510 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:42,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 183 treesize of output 171 [2024-11-09 08:07:42,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:07:42,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-09 08:07:42,600 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:42,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 183 treesize of output 171 [2024-11-09 08:07:42,639 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:42,641 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:42,642 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:42,679 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-09 08:07:42,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 18 [2024-11-09 08:07:42,713 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:42,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 34 treesize of output 30 [2024-11-09 08:07:42,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:07:42,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-09 08:07:42,769 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:42,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 34 treesize of output 30 [2024-11-09 08:07:42,813 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:42,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 101 treesize of output 93 [2024-11-09 08:07:42,881 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:42,915 INFO L349 Elim1Store]: treesize reduction 16, result has 57.9 percent of original size [2024-11-09 08:07:42,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 113 treesize of output 114 [2024-11-09 08:07:42,996 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:43,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 34 treesize of output 30 [2024-11-09 08:07:43,022 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:43,055 INFO L349 Elim1Store]: treesize reduction 16, result has 57.9 percent of original size [2024-11-09 08:07:43,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 51 [2024-11-09 08:07:43,096 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:43,098 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:43,099 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:43,139 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-09 08:07:43,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 18 [2024-11-09 08:07:43,221 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:43,229 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:43,231 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:43,233 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:43,234 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:43,278 INFO L349 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2024-11-09 08:07:43,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 370 treesize of output 374 [2024-11-09 08:07:43,348 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:43,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:07:43,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 67 [2024-11-09 08:07:43,504 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:43,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 08:07:43,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 67 [2024-11-09 08:07:44,033 INFO L349 Elim1Store]: treesize reduction 94, result has 32.4 percent of original size [2024-11-09 08:07:44,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 220 treesize of output 246 [2024-11-09 08:07:44,297 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 08:07:44,337 INFO L349 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2024-11-09 08:07:44,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 137 treesize of output 142