./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-shared-sll-before.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f 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/memsafety-broom/sll-shared-sll-before.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 3d5c47b12a731095d5a51b5ad7e19fee7b2131bbe4b3910b3108642fe52c085d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:22:45,219 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:22:45,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-10 15:22:45,293 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:22:45,293 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:22:45,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:22:45,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:22:45,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:22:45,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:22:45,314 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:22:45,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:22:45,314 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:22:45,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:22:45,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:22:45,316 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:22:45,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:22:45,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:22:45,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:22:45,318 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:22:45,318 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:22:45,318 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:22:45,319 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:22:45,319 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:22:45,319 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:22:45,319 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:22:45,320 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:22:45,320 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:22:45,320 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:22:45,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:22:45,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:22:45,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:22:45,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:22:45,322 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:22:45,322 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:22:45,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:22:45,323 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:22:45,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:22:45,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:22:45,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:22:45,324 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3d5c47b12a731095d5a51b5ad7e19fee7b2131bbe4b3910b3108642fe52c085d [2024-11-10 15:22:45,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:22:45,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:22:45,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:22:45,557 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:22:45,558 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:22:45,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-shared-sll-before.i [2024-11-10 15:22:46,986 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:22:47,258 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:22:47,259 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-shared-sll-before.i [2024-11-10 15:22:47,281 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/352e0ad7e/4826b42712c140deb2602da97f56b410/FLAG1554b31ca [2024-11-10 15:22:47,558 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/352e0ad7e/4826b42712c140deb2602da97f56b410 [2024-11-10 15:22:47,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:22:47,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:22:47,565 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:22:47,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:22:47,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:22:47,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:22:47" (1/1) ... [2024-11-10 15:22:47,572 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d452b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:47, skipping insertion in model container [2024-11-10 15:22:47,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:22:47" (1/1) ... [2024-11-10 15:22:47,641 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:22:47,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:22:47,983 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:22:48,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:22:48,070 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:22:48,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:48 WrapperNode [2024-11-10 15:22:48,070 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:22:48,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:22:48,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:22:48,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:22:48,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:48" (1/1) ... [2024-11-10 15:22:48,092 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:48" (1/1) ... [2024-11-10 15:22:48,110 INFO L138 Inliner]: procedures = 120, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 83 [2024-11-10 15:22:48,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:22:48,112 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:22:48,112 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:22:48,112 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:22:48,120 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:48" (1/1) ... [2024-11-10 15:22:48,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:48" (1/1) ... [2024-11-10 15:22:48,124 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:48" (1/1) ... [2024-11-10 15:22:48,148 INFO L175 MemorySlicer]: Split 12 memory accesses to 1 slices as follows [12]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 7 writes are split as follows [7]. [2024-11-10 15:22:48,149 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:48" (1/1) ... [2024-11-10 15:22:48,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:48" (1/1) ... [2024-11-10 15:22:48,155 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:48" (1/1) ... [2024-11-10 15:22:48,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:48" (1/1) ... [2024-11-10 15:22:48,157 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:48" (1/1) ... [2024-11-10 15:22:48,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:48" (1/1) ... [2024-11-10 15:22:48,160 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:22:48,161 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:22:48,161 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:22:48,162 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:22:48,162 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:48" (1/1) ... [2024-11-10 15:22:48,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:22:48,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:48,202 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-10 15:22:48,204 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-10 15:22:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2024-11-10 15:22:48,242 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2024-11-10 15:22:48,243 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-10 15:22:48,243 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-10 15:22:48,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:22:48,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:22:48,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:22:48,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:22:48,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:22:48,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:22:48,339 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:22:48,341 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:22:48,624 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-10 15:22:48,625 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:22:48,638 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:22:48,638 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:22:48,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:22:48 BoogieIcfgContainer [2024-11-10 15:22:48,639 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:22:48,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:22:48,641 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:22:48,644 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:22:48,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:22:47" (1/3) ... [2024-11-10 15:22:48,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2f0a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:22:48, skipping insertion in model container [2024-11-10 15:22:48,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:48" (2/3) ... [2024-11-10 15:22:48,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2f0a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:22:48, skipping insertion in model container [2024-11-10 15:22:48,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:22:48" (3/3) ... [2024-11-10 15:22:48,647 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-shared-sll-before.i [2024-11-10 15:22:48,663 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:22:48,663 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2024-11-10 15:22:48,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:22:48,714 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;@52ec97b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:22:48,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2024-11-10 15:22:48,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 55 states have (on average 1.709090909090909) internal successors, (94), 86 states have internal predecessors, (94), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:22:48,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:22:48,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:48,728 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:22:48,730 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zero_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:22:48,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:48,738 INFO L85 PathProgramCache]: Analyzing trace with hash 117363369, now seen corresponding path program 1 times [2024-11-10 15:22:48,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:48,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023149373] [2024-11-10 15:22:48,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:48,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:49,015 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-10 15:22:49,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:49,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023149373] [2024-11-10 15:22:49,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023149373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:49,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:49,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:22:49,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647047715] [2024-11-10 15:22:49,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:49,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:22:49,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:49,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:22:49,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:22:49,057 INFO L87 Difference]: Start difference. First operand has 93 states, 55 states have (on average 1.709090909090909) internal successors, (94), 86 states have internal predecessors, (94), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:22:49,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:49,193 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2024-11-10 15:22:49,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:22:49,195 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-10 15:22:49,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:49,201 INFO L225 Difference]: With dead ends: 92 [2024-11-10 15:22:49,201 INFO L226 Difference]: Without dead ends: 89 [2024-11-10 15:22:49,203 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-10 15:22:49,205 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:49,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 153 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:22:49,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-10 15:22:49,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-10 15:22:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 82 states have internal predecessors, (86), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:22:49,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2024-11-10 15:22:49,242 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 5 [2024-11-10 15:22:49,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:49,243 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2024-11-10 15:22:49,243 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:22:49,243 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2024-11-10 15:22:49,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:22:49,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:49,244 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:22:49,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:22:49,245 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zero_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:22:49,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:49,246 INFO L85 PathProgramCache]: Analyzing trace with hash 117363370, now seen corresponding path program 1 times [2024-11-10 15:22:49,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:49,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460478260] [2024-11-10 15:22:49,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:49,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:49,364 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-10 15:22:49,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:49,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460478260] [2024-11-10 15:22:49,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460478260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:49,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:49,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:22:49,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041945013] [2024-11-10 15:22:49,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:49,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:22:49,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:49,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:22:49,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:22:49,372 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:22:49,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:49,437 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2024-11-10 15:22:49,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:22:49,437 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-10 15:22:49,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:49,439 INFO L225 Difference]: With dead ends: 88 [2024-11-10 15:22:49,439 INFO L226 Difference]: Without dead ends: 88 [2024-11-10 15:22:49,440 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-10 15:22:49,442 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:49,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 158 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:22:49,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-10 15:22:49,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-10 15:22:49,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.6037735849056605) internal successors, (85), 81 states have internal predecessors, (85), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:22:49,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2024-11-10 15:22:49,452 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 5 [2024-11-10 15:22:49,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:49,454 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2024-11-10 15:22:49,454 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:22:49,455 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2024-11-10 15:22:49,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 15:22:49,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:49,456 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:49,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:22:49,456 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:22:49,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:49,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1706239506, now seen corresponding path program 1 times [2024-11-10 15:22:49,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:49,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850723985] [2024-11-10 15:22:49,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:49,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:49,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:49,581 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-10 15:22:49,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:49,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850723985] [2024-11-10 15:22:49,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850723985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:49,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:49,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:22:49,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805010320] [2024-11-10 15:22:49,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:49,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:22:49,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:49,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:22:49,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:22:49,589 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:22:49,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:49,719 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2024-11-10 15:22:49,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:22:49,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-10 15:22:49,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:49,721 INFO L225 Difference]: With dead ends: 86 [2024-11-10 15:22:49,721 INFO L226 Difference]: Without dead ends: 86 [2024-11-10 15:22:49,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:22:49,723 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 2 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:49,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 183 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:22:49,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-10 15:22:49,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-10 15:22:49,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 79 states have internal predecessors, (83), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:22:49,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2024-11-10 15:22:49,730 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 16 [2024-11-10 15:22:49,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:49,731 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2024-11-10 15:22:49,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:22:49,732 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2024-11-10 15:22:49,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 15:22:49,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:49,734 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:49,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:22:49,734 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zeroErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:22:49,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:49,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1706239505, now seen corresponding path program 1 times [2024-11-10 15:22:49,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:49,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829675909] [2024-11-10 15:22:49,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:49,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:49,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:49,880 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-10 15:22:49,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:49,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829675909] [2024-11-10 15:22:49,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829675909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:49,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:49,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:22:49,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201927496] [2024-11-10 15:22:49,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:49,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:22:49,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:49,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:22:49,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:22:49,886 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:22:49,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:49,972 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2024-11-10 15:22:49,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:22:49,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-10 15:22:49,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:49,973 INFO L225 Difference]: With dead ends: 84 [2024-11-10 15:22:49,973 INFO L226 Difference]: Without dead ends: 84 [2024-11-10 15:22:49,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:22:49,974 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 2 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:49,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 192 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:22:49,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-10 15:22:49,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-10 15:22:49,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.528301886792453) internal successors, (81), 77 states have internal predecessors, (81), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:22:49,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2024-11-10 15:22:49,986 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 16 [2024-11-10 15:22:49,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:49,987 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-11-10 15:22:49,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:22:49,987 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2024-11-10 15:22:49,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:22:49,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:49,988 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:49,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:22:49,988 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:22:49,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:49,989 INFO L85 PathProgramCache]: Analyzing trace with hash -891031782, now seen corresponding path program 1 times [2024-11-10 15:22:49,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:49,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451881278] [2024-11-10 15:22:49,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:49,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:50,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:50,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 15:22:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:50,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:22:50,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:50,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451881278] [2024-11-10 15:22:50,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451881278] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:50,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230389735] [2024-11-10 15:22:50,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:50,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:50,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:50,379 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-10 15:22:50,380 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-10 15:22:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:50,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 15:22:50,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:50,504 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-10 15:22:50,546 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-10 15:22:50,590 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:22:50,591 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-10 15:22:50,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-10 15:22:50,601 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:22:50,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230389735] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:22:50,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:22:50,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 11 [2024-11-10 15:22:50,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049774389] [2024-11-10 15:22:50,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:50,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:22:50,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:50,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:22:50,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-11-10 15:22:50,834 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:22:51,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:51,113 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2024-11-10 15:22:51,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:22:51,113 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 18 [2024-11-10 15:22:51,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:51,114 INFO L225 Difference]: With dead ends: 89 [2024-11-10 15:22:51,114 INFO L226 Difference]: Without dead ends: 89 [2024-11-10 15:22:51,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2024-11-10 15:22:51,115 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 8 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:51,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 395 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 282 Invalid, 0 Unknown, 93 Unchecked, 0.2s Time] [2024-11-10 15:22:51,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-10 15:22:51,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2024-11-10 15:22:51,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 79 states have internal predecessors, (85), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 15:22:51,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2024-11-10 15:22:51,127 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 18 [2024-11-10 15:22:51,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:51,127 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2024-11-10 15:22:51,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:22:51,129 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2024-11-10 15:22:51,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:22:51,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:51,130 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:51,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 15:22:51,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:51,331 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:22:51,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:51,331 INFO L85 PathProgramCache]: Analyzing trace with hash -891031781, now seen corresponding path program 1 times [2024-11-10 15:22:51,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:51,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657702504] [2024-11-10 15:22:51,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:51,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:51,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:51,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 15:22:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:51,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:22:51,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:51,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657702504] [2024-11-10 15:22:51,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657702504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:51,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597518127] [2024-11-10 15:22:51,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:51,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:51,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:51,613 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-10 15:22:51,616 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-10 15:22:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:51,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 15:22:51,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:51,696 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-10 15:22:51,878 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-10 15:22:51,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:51,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:22:51,922 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:22:51,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:22:51,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-10 15:22:51,946 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:52,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597518127] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:52,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:22:52,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2024-11-10 15:22:52,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049489901] [2024-11-10 15:22:52,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:52,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 15:22:52,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:52,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 15:22:52,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2024-11-10 15:22:52,042 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 17 states, 16 states have (on average 1.625) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:22:52,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:52,366 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2024-11-10 15:22:52,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:22:52,367 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.625) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 18 [2024-11-10 15:22:52,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:52,368 INFO L225 Difference]: With dead ends: 90 [2024-11-10 15:22:52,368 INFO L226 Difference]: Without dead ends: 90 [2024-11-10 15:22:52,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2024-11-10 15:22:52,372 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 9 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:52,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 560 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 299 Invalid, 0 Unknown, 93 Unchecked, 0.2s Time] [2024-11-10 15:22:52,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-10 15:22:52,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2024-11-10 15:22:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 78 states have internal predecessors, (83), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 15:22:52,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2024-11-10 15:22:52,380 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 18 [2024-11-10 15:22:52,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:52,380 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2024-11-10 15:22:52,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.625) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:22:52,381 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2024-11-10 15:22:52,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 15:22:52,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:52,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:52,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 15:22:52,585 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,SelfDestructingSolverStorable5 [2024-11-10 15:22:52,586 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:22:52,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:52,586 INFO L85 PathProgramCache]: Analyzing trace with hash -731578582, now seen corresponding path program 1 times [2024-11-10 15:22:52,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:52,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419656820] [2024-11-10 15:22:52,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:52,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:52,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:52,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:22:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:52,685 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-10 15:22:52,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:52,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419656820] [2024-11-10 15:22:52,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419656820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:52,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:52,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:22:52,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741691083] [2024-11-10 15:22:52,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:52,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:22:52,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:52,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:22:52,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:22:52,688 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:22:52,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:52,836 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2024-11-10 15:22:52,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:22:52,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-10 15:22:52,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:52,839 INFO L225 Difference]: With dead ends: 88 [2024-11-10 15:22:52,839 INFO L226 Difference]: Without dead ends: 88 [2024-11-10 15:22:52,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:22:52,840 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 11 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:52,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 292 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:22:52,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-10 15:22:52,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2024-11-10 15:22:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 75 states have internal predecessors, (80), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 15:22:52,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2024-11-10 15:22:52,851 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 22 [2024-11-10 15:22:52,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:52,851 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2024-11-10 15:22:52,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:22:52,851 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2024-11-10 15:22:52,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 15:22:52,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:52,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:52,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 15:22:52,852 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:22:52,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:52,853 INFO L85 PathProgramCache]: Analyzing trace with hash -731578581, now seen corresponding path program 1 times [2024-11-10 15:22:52,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:52,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096599006] [2024-11-10 15:22:52,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:52,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:52,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:52,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:22:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:53,098 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-10 15:22:53,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:53,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096599006] [2024-11-10 15:22:53,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096599006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:53,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:53,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:22:53,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142092675] [2024-11-10 15:22:53,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:53,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:22:53,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:53,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:22:53,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:22:53,100 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:22:53,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:53,224 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2024-11-10 15:22:53,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:22:53,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-10 15:22:53,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:53,225 INFO L225 Difference]: With dead ends: 87 [2024-11-10 15:22:53,225 INFO L226 Difference]: Without dead ends: 87 [2024-11-10 15:22:53,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:22:53,226 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 5 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:53,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 337 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:22:53,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-10 15:22:53,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2024-11-10 15:22:53,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 74 states have internal predecessors, (79), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 15:22:53,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2024-11-10 15:22:53,231 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 22 [2024-11-10 15:22:53,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:53,231 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2024-11-10 15:22:53,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:22:53,231 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2024-11-10 15:22:53,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 15:22:53,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:53,232 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:53,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 15:22:53,233 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:22:53,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:53,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1808060132, now seen corresponding path program 1 times [2024-11-10 15:22:53,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:53,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290293844] [2024-11-10 15:22:53,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:53,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:53,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:53,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:22:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:53,519 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-10 15:22:53,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:53,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290293844] [2024-11-10 15:22:53,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290293844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:53,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:53,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 15:22:53,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922627569] [2024-11-10 15:22:53,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:53,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:22:53,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:53,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:22:53,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:22:53,522 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:22:53,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:53,813 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2024-11-10 15:22:53,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:22:53,814 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-11-10 15:22:53,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:53,815 INFO L225 Difference]: With dead ends: 84 [2024-11-10 15:22:53,815 INFO L226 Difference]: Without dead ends: 84 [2024-11-10 15:22:53,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-10 15:22:53,815 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 30 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:53,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 324 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:22:53,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-10 15:22:53,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-10 15:22:53,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 76 states have internal predecessors, (83), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 15:22:53,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2024-11-10 15:22:53,828 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 29 [2024-11-10 15:22:53,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:53,828 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2024-11-10 15:22:53,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:22:53,829 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2024-11-10 15:22:53,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 15:22:53,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:53,830 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:53,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 15:22:53,830 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:22:53,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:53,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1808060133, now seen corresponding path program 1 times [2024-11-10 15:22:53,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:53,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445230698] [2024-11-10 15:22:53,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:53,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:54,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:54,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:22:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:54,215 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-10 15:22:54,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:54,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445230698] [2024-11-10 15:22:54,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445230698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:54,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:54,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 15:22:54,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139372313] [2024-11-10 15:22:54,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:54,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 15:22:54,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:54,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 15:22:54,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-10 15:22:54,217 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:22:54,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:54,616 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2024-11-10 15:22:54,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:22:54,616 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-11-10 15:22:54,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:54,618 INFO L225 Difference]: With dead ends: 99 [2024-11-10 15:22:54,618 INFO L226 Difference]: Without dead ends: 99 [2024-11-10 15:22:54,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-10 15:22:54,619 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 7 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:54,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 498 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:22:54,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-10 15:22:54,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-11-10 15:22:54,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 89 states have internal predecessors, (98), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:22:54,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2024-11-10 15:22:54,627 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 29 [2024-11-10 15:22:54,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:54,627 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2024-11-10 15:22:54,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:22:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2024-11-10 15:22:54,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:22:54,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:54,629 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:54,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 15:22:54,629 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:22:54,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:54,629 INFO L85 PathProgramCache]: Analyzing trace with hash 421257534, now seen corresponding path program 1 times [2024-11-10 15:22:54,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:54,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529873779] [2024-11-10 15:22:54,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:54,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:54,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:54,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 15:22:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:54,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 15:22:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:54,879 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:22:54,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:54,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529873779] [2024-11-10 15:22:54,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529873779] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:54,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916133213] [2024-11-10 15:22:54,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:54,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:54,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:54,882 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-10 15:22:54,883 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-10 15:22:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:54,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 15:22:54,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:54,978 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-10 15:22:54,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:22:54,998 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 17 treesize of output 9 [2024-11-10 15:22:55,021 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-10 15:22:55,038 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:22:55,039 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-10 15:22:55,049 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-10 15:22:55,050 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:22:55,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916133213] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:22:55,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:22:55,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 13 [2024-11-10 15:22:55,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498753595] [2024-11-10 15:22:55,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:55,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 15:22:55,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:55,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 15:22:55,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2024-11-10 15:22:55,173 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 15:22:55,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:55,432 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2024-11-10 15:22:55,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:22:55,433 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 30 [2024-11-10 15:22:55,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:55,434 INFO L225 Difference]: With dead ends: 97 [2024-11-10 15:22:55,434 INFO L226 Difference]: Without dead ends: 97 [2024-11-10 15:22:55,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2024-11-10 15:22:55,435 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 8 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:55,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 521 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 328 Invalid, 0 Unknown, 85 Unchecked, 0.2s Time] [2024-11-10 15:22:55,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-10 15:22:55,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-10 15:22:55,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 88 states have internal predecessors, (97), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:22:55,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2024-11-10 15:22:55,440 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 30 [2024-11-10 15:22:55,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:55,440 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2024-11-10 15:22:55,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 15:22:55,440 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2024-11-10 15:22:55,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:22:55,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:55,441 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:55,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 15:22:55,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:55,646 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:22:55,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:55,646 INFO L85 PathProgramCache]: Analyzing trace with hash 421257535, now seen corresponding path program 1 times [2024-11-10 15:22:55,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:55,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8590267] [2024-11-10 15:22:55,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:55,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:55,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:55,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 15:22:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:56,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 15:22:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:56,079 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:22:56,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:56,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8590267] [2024-11-10 15:22:56,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8590267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:56,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266803197] [2024-11-10 15:22:56,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:56,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:56,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:56,082 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-10 15:22:56,083 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-10 15:22:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:56,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-10 15:22:56,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:56,185 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-10 15:22:56,188 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-10 15:22:56,265 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-10 15:22:56,270 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-10 15:22:56,290 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 26 treesize of output 14 [2024-11-10 15:22:56,347 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-10 15:22:56,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:56,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:22:56,381 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:22:56,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:22:56,384 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-10 15:22:56,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:56,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266803197] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:56,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:22:56,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 16 [2024-11-10 15:22:56,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314013965] [2024-11-10 15:22:56,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:56,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 15:22:56,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:56,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 15:22:56,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=263, Unknown=1, NotChecked=32, Total=342 [2024-11-10 15:22:56,485 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 15:22:56,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:56,877 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2024-11-10 15:22:56,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:22:56,877 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 30 [2024-11-10 15:22:56,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:56,878 INFO L225 Difference]: With dead ends: 98 [2024-11-10 15:22:56,878 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 15:22:56,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=395, Unknown=1, NotChecked=40, Total=506 [2024-11-10 15:22:56,879 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 7 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:56,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 608 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 443 Invalid, 0 Unknown, 86 Unchecked, 0.3s Time] [2024-11-10 15:22:56,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 15:22:56,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2024-11-10 15:22:56,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 86 states have internal predecessors, (95), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 15:22:56,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2024-11-10 15:22:56,887 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 30 [2024-11-10 15:22:56,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:56,887 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2024-11-10 15:22:56,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 15:22:56,890 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2024-11-10 15:22:56,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:22:56,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:56,891 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:56,908 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-10 15:22:57,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:57,092 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:22:57,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:57,092 INFO L85 PathProgramCache]: Analyzing trace with hash -336326489, now seen corresponding path program 1 times [2024-11-10 15:22:57,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:57,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385669300] [2024-11-10 15:22:57,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:57,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:57,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:57,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:22:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:57,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 15:22:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:57,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:22:57,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:57,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385669300] [2024-11-10 15:22:57,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385669300] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:57,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579078589] [2024-11-10 15:22:57,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:57,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:57,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:57,284 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-10 15:22:57,285 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-10 15:22:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:57,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 15:22:57,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:57,406 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2024-11-10 15:22:57,436 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-10 15:22:57,437 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-10 15:22:57,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:22:57,439 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:22:57,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579078589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:57,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:22:57,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-10 15:22:57,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314230170] [2024-11-10 15:22:57,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:57,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:22:57,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:57,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:22:57,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-11-10 15:22:57,442 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:22:57,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:57,503 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2024-11-10 15:22:57,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:22:57,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2024-11-10 15:22:57,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:57,504 INFO L225 Difference]: With dead ends: 100 [2024-11-10 15:22:57,504 INFO L226 Difference]: Without dead ends: 100 [2024-11-10 15:22:57,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-11-10 15:22:57,505 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 9 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:57,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 150 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 100 Unchecked, 0.1s Time] [2024-11-10 15:22:57,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-10 15:22:57,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2024-11-10 15:22:57,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 89 states have internal predecessors, (100), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:22:57,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2024-11-10 15:22:57,510 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 32 [2024-11-10 15:22:57,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:57,511 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2024-11-10 15:22:57,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:22:57,511 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2024-11-10 15:22:57,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:22:57,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:57,516 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:57,531 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-10 15:22:57,716 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-10 15:22:57,717 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:22:57,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:57,717 INFO L85 PathProgramCache]: Analyzing trace with hash -336326488, now seen corresponding path program 1 times [2024-11-10 15:22:57,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:57,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100377426] [2024-11-10 15:22:57,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:57,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:57,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:57,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:22:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:57,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 15:22:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:58,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:22:58,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:58,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100377426] [2024-11-10 15:22:58,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100377426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:58,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578892987] [2024-11-10 15:22:58,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:58,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:58,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:58,045 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-10 15:22:58,046 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-10 15:22:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:58,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 15:22:58,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:58,270 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-10 15:22:58,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:58,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:22:58,314 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:22:58,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:22:58,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-10 15:22:58,333 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:58,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578892987] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:58,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:22:58,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2024-11-10 15:22:58,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534561404] [2024-11-10 15:22:58,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:58,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 15:22:58,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:58,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 15:22:58,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=319, Unknown=1, NotChecked=36, Total=420 [2024-11-10 15:22:58,420 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 15:22:58,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:58,626 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2024-11-10 15:22:58,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:22:58,627 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2024-11-10 15:22:58,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:58,627 INFO L225 Difference]: With dead ends: 107 [2024-11-10 15:22:58,628 INFO L226 Difference]: Without dead ends: 107 [2024-11-10 15:22:58,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=389, Unknown=1, NotChecked=40, Total=506 [2024-11-10 15:22:58,628 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 34 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:58,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 487 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 218 Invalid, 0 Unknown, 90 Unchecked, 0.1s Time] [2024-11-10 15:22:58,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-10 15:22:58,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2024-11-10 15:22:58,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 94 states have internal predecessors, (106), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:22:58,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2024-11-10 15:22:58,632 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 32 [2024-11-10 15:22:58,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:58,633 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2024-11-10 15:22:58,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 15:22:58,633 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2024-11-10 15:22:58,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:22:58,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:58,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:58,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-10 15:22:58,834 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-10 15:22:58,835 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:22:58,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:58,835 INFO L85 PathProgramCache]: Analyzing trace with hash 733339614, now seen corresponding path program 1 times [2024-11-10 15:22:58,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:58,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019187759] [2024-11-10 15:22:58,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:58,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:58,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:58,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:22:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:58,989 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-10 15:22:58,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:58,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019187759] [2024-11-10 15:22:58,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019187759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:58,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:58,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 15:22:58,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984752911] [2024-11-10 15:22:58,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:58,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:22:58,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:58,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:22:58,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:22:58,994 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:22:59,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:59,101 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2024-11-10 15:22:59,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:22:59,102 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-11-10 15:22:59,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:59,102 INFO L225 Difference]: With dead ends: 109 [2024-11-10 15:22:59,102 INFO L226 Difference]: Without dead ends: 109 [2024-11-10 15:22:59,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:22:59,103 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 26 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:59,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 533 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:22:59,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-10 15:22:59,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2024-11-10 15:22:59,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 94 states have internal predecessors, (104), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:22:59,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2024-11-10 15:22:59,107 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 32 [2024-11-10 15:22:59,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:59,107 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2024-11-10 15:22:59,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:22:59,107 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2024-11-10 15:22:59,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:22:59,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:59,108 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:59,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 15:22:59,109 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:22:59,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:59,109 INFO L85 PathProgramCache]: Analyzing trace with hash 734541154, now seen corresponding path program 1 times [2024-11-10 15:22:59,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:59,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807015551] [2024-11-10 15:22:59,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:59,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:59,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:59,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:22:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:59,250 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-10 15:22:59,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:59,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807015551] [2024-11-10 15:22:59,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807015551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:59,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:59,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:22:59,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268010622] [2024-11-10 15:22:59,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:59,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:22:59,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:59,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:22:59,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:22:59,253 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:22:59,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:59,397 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2024-11-10 15:22:59,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:22:59,398 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-11-10 15:22:59,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:59,398 INFO L225 Difference]: With dead ends: 107 [2024-11-10 15:22:59,399 INFO L226 Difference]: Without dead ends: 107 [2024-11-10 15:22:59,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:22:59,399 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 22 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:59,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 467 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:22:59,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-10 15:22:59,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-11-10 15:22:59,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 97 states have internal predecessors, (108), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:22:59,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2024-11-10 15:22:59,403 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 32 [2024-11-10 15:22:59,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:59,403 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2024-11-10 15:22:59,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:22:59,403 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2024-11-10 15:22:59,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-10 15:22:59,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:59,404 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:59,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 15:22:59,404 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:22:59,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:59,405 INFO L85 PathProgramCache]: Analyzing trace with hash 656297460, now seen corresponding path program 1 times [2024-11-10 15:22:59,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:59,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937681348] [2024-11-10 15:22:59,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:59,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:59,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:59,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:22:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:59,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 15:22:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:59,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:22:59,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:59,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937681348] [2024-11-10 15:22:59,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937681348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:59,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:59,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:22:59,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486748320] [2024-11-10 15:22:59,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:59,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:22:59,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:59,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:22:59,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:22:59,532 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:22:59,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:59,653 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2024-11-10 15:22:59,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:22:59,654 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-11-10 15:22:59,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:59,655 INFO L225 Difference]: With dead ends: 105 [2024-11-10 15:22:59,655 INFO L226 Difference]: Without dead ends: 105 [2024-11-10 15:22:59,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:22:59,656 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 4 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:59,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 339 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:22:59,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-10 15:22:59,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-10 15:22:59,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 96 states have internal predecessors, (106), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:22:59,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2024-11-10 15:22:59,659 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 35 [2024-11-10 15:22:59,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:59,659 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2024-11-10 15:22:59,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:22:59,660 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2024-11-10 15:22:59,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-10 15:22:59,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:59,660 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:59,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 15:22:59,660 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:22:59,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:59,661 INFO L85 PathProgramCache]: Analyzing trace with hash 656297461, now seen corresponding path program 1 times [2024-11-10 15:22:59,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:59,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316193904] [2024-11-10 15:22:59,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:59,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:59,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:59,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:22:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:59,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 15:22:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:59,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:22:59,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:59,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316193904] [2024-11-10 15:22:59,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316193904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:59,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:59,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:22:59,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725150511] [2024-11-10 15:22:59,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:59,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:22:59,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:59,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:22:59,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:22:59,922 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:23:00,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:00,043 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2024-11-10 15:23:00,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:23:00,044 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-11-10 15:23:00,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:00,044 INFO L225 Difference]: With dead ends: 104 [2024-11-10 15:23:00,045 INFO L226 Difference]: Without dead ends: 104 [2024-11-10 15:23:00,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:23:00,045 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 3 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:00,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 375 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:23:00,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-10 15:23:00,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-10 15:23:00,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 95 states have internal predecessors, (104), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:23:00,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2024-11-10 15:23:00,050 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 35 [2024-11-10 15:23:00,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:00,050 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2024-11-10 15:23:00,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:23:00,050 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2024-11-10 15:23:00,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 15:23:00,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:00,051 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:00,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 15:23:00,051 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:23:00,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:00,051 INFO L85 PathProgramCache]: Analyzing trace with hash 157856105, now seen corresponding path program 1 times [2024-11-10 15:23:00,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:00,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001476056] [2024-11-10 15:23:00,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:00,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:00,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:23:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:00,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:23:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:00,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:23:00,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:00,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001476056] [2024-11-10 15:23:00,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001476056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:00,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289473883] [2024-11-10 15:23:00,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:00,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:00,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:23:00,731 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-10 15:23:00,733 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-10 15:23:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:00,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-10 15:23:00,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:23:00,859 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-10 15:23:00,890 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-10 15:23:00,896 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-10 15:23:01,270 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:23:01,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:23:05,286 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0) (or (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0) (exists ((|v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#0.offset|))) (and (= |c_#memory_$Pointer$#0.offset| (store |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| .cse0 (select |c_#memory_$Pointer$#0.offset| .cse0))) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse0) (= (select (select |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0))))) (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| |c_ULTIMATE.start_main_~shared~0#1.base|))) is different from false [2024-11-10 15:23:05,288 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0) (or (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0) (exists ((|v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#0.offset|))) (and (= |c_#memory_$Pointer$#0.offset| (store |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| .cse0 (select |c_#memory_$Pointer$#0.offset| .cse0))) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse0) (= (select (select |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0))))) (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| |c_ULTIMATE.start_main_~shared~0#1.base|))) is different from true [2024-11-10 15:23:05,341 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 16 treesize of output 11 [2024-11-10 15:23:05,346 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 16 treesize of output 11 [2024-11-10 15:23:05,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:23:05,458 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 15 treesize of output 15 [2024-11-10 15:23:05,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:23:05,467 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 15 treesize of output 15 [2024-11-10 15:23:05,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:23:05,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:23:05,697 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_825 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~1#1.base| v_ArrVal_825) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0)) (forall ((v_ArrVal_824 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~1#1.base| v_ArrVal_824) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0))) is different from false [2024-11-10 15:23:05,708 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_824 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~ret9#1.base| v_ArrVal_824) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0)) (forall ((v_ArrVal_825 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~ret9#1.base| v_ArrVal_825) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0))) is different from false [2024-11-10 15:23:05,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289473883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:05,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:23:05,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 33 [2024-11-10 15:23:05,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723500449] [2024-11-10 15:23:05,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:23:05,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-10 15:23:05,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:05,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-10 15:23:05,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1113, Unknown=4, NotChecked=204, Total=1406 [2024-11-10 15:23:05,821 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand has 33 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 27 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:23:06,172 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|)) (.cse2 (= (select .cse0 0) 0))) (and (= (select .cse0 |c_ULTIMATE.start_main_~shared~0#1.offset|) 0) (= (select .cse1 0) 0) (= (select .cse1 |c_ULTIMATE.start_main_~shared~0#1.offset|) 0) (or .cse2 (exists ((|v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#0.offset|))) (and (= |c_#memory_$Pointer$#0.offset| (store |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| .cse3 (select |c_#memory_$Pointer$#0.offset| .cse3))) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse3) (= (select (select |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0))))) .cse2 (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| |c_ULTIMATE.start_main_~shared~0#1.base|))))) is different from false [2024-11-10 15:23:06,174 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|)) (.cse2 (= (select .cse0 0) 0))) (and (= (select .cse0 |c_ULTIMATE.start_main_~shared~0#1.offset|) 0) (= (select .cse1 0) 0) (= (select .cse1 |c_ULTIMATE.start_main_~shared~0#1.offset|) 0) (or .cse2 (exists ((|v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#0.offset|))) (and (= |c_#memory_$Pointer$#0.offset| (store |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| .cse3 (select |c_#memory_$Pointer$#0.offset| .cse3))) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse3) (= (select (select |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0))))) .cse2 (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| |c_ULTIMATE.start_main_~shared~0#1.base|))))) is different from true [2024-11-10 15:23:06,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:06,667 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2024-11-10 15:23:06,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 15:23:06,668 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 27 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2024-11-10 15:23:06,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:06,668 INFO L225 Difference]: With dead ends: 111 [2024-11-10 15:23:06,669 INFO L226 Difference]: Without dead ends: 111 [2024-11-10 15:23:06,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=147, Invalid=1933, Unknown=6, NotChecked=364, Total=2450 [2024-11-10 15:23:06,670 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 19 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:06,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1245 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1098 Invalid, 0 Unknown, 134 Unchecked, 0.5s Time] [2024-11-10 15:23:06,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-10 15:23:06,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2024-11-10 15:23:06,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 100 states have internal predecessors, (109), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:23:06,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2024-11-10 15:23:06,673 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 37 [2024-11-10 15:23:06,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:06,674 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2024-11-10 15:23:06,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 27 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:23:06,674 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2024-11-10 15:23:06,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 15:23:06,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:06,675 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:06,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-10 15:23:06,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:06,876 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:23:06,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:06,876 INFO L85 PathProgramCache]: Analyzing trace with hash -299158727, now seen corresponding path program 1 times [2024-11-10 15:23:06,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:06,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529167179] [2024-11-10 15:23:06,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:06,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:07,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:23:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:07,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:23:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:23:07,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:07,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529167179] [2024-11-10 15:23:07,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529167179] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:07,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075594865] [2024-11-10 15:23:07,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:07,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:07,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:23:07,253 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:23:07,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 15:23:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:07,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-10 15:23:07,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:23:07,384 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-10 15:23:07,440 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:23:07,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:23:07,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:23:07,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:23:07,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:23:07,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:23:07,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2024-11-10 15:23:07,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:23:07,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075594865] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:23:07,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:23:07,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 28 [2024-11-10 15:23:07,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009647832] [2024-11-10 15:23:07,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:23:07,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-10 15:23:07,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:07,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-10 15:23:07,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2024-11-10 15:23:07,797 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand has 29 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 22 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 15:23:08,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:08,542 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2024-11-10 15:23:08,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 15:23:08,544 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 22 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 40 [2024-11-10 15:23:08,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:08,545 INFO L225 Difference]: With dead ends: 141 [2024-11-10 15:23:08,545 INFO L226 Difference]: Without dead ends: 141 [2024-11-10 15:23:08,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=1294, Unknown=0, NotChecked=0, Total=1406 [2024-11-10 15:23:08,548 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 82 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:08,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 652 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 15:23:08,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-10 15:23:08,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 127. [2024-11-10 15:23:08,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 106 states have (on average 1.2547169811320755) internal successors, (133), 118 states have internal predecessors, (133), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:23:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2024-11-10 15:23:08,555 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 40 [2024-11-10 15:23:08,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:08,555 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2024-11-10 15:23:08,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 22 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 15:23:08,555 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2024-11-10 15:23:08,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 15:23:08,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:08,556 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:08,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-10 15:23:08,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:08,761 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:23:08,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:08,761 INFO L85 PathProgramCache]: Analyzing trace with hash -299158726, now seen corresponding path program 1 times [2024-11-10 15:23:08,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:08,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701876742] [2024-11-10 15:23:08,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:08,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:08,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:23:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:08,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:23:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:23:09,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:09,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701876742] [2024-11-10 15:23:09,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701876742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:23:09,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:23:09,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:23:09,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081488117] [2024-11-10 15:23:09,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:23:09,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:23:09,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:09,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:23:09,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:23:09,014 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:23:09,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:09,213 INFO L93 Difference]: Finished difference Result 161 states and 186 transitions. [2024-11-10 15:23:09,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:23:09,213 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2024-11-10 15:23:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:09,215 INFO L225 Difference]: With dead ends: 161 [2024-11-10 15:23:09,215 INFO L226 Difference]: Without dead ends: 161 [2024-11-10 15:23:09,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:23:09,216 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 7 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:09,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 436 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:23:09,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-10 15:23:09,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2024-11-10 15:23:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 136 states have (on average 1.2794117647058822) internal successors, (174), 148 states have internal predecessors, (174), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:23:09,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 186 transitions. [2024-11-10 15:23:09,224 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 186 transitions. Word has length 40 [2024-11-10 15:23:09,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:09,225 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 186 transitions. [2024-11-10 15:23:09,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:23:09,225 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 186 transitions. [2024-11-10 15:23:09,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 15:23:09,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:09,226 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:09,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 15:23:09,226 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:23:09,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:09,227 INFO L85 PathProgramCache]: Analyzing trace with hash -394469823, now seen corresponding path program 1 times [2024-11-10 15:23:09,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:09,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817021902] [2024-11-10 15:23:09,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:09,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:09,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:23:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:09,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 15:23:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:09,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 15:23:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:09,630 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:23:09,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:09,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817021902] [2024-11-10 15:23:09,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817021902] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:09,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641508253] [2024-11-10 15:23:09,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:09,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:09,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:23:09,632 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:23:09,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 15:23:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:09,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-10 15:23:09,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:23:09,770 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-10 15:23:09,773 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-10 15:23:09,918 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-10 15:23:09,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:23:09,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:23:09,945 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:23:09,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:23:10,019 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-10 15:23:10,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:23:10,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:23:10,063 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:23:10,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:23:10,090 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-10 15:23:10,090 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:23:10,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641508253] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:10,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:23:10,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2024-11-10 15:23:10,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132083357] [2024-11-10 15:23:10,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:23:10,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-10 15:23:10,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:10,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-10 15:23:10,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=491, Unknown=2, NotChecked=90, Total=650 [2024-11-10 15:23:10,208 INFO L87 Difference]: Start difference. First operand 157 states and 186 transitions. Second operand has 23 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 18 states have internal predecessors, (54), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-10 15:23:10,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:10,593 INFO L93 Difference]: Finished difference Result 180 states and 215 transitions. [2024-11-10 15:23:10,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 15:23:10,593 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 18 states have internal predecessors, (54), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2024-11-10 15:23:10,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:10,594 INFO L225 Difference]: With dead ends: 180 [2024-11-10 15:23:10,594 INFO L226 Difference]: Without dead ends: 180 [2024-11-10 15:23:10,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=674, Unknown=2, NotChecked=106, Total=870 [2024-11-10 15:23:10,595 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 10 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:10,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 710 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 575 Invalid, 0 Unknown, 211 Unchecked, 0.3s Time] [2024-11-10 15:23:10,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-10 15:23:10,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2024-11-10 15:23:10,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 155 states have (on average 1.2580645161290323) internal successors, (195), 167 states have internal predecessors, (195), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 15:23:10,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 211 transitions. [2024-11-10 15:23:10,600 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 211 transitions. Word has length 41 [2024-11-10 15:23:10,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:10,600 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 211 transitions. [2024-11-10 15:23:10,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 18 states have internal predecessors, (54), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-10 15:23:10,600 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 211 transitions. [2024-11-10 15:23:10,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 15:23:10,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:10,601 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:10,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-10 15:23:10,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:10,806 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:23:10,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:10,806 INFO L85 PathProgramCache]: Analyzing trace with hash 271233167, now seen corresponding path program 1 times [2024-11-10 15:23:10,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:10,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760846345] [2024-11-10 15:23:10,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:10,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:10,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:23:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:10,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:23:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:10,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:23:10,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:10,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760846345] [2024-11-10 15:23:10,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760846345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:23:10,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:23:10,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 15:23:10,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304108564] [2024-11-10 15:23:10,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:23:10,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:23:10,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:10,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:23:10,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:23:10,939 INFO L87 Difference]: Start difference. First operand 178 states and 211 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:23:11,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:11,046 INFO L93 Difference]: Finished difference Result 187 states and 220 transitions. [2024-11-10 15:23:11,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:23:11,047 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2024-11-10 15:23:11,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:11,048 INFO L225 Difference]: With dead ends: 187 [2024-11-10 15:23:11,048 INFO L226 Difference]: Without dead ends: 187 [2024-11-10 15:23:11,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:23:11,049 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 23 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:11,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 501 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:23:11,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-10 15:23:11,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 180. [2024-11-10 15:23:11,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 157 states have (on average 1.2356687898089171) internal successors, (194), 169 states have internal predecessors, (194), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 15:23:11,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 210 transitions. [2024-11-10 15:23:11,054 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 210 transitions. Word has length 42 [2024-11-10 15:23:11,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:11,054 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 210 transitions. [2024-11-10 15:23:11,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:23:11,054 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 210 transitions. [2024-11-10 15:23:11,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 15:23:11,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:11,055 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:11,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 15:23:11,055 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:23:11,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:11,056 INFO L85 PathProgramCache]: Analyzing trace with hash -180504867, now seen corresponding path program 1 times [2024-11-10 15:23:11,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:11,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507313558] [2024-11-10 15:23:11,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:11,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:11,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:23:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:11,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:23:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:11,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:23:11,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:11,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507313558] [2024-11-10 15:23:11,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507313558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:23:11,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:23:11,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:23:11,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405297966] [2024-11-10 15:23:11,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:23:11,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:23:11,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:11,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:23:11,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:23:11,192 INFO L87 Difference]: Start difference. First operand 180 states and 210 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:23:11,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:11,324 INFO L93 Difference]: Finished difference Result 185 states and 217 transitions. [2024-11-10 15:23:11,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:23:11,324 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2024-11-10 15:23:11,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:11,325 INFO L225 Difference]: With dead ends: 185 [2024-11-10 15:23:11,325 INFO L226 Difference]: Without dead ends: 185 [2024-11-10 15:23:11,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:23:11,326 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 19 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:11,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 459 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:23:11,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-10 15:23:11,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2024-11-10 15:23:11,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 161 states have (on average 1.2484472049689441) internal successors, (201), 173 states have internal predecessors, (201), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 15:23:11,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 217 transitions. [2024-11-10 15:23:11,330 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 217 transitions. Word has length 43 [2024-11-10 15:23:11,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:11,331 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 217 transitions. [2024-11-10 15:23:11,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:23:11,331 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 217 transitions. [2024-11-10 15:23:11,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-10 15:23:11,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:11,332 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:11,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 15:23:11,332 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:23:11,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:11,333 INFO L85 PathProgramCache]: Analyzing trace with hash 755624109, now seen corresponding path program 1 times [2024-11-10 15:23:11,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:11,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519833953] [2024-11-10 15:23:11,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:11,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:11,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:23:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:11,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:23:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:11,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 15:23:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:11,865 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:23:11,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:11,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519833953] [2024-11-10 15:23:11,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519833953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:11,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125414481] [2024-11-10 15:23:11,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:11,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:11,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:23:11,868 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:23:11,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-10 15:23:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:12,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-10 15:23:12,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:23:12,022 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-10 15:23:12,027 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-10 15:23:12,178 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:23:12,178 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-10 15:23:12,193 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-10 15:23:12,193 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-10 15:23:12,303 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-10 15:23:12,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:23:12,332 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:23:12,347 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-10 15:23:12,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-10 15:23:12,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2024-11-10 15:23:12,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:23:12,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125414481] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:12,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:23:12,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 22 [2024-11-10 15:23:12,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133406666] [2024-11-10 15:23:12,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:23:12,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-10 15:23:12,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:12,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-10 15:23:12,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=526, Unknown=1, NotChecked=46, Total=650 [2024-11-10 15:23:12,521 INFO L87 Difference]: Start difference. First operand 184 states and 217 transitions. Second operand has 23 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 19 states have internal predecessors, (54), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-10 15:23:12,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:12,958 INFO L93 Difference]: Finished difference Result 222 states and 259 transitions. [2024-11-10 15:23:12,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 15:23:12,958 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 19 states have internal predecessors, (54), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 45 [2024-11-10 15:23:12,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:12,959 INFO L225 Difference]: With dead ends: 222 [2024-11-10 15:23:12,960 INFO L226 Difference]: Without dead ends: 222 [2024-11-10 15:23:12,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=767, Unknown=1, NotChecked=56, Total=930 [2024-11-10 15:23:12,961 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 41 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:12,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 533 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 545 Invalid, 0 Unknown, 119 Unchecked, 0.3s Time] [2024-11-10 15:23:12,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-10 15:23:12,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 218. [2024-11-10 15:23:12,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 193 states have (on average 1.238341968911917) internal successors, (239), 205 states have internal predecessors, (239), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 15:23:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 259 transitions. [2024-11-10 15:23:12,965 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 259 transitions. Word has length 45 [2024-11-10 15:23:12,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:12,966 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 259 transitions. [2024-11-10 15:23:12,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 19 states have internal predecessors, (54), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-10 15:23:12,966 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 259 transitions. [2024-11-10 15:23:12,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 15:23:12,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:12,967 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:12,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-10 15:23:13,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-10 15:23:13,168 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:23:13,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:13,168 INFO L85 PathProgramCache]: Analyzing trace with hash -196656673, now seen corresponding path program 1 times [2024-11-10 15:23:13,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:13,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499323382] [2024-11-10 15:23:13,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:13,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:13,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:23:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:13,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:23:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:13,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 15:23:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:13,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 15:23:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:23:13,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:13,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499323382] [2024-11-10 15:23:13,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499323382] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:13,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688171273] [2024-11-10 15:23:13,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:13,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:13,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:23:13,662 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:23:13,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-10 15:23:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:13,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 15:23:13,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:23:13,837 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:23:13,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:23:13,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:23:13,893 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:23:13,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-10 15:23:13,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-10 15:23:13,916 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2024-11-10 15:23:13,940 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-10 15:23:13,940 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-10 15:23:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2024-11-10 15:23:13,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:23:13,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688171273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:13,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:23:13,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 23 [2024-11-10 15:23:13,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306679152] [2024-11-10 15:23:13,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:23:13,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 15:23:13,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:13,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 15:23:13,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=491, Unknown=1, NotChecked=44, Total=600 [2024-11-10 15:23:13,986 INFO L87 Difference]: Start difference. First operand 218 states and 259 transitions. Second operand has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 19 states have internal predecessors, (64), 3 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-10 15:23:14,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:14,221 INFO L93 Difference]: Finished difference Result 217 states and 257 transitions. [2024-11-10 15:23:14,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:23:14,221 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 19 states have internal predecessors, (64), 3 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 48 [2024-11-10 15:23:14,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:14,222 INFO L225 Difference]: With dead ends: 217 [2024-11-10 15:23:14,222 INFO L226 Difference]: Without dead ends: 217 [2024-11-10 15:23:14,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=712, Unknown=1, NotChecked=54, Total=870 [2024-11-10 15:23:14,223 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 11 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:14,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 585 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 359 Invalid, 0 Unknown, 71 Unchecked, 0.2s Time] [2024-11-10 15:23:14,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-10 15:23:14,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-11-10 15:23:14,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 193 states have (on average 1.2279792746113989) internal successors, (237), 204 states have internal predecessors, (237), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 15:23:14,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 257 transitions. [2024-11-10 15:23:14,228 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 257 transitions. Word has length 48 [2024-11-10 15:23:14,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:14,229 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 257 transitions. [2024-11-10 15:23:14,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 19 states have internal predecessors, (64), 3 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-10 15:23:14,229 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 257 transitions. [2024-11-10 15:23:14,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 15:23:14,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:14,230 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:14,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-10 15:23:14,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-10 15:23:14,431 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:23:14,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:14,431 INFO L85 PathProgramCache]: Analyzing trace with hash -196656672, now seen corresponding path program 1 times [2024-11-10 15:23:14,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:14,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884619862] [2024-11-10 15:23:14,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:14,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:14,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:23:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:14,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:23:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:14,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 15:23:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:15,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 15:23:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:15,126 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:23:15,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:15,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884619862] [2024-11-10 15:23:15,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884619862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:15,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131381386] [2024-11-10 15:23:15,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:15,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:15,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:23:15,129 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:23:15,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-10 15:23:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:15,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-10 15:23:15,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:23:15,328 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-10 15:23:15,404 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:23:15,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:23:15,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:23:15,437 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-10 15:23:15,506 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:23:15,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2024-11-10 15:23:15,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-10 15:23:15,526 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 34 treesize of output 18 [2024-11-10 15:23:15,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-10 15:23:15,568 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-10 15:23:15,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:23:15,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:23:15,590 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:23:15,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:23:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-10 15:23:15,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:23:15,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131381386] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:15,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:23:15,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 26 [2024-11-10 15:23:15,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300578715] [2024-11-10 15:23:15,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:23:15,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-10 15:23:15,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:15,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 15:23:15,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=682, Unknown=1, NotChecked=52, Total=812 [2024-11-10 15:23:15,680 INFO L87 Difference]: Start difference. First operand 217 states and 257 transitions. Second operand has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 20 states have internal predecessors, (64), 3 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-10 15:23:16,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:16,085 INFO L93 Difference]: Finished difference Result 214 states and 251 transitions. [2024-11-10 15:23:16,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 15:23:16,086 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 20 states have internal predecessors, (64), 3 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 48 [2024-11-10 15:23:16,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:16,087 INFO L225 Difference]: With dead ends: 214 [2024-11-10 15:23:16,087 INFO L226 Difference]: Without dead ends: 214 [2024-11-10 15:23:16,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=1055, Unknown=1, NotChecked=66, Total=1260 [2024-11-10 15:23:16,089 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 16 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:16,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 787 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 519 Invalid, 0 Unknown, 81 Unchecked, 0.2s Time] [2024-11-10 15:23:16,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-10 15:23:16,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2024-11-10 15:23:16,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 193 states have (on average 1.1968911917098446) internal successors, (231), 201 states have internal predecessors, (231), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 15:23:16,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 251 transitions. [2024-11-10 15:23:16,095 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 251 transitions. Word has length 48 [2024-11-10 15:23:16,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:16,095 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 251 transitions. [2024-11-10 15:23:16,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 20 states have internal predecessors, (64), 3 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-10 15:23:16,095 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 251 transitions. [2024-11-10 15:23:16,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 15:23:16,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:16,096 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:16,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-10 15:23:16,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-10 15:23:16,297 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:23:16,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:16,297 INFO L85 PathProgramCache]: Analyzing trace with hash -751376194, now seen corresponding path program 1 times [2024-11-10 15:23:16,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:16,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822366575] [2024-11-10 15:23:16,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:16,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:16,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:23:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:16,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:23:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:23:16,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:16,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822366575] [2024-11-10 15:23:16,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822366575] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:16,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88152182] [2024-11-10 15:23:16,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:16,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:16,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:23:16,801 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:23:16,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-10 15:23:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:16,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-10 15:23:16,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:23:16,967 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-10 15:23:16,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:23:16,978 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 19 treesize of output 18 [2024-11-10 15:23:16,986 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 19 treesize of output 18 [2024-11-10 15:23:17,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:23:17,148 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2024-11-10 15:23:17,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-10 15:23:17,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:23:17,162 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2024-11-10 15:23:17,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-11-10 15:23:17,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:23:17,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 15 treesize of output 15 [2024-11-10 15:23:17,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:23:17,295 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 15 treesize of output 15 [2024-11-10 15:23:17,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:23:17,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:23:18,052 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 15 treesize of output 13 [2024-11-10 15:23:18,057 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 102 treesize of output 98 [2024-11-10 15:23:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:23:18,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88152182] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:23:18,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:23:18,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 31 [2024-11-10 15:23:18,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977957040] [2024-11-10 15:23:18,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:23:18,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-10 15:23:18,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:18,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-10 15:23:18,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=854, Unknown=0, NotChecked=0, Total=930 [2024-11-10 15:23:18,081 INFO L87 Difference]: Start difference. First operand 214 states and 251 transitions. Second operand has 31 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 27 states have internal predecessors, (78), 1 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 15:23:18,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:18,638 INFO L93 Difference]: Finished difference Result 223 states and 256 transitions. [2024-11-10 15:23:18,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 15:23:18,639 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 27 states have internal predecessors, (78), 1 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2024-11-10 15:23:18,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:18,640 INFO L225 Difference]: With dead ends: 223 [2024-11-10 15:23:18,640 INFO L226 Difference]: Without dead ends: 223 [2024-11-10 15:23:18,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=134, Invalid=1506, Unknown=0, NotChecked=0, Total=1640 [2024-11-10 15:23:18,641 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 22 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:18,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1079 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:23:18,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-10 15:23:18,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2024-11-10 15:23:18,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 198 states have (on average 1.1919191919191918) internal successors, (236), 206 states have internal predecessors, (236), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 15:23:18,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 256 transitions. [2024-11-10 15:23:18,647 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 256 transitions. Word has length 48 [2024-11-10 15:23:18,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:18,648 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 256 transitions. [2024-11-10 15:23:18,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 27 states have internal predecessors, (78), 1 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 15:23:18,648 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 256 transitions. [2024-11-10 15:23:18,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 15:23:18,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:18,649 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:18,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-10 15:23:18,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-10 15:23:18,851 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:23:18,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:18,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1724275515, now seen corresponding path program 1 times [2024-11-10 15:23:18,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:18,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481709955] [2024-11-10 15:23:18,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:18,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:19,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:23:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:19,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 15:23:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:19,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 15:23:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:19,584 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:23:19,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:19,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481709955] [2024-11-10 15:23:19,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481709955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:19,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930251756] [2024-11-10 15:23:19,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:19,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:19,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:23:19,587 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:23:19,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-10 15:23:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:19,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-10 15:23:19,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:23:19,737 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-10 15:23:19,954 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 15:23:19,955 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 17 treesize of output 21 [2024-11-10 15:23:20,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:23:20,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:23:20,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-10 15:23:20,231 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-10 15:23:20,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-10 15:23:20,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-10 15:23:20,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:23:20,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2024-11-10 15:23:20,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-10 15:23:20,862 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:23:20,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:23:21,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930251756] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:21,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:23:21,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 45 [2024-11-10 15:23:21,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961015753] [2024-11-10 15:23:21,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:23:21,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-10 15:23:21,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:21,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-10 15:23:21,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2602, Unknown=0, NotChecked=0, Total=2756 [2024-11-10 15:23:21,272 INFO L87 Difference]: Start difference. First operand 219 states and 256 transitions. Second operand has 46 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 37 states have internal predecessors, (82), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:23:22,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:22,670 INFO L93 Difference]: Finished difference Result 237 states and 279 transitions. [2024-11-10 15:23:22,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 15:23:22,670 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 37 states have internal predecessors, (82), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2024-11-10 15:23:22,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:22,671 INFO L225 Difference]: With dead ends: 237 [2024-11-10 15:23:22,671 INFO L226 Difference]: Without dead ends: 237 [2024-11-10 15:23:22,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=277, Invalid=4279, Unknown=0, NotChecked=0, Total=4556 [2024-11-10 15:23:22,673 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 49 mSDsluCounter, 1478 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:22,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1548 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 15:23:22,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-10 15:23:22,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 225. [2024-11-10 15:23:22,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 204 states have (on average 1.196078431372549) internal successors, (244), 212 states have internal predecessors, (244), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 15:23:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 264 transitions. [2024-11-10 15:23:22,678 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 264 transitions. Word has length 49 [2024-11-10 15:23:22,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:22,678 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 264 transitions. [2024-11-10 15:23:22,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 37 states have internal predecessors, (82), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:23:22,679 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 264 transitions. [2024-11-10 15:23:22,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 15:23:22,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:22,679 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:22,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-10 15:23:22,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:22,884 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:23:22,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:22,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1724275514, now seen corresponding path program 1 times [2024-11-10 15:23:22,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:22,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122116613] [2024-11-10 15:23:22,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:22,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:23,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:23:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:23,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 15:23:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:23,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 15:23:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:23,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:23:23,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:23,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122116613] [2024-11-10 15:23:23,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122116613] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:23,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060815618] [2024-11-10 15:23:23,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:23,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:23,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:23:23,865 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:23:23,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-10 15:23:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:24,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-10 15:23:24,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:23:24,106 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-10 15:23:24,168 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-10 15:23:24,170 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-10 15:23:24,474 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:23:24,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:23:24,479 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 16 treesize of output 11 [2024-11-10 15:23:24,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-10 15:23:24,494 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-10 15:23:24,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-10 15:23:24,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-10 15:23:24,592 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 16 treesize of output 11 [2024-11-10 15:23:24,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:23:24,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-10 15:23:24,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:23:24,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-10 15:23:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:23:24,989 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:23:25,342 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1752 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~ret9#1.base| v_ArrVal_1752) |c_ULTIMATE.start_main_~shared~0#1.base|) 0))) (forall ((v_ArrVal_1753 (Array Int Int)) (v_ArrVal_1752 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~ret9#1.base| v_ArrVal_1752) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~ret9#1.base| v_ArrVal_1753) |c_ULTIMATE.start_main_~shared~0#1.base|) 0))))) is different from false [2024-11-10 15:23:25,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060815618] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:25,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:23:25,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2024-11-10 15:23:25,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905209569] [2024-11-10 15:23:25,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:23:25,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-10 15:23:25,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:25,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-10 15:23:25,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2283, Unknown=32, NotChecked=96, Total=2550 [2024-11-10 15:23:25,506 INFO L87 Difference]: Start difference. First operand 225 states and 264 transitions. Second operand has 42 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 36 states have internal predecessors, (84), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:23:26,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:26,559 INFO L93 Difference]: Finished difference Result 229 states and 269 transitions. [2024-11-10 15:23:26,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 15:23:26,560 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 36 states have internal predecessors, (84), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2024-11-10 15:23:26,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:26,561 INFO L225 Difference]: With dead ends: 229 [2024-11-10 15:23:26,561 INFO L226 Difference]: Without dead ends: 229 [2024-11-10 15:23:26,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=223, Invalid=3527, Unknown=36, NotChecked=120, Total=3906 [2024-11-10 15:23:26,562 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 27 mSDsluCounter, 1436 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:26,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1512 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 15:23:26,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-10 15:23:26,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2024-11-10 15:23:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 206 states have (on average 1.1893203883495145) internal successors, (245), 214 states have internal predecessors, (245), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 15:23:26,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 265 transitions. [2024-11-10 15:23:26,567 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 265 transitions. Word has length 49 [2024-11-10 15:23:26,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:26,568 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 265 transitions. [2024-11-10 15:23:26,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 36 states have internal predecessors, (84), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:23:26,568 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 265 transitions. [2024-11-10 15:23:26,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 15:23:26,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:26,569 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:26,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-10 15:23:26,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:26,770 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:23:26,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:26,770 INFO L85 PathProgramCache]: Analyzing trace with hash -518055724, now seen corresponding path program 1 times [2024-11-10 15:23:26,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:26,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503447220] [2024-11-10 15:23:26,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:26,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:27,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:23:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:27,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:23:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:27,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:23:27,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:27,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503447220] [2024-11-10 15:23:27,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503447220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:27,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099519819] [2024-11-10 15:23:27,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:27,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:27,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:23:27,306 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:23:27,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-10 15:23:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:27,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-10 15:23:27,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:23:27,939 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_destroy_internal_~l#1.base_30| Int) (|v_ULTIMATE.start_destroy_~l#1.base_18| Int)) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_internal_~l#1.base_30| 1) |v_ULTIMATE.start_destroy_~l#1.base_18|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_internal_~l#1.base_30| 0) |v_ULTIMATE.start_destroy_~l#1.base_18| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_internal_~l#1.base_30|) 0))) is different from true [2024-11-10 15:23:27,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-10 15:23:27,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:23:28,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099519819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:28,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:23:28,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 30 [2024-11-10 15:23:28,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979744583] [2024-11-10 15:23:28,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:23:28,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-10 15:23:28,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:28,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-10 15:23:28,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1102, Unknown=1, NotChecked=66, Total=1260 [2024-11-10 15:23:28,164 INFO L87 Difference]: Start difference. First operand 227 states and 265 transitions. Second operand has 31 states, 28 states have (on average 3.0) internal successors, (84), 25 states have internal predecessors, (84), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:23:28,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:28,596 INFO L93 Difference]: Finished difference Result 241 states and 278 transitions. [2024-11-10 15:23:28,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 15:23:28,597 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 3.0) internal successors, (84), 25 states have internal predecessors, (84), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 50 [2024-11-10 15:23:28,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:28,598 INFO L225 Difference]: With dead ends: 241 [2024-11-10 15:23:28,598 INFO L226 Difference]: Without dead ends: 215 [2024-11-10 15:23:28,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=1169, Unknown=1, NotChecked=68, Total=1332 [2024-11-10 15:23:28,599 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 3 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:28,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 684 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 944 Invalid, 0 Unknown, 109 Unchecked, 0.4s Time] [2024-11-10 15:23:28,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-10 15:23:28,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2024-11-10 15:23:28,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 194 states have (on average 1.1958762886597938) internal successors, (232), 202 states have internal predecessors, (232), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 15:23:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 252 transitions. [2024-11-10 15:23:28,616 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 252 transitions. Word has length 50 [2024-11-10 15:23:28,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:28,617 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 252 transitions. [2024-11-10 15:23:28,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 3.0) internal successors, (84), 25 states have internal predecessors, (84), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:23:28,617 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 252 transitions. [2024-11-10 15:23:28,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 15:23:28,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:28,618 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:28,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-10 15:23:28,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:28,819 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:23:28,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:28,819 INFO L85 PathProgramCache]: Analyzing trace with hash -82999327, now seen corresponding path program 1 times [2024-11-10 15:23:28,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:28,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799290889] [2024-11-10 15:23:28,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:28,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:29,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:23:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:29,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 15:23:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:29,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 15:23:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:23:29,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:29,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799290889] [2024-11-10 15:23:29,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799290889] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:29,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219760975] [2024-11-10 15:23:29,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:29,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:29,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:23:29,363 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:23:29,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-10 15:23:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:29,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-10 15:23:29,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:23:29,656 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-10 15:23:29,742 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 9 treesize of output 5 [2024-11-10 15:23:29,813 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:23:29,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:23:29,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-10 15:23:29,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:23:29,929 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 17 treesize of output 17 [2024-11-10 15:23:30,007 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:23:30,007 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:23:30,267 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_#t~ret9#1.base_40| Int) (v_ArrVal_1919 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret9#1.base_40| v_ArrVal_1919) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret9#1.base_40|) 0)))) is different from false [2024-11-10 15:23:30,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219760975] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:30,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:23:30,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 35 [2024-11-10 15:23:30,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762521959] [2024-11-10 15:23:30,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:23:30,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-10 15:23:30,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:30,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-10 15:23:30,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1440, Unknown=27, NotChecked=76, Total=1640 [2024-11-10 15:23:30,270 INFO L87 Difference]: Start difference. First operand 215 states and 252 transitions. Second operand has 36 states, 33 states have (on average 2.242424242424242) internal successors, (74), 29 states have internal predecessors, (74), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:23:31,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:31,186 INFO L93 Difference]: Finished difference Result 218 states and 257 transitions. [2024-11-10 15:23:31,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 15:23:31,187 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 2.242424242424242) internal successors, (74), 29 states have internal predecessors, (74), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 52 [2024-11-10 15:23:31,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:31,188 INFO L225 Difference]: With dead ends: 218 [2024-11-10 15:23:31,188 INFO L226 Difference]: Without dead ends: 218 [2024-11-10 15:23:31,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=186, Invalid=2760, Unknown=28, NotChecked=106, Total=3080 [2024-11-10 15:23:31,190 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 24 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:31,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1559 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 15:23:31,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-10 15:23:31,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2024-11-10 15:23:31,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 203 states have internal predecessors, (233), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 15:23:31,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 253 transitions. [2024-11-10 15:23:31,194 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 253 transitions. Word has length 52 [2024-11-10 15:23:31,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:31,194 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 253 transitions. [2024-11-10 15:23:31,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 2.242424242424242) internal successors, (74), 29 states have internal predecessors, (74), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:23:31,195 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 253 transitions. [2024-11-10 15:23:31,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-10 15:23:31,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:31,196 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:31,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-10 15:23:31,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:31,396 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:23:31,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:31,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1974256541, now seen corresponding path program 2 times [2024-11-10 15:23:31,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:31,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814509714] [2024-11-10 15:23:31,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:31,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:31,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:23:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:31,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 15:23:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:31,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 15:23:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:31,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-10 15:23:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:31,962 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:23:31,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:31,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814509714] [2024-11-10 15:23:31,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814509714] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:31,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101721844] [2024-11-10 15:23:31,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:23:31,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:31,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:23:31,965 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:23:31,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-10 15:23:32,148 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:23:32,148 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:23:32,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-10 15:23:32,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:23:32,307 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-10 15:23:32,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:23:32,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:23:32,347 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-10 15:23:32,348 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-10 15:23:32,469 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-10 15:23:32,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:23:32,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:23:32,497 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:23:32,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:23:32,571 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 4 not checked. [2024-11-10 15:23:32,571 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:23:32,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101721844] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:32,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:23:32,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 30 [2024-11-10 15:23:32,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934366732] [2024-11-10 15:23:32,676 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:23:32,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-10 15:23:32,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:32,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-10 15:23:32,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=791, Unknown=2, NotChecked=114, Total=992 [2024-11-10 15:23:32,677 INFO L87 Difference]: Start difference. First operand 216 states and 253 transitions. Second operand has 31 states, 29 states have (on average 2.793103448275862) internal successors, (81), 26 states have internal predecessors, (81), 7 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-10 15:23:33,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:33,174 INFO L93 Difference]: Finished difference Result 216 states and 247 transitions. [2024-11-10 15:23:33,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 15:23:33,174 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.793103448275862) internal successors, (81), 26 states have internal predecessors, (81), 7 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 53 [2024-11-10 15:23:33,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:33,175 INFO L225 Difference]: With dead ends: 216 [2024-11-10 15:23:33,175 INFO L226 Difference]: Without dead ends: 216 [2024-11-10 15:23:33,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=1148, Unknown=2, NotChecked=138, Total=1406 [2024-11-10 15:23:33,176 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 38 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 203 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:33,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1123 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 759 Invalid, 0 Unknown, 203 Unchecked, 0.3s Time] [2024-11-10 15:23:33,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-10 15:23:33,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 182. [2024-11-10 15:23:33,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 163 states have (on average 1.1840490797546013) internal successors, (193), 171 states have internal predecessors, (193), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 15:23:33,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 209 transitions. [2024-11-10 15:23:33,180 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 209 transitions. Word has length 53 [2024-11-10 15:23:33,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:33,181 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 209 transitions. [2024-11-10 15:23:33,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.793103448275862) internal successors, (81), 26 states have internal predecessors, (81), 7 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-10 15:23:33,181 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 209 transitions. [2024-11-10 15:23:33,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-10 15:23:33,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:33,182 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:33,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-10 15:23:33,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:33,382 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:23:33,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:33,383 INFO L85 PathProgramCache]: Analyzing trace with hash 972784433, now seen corresponding path program 1 times [2024-11-10 15:23:33,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:33,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122686571] [2024-11-10 15:23:33,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:33,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:33,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:23:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:34,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:23:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:34,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 15:23:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:34,414 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:23:34,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:34,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122686571] [2024-11-10 15:23:34,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122686571] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:34,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374778711] [2024-11-10 15:23:34,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:34,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:34,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:23:34,416 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:23:34,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-10 15:23:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:34,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-10 15:23:34,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:23:34,587 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-10 15:23:34,624 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-10 15:23:34,629 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-10 15:23:34,957 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:23:34,958 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-10 15:23:34,977 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-10 15:23:34,978 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-10 15:23:34,983 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 16 treesize of output 11 [2024-11-10 15:23:35,062 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 16 treesize of output 11 [2024-11-10 15:23:35,067 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 16 treesize of output 11 [2024-11-10 15:23:35,154 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:23:35,154 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 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:23:39,160 WARN L851 $PredicateComparison]: unable to prove that (and (or (= (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0) (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| |c_#memory_$Pointer$#0.base|))) (and (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| .cse0 (select |c_#memory_$Pointer$#0.base| .cse0)) |c_#memory_$Pointer$#0.base|) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_create_#t~ret11#1.base|))))) (not (= |c_ULTIMATE.start_main_~shared~0#1.base| |c_ULTIMATE.start_create_~now~1#1.base|)) (not (= |c_ULTIMATE.start_create_#t~ret11#1.base| |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0)) is different from false [2024-11-10 15:23:39,163 WARN L873 $PredicateComparison]: unable to prove that (and (or (= (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0) (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| |c_#memory_$Pointer$#0.base|))) (and (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| .cse0 (select |c_#memory_$Pointer$#0.base| .cse0)) |c_#memory_$Pointer$#0.base|) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0) (= .cse0 |c_ULTIMATE.start_create_#t~ret11#1.base|))))) (not (= |c_ULTIMATE.start_main_~shared~0#1.base| |c_ULTIMATE.start_create_~now~1#1.base|)) (not (= |c_ULTIMATE.start_create_#t~ret11#1.base| |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0)) is different from true [2024-11-10 15:23:39,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:23:39,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:23:39,323 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2024-11-10 15:23:39,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 52 [2024-11-10 15:23:39,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2024-11-10 15:23:39,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-10 15:23:39,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:23:39,432 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 15 treesize of output 15 [2024-11-10 15:23:39,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:23:39,437 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 15 treesize of output 15 [2024-11-10 15:23:39,538 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:23:39,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:23:39,664 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2161 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2161) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0)) (forall ((v_ArrVal_2162 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2162) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0))) is different from false [2024-11-10 15:23:39,671 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~1#1.base|) |c_ULTIMATE.start_create_~now~1#1.offset|))) (and (forall ((v_ArrVal_2161 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2161) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0)) (forall ((v_ArrVal_2162 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2162) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0)))) is different from false [2024-11-10 15:23:39,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374778711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:39,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:23:39,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 43 [2024-11-10 15:23:39,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89682501] [2024-11-10 15:23:39,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:23:39,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-10 15:23:39,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:39,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-10 15:23:39,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1919, Unknown=40, NotChecked=270, Total=2352 [2024-11-10 15:23:39,916 INFO L87 Difference]: Start difference. First operand 182 states and 209 transitions. Second operand has 43 states, 41 states have (on average 1.951219512195122) internal successors, (80), 35 states have internal predecessors, (80), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:23:40,471 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse1 (= (select .cse3 0) 0)) (.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~shared~0#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_main_~shared~0#1.offset|) 0) (or .cse1 (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| |c_#memory_$Pointer$#0.base|))) (and (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| .cse2 (select |c_#memory_$Pointer$#0.base| .cse2)) |c_#memory_$Pointer$#0.base|) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0) (= .cse2 |c_ULTIMATE.start_create_#t~ret11#1.base|))))) .cse1 (= (select .cse3 |c_ULTIMATE.start_main_~shared~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~shared~0#1.base| |c_ULTIMATE.start_create_~now~1#1.base|)) (not (= |c_ULTIMATE.start_create_#t~ret11#1.base| |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (select .cse0 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~shared~0#1.base|) 1)))) is different from false [2024-11-10 15:23:40,472 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse1 (= (select .cse3 0) 0)) (.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~shared~0#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_main_~shared~0#1.offset|) 0) (or .cse1 (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| |c_#memory_$Pointer$#0.base|))) (and (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| .cse2 (select |c_#memory_$Pointer$#0.base| .cse2)) |c_#memory_$Pointer$#0.base|) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_54| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0) (= .cse2 |c_ULTIMATE.start_create_#t~ret11#1.base|))))) .cse1 (= (select .cse3 |c_ULTIMATE.start_main_~shared~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~shared~0#1.base| |c_ULTIMATE.start_create_~now~1#1.base|)) (not (= |c_ULTIMATE.start_create_#t~ret11#1.base| |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (select .cse0 0) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~shared~0#1.base|) 1)))) is different from true [2024-11-10 15:23:40,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:40,945 INFO L93 Difference]: Finished difference Result 205 states and 235 transitions. [2024-11-10 15:23:40,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 15:23:40,945 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 1.951219512195122) internal successors, (80), 35 states have internal predecessors, (80), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 53 [2024-11-10 15:23:40,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:40,946 INFO L225 Difference]: With dead ends: 205 [2024-11-10 15:23:40,946 INFO L226 Difference]: Without dead ends: 205 [2024-11-10 15:23:40,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=221, Invalid=3407, Unknown=48, NotChecked=484, Total=4160 [2024-11-10 15:23:40,947 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 14 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:40,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1201 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1264 Invalid, 0 Unknown, 150 Unchecked, 0.6s Time] [2024-11-10 15:23:40,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-10 15:23:40,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2024-11-10 15:23:40,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 184 states have (on average 1.1684782608695652) internal successors, (215), 192 states have internal predecessors, (215), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 15:23:40,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 233 transitions. [2024-11-10 15:23:40,951 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 233 transitions. Word has length 53 [2024-11-10 15:23:40,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:40,952 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 233 transitions. [2024-11-10 15:23:40,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 1.951219512195122) internal successors, (80), 35 states have internal predecessors, (80), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:23:40,952 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 233 transitions. [2024-11-10 15:23:40,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 15:23:40,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:40,952 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:40,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-10 15:23:41,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:41,153 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:23:41,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:41,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2075503730, now seen corresponding path program 1 times [2024-11-10 15:23:41,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:41,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186398441] [2024-11-10 15:23:41,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:41,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:41,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:23:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:41,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 15:23:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:41,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 15:23:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:23:41,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:41,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186398441] [2024-11-10 15:23:41,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186398441] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:41,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760936079] [2024-11-10 15:23:41,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:41,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:41,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:23:41,376 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:23:41,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-10 15:23:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:41,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 15:23:41,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:23:41,702 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 15:23:41,702 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:23:41,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:23:41,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2024-11-10 15:23:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 15:23:41,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760936079] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:23:41,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:23:41,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 17 [2024-11-10 15:23:41,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977475433] [2024-11-10 15:23:41,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:23:41,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 15:23:41,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:23:41,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 15:23:41,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-11-10 15:23:41,826 INFO L87 Difference]: Start difference. First operand 204 states and 233 transitions. Second operand has 18 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 16 states have internal predecessors, (84), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-10 15:23:41,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:23:41,981 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2024-11-10 15:23:41,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:23:41,981 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 16 states have internal predecessors, (84), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2024-11-10 15:23:41,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:23:41,982 INFO L225 Difference]: With dead ends: 223 [2024-11-10 15:23:41,982 INFO L226 Difference]: Without dead ends: 223 [2024-11-10 15:23:41,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-11-10 15:23:41,983 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 14 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:23:41,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 626 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:23:41,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-10 15:23:41,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 218. [2024-11-10 15:23:41,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 198 states have (on average 1.1818181818181819) internal successors, (234), 206 states have internal predecessors, (234), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 15:23:41,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 252 transitions. [2024-11-10 15:23:41,987 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 252 transitions. Word has length 56 [2024-11-10 15:23:41,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:23:41,987 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 252 transitions. [2024-11-10 15:23:41,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 16 states have internal predecessors, (84), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-10 15:23:41,987 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 252 transitions. [2024-11-10 15:23:41,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-10 15:23:41,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:23:41,988 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:23:42,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-10 15:23:42,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-10 15:23:42,189 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-10 15:23:42,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:23:42,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1017244086, now seen corresponding path program 2 times [2024-11-10 15:23:42,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:23:42,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883178499] [2024-11-10 15:23:42,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:23:42,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:23:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:42,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:23:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:42,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 15:23:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:42,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 15:23:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:23:43,142 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:23:43,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:23:43,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883178499] [2024-11-10 15:23:43,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883178499] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:23:43,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328115546] [2024-11-10 15:23:43,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:23:43,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:23:43,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:23:43,144 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:23:43,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-10 15:23:43,320 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:23:43,321 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:23:43,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-11-10 15:23:43,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:23:43,367 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-10 15:23:43,398 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-10 15:23:43,403 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-10 15:23:43,566 INFO L349 Elim1Store]: treesize reduction 29, result has 44.2 percent of original size [2024-11-10 15:23:43,566 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 27 [2024-11-10 15:23:43,582 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-10 15:23:43,582 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-10 15:23:44,191 INFO L349 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2024-11-10 15:23:44,191 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 86 treesize of output 104 [2024-11-10 15:23:48,817 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| |c_ULTIMATE.start_main_~shared~0#1.base|)) (let ((.cse31 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse19 (exists ((v_prenex_15 Int)) (let ((.cse43 (select .cse31 v_prenex_15))) (and (<= 0 v_prenex_15) (= (select (select |c_#memory_$Pointer$#0.base| .cse43) 0) 0) (= .cse43 |c_ULTIMATE.start_main_~shared~0#1.base|) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|))))) (.cse29 (= (select .cse31 0) |c_ULTIMATE.start_main_~shared~0#1.base|)) (.cse23 (<= 0 |c_ULTIMATE.start_main_~shared~0#1.offset|))) (let ((.cse25 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse42 (select .cse31 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (not (= .cse42 |c_ULTIMATE.start_main_~shared~0#1.base|)) (not (= .cse42 |c_ULTIMATE.start_create_#t~ret9#1.base|)))))) (.cse24 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse40 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|)) (.cse41 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| (select .cse40 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (= (select .cse40 0) |c_ULTIMATE.start_main_~shared~0#1.base|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse41 (select |c_#memory_$Pointer$#0.base| .cse41)) |c_#memory_$Pointer$#0.base|) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse41))))) (.cse6 (and .cse23 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse38 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|)) (.cse39 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (not (= (select .cse38 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (select .cse38 0) |c_ULTIMATE.start_main_~shared~0#1.base|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse39 (select |c_#memory_$Pointer$#0.base| .cse39)) |c_#memory_$Pointer$#0.base|) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse39)))))) (.cse7 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse35 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|)) (.cse36 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (not (= (select .cse35 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse36 (select |c_#memory_$Pointer$#0.base| .cse36)) |c_#memory_$Pointer$#0.base|) (exists ((v_prenex_15 Int)) (let ((.cse37 (select .cse35 v_prenex_15))) (and (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse37) 0) 0) (<= 0 v_prenex_15) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse37 |c_ULTIMATE.start_main_~shared~0#1.base|)))) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse36))))) (.cse1 (exists ((|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse34 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |c_#memory_$Pointer$#0.offset|))) (and (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse34) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse34 (select |c_#memory_$Pointer$#0.offset| .cse34)) |c_#memory_$Pointer$#0.offset|))))) (.cse20 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (not (= (select .cse31 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_create_#t~ret9#1.base|)))) (.cse0 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (not (= (select .cse31 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_main_~shared~0#1.base|)))) (.cse2 (or .cse19 (and .cse29 .cse23)))) (or (and .cse0 .cse1 .cse2) (and (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse3 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse4 (select .cse3 v_prenex_15)) (.cse5 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| (select .cse3 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse4) 0) 0) (<= 0 v_prenex_15) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse5 (select |c_#memory_$Pointer$#0.base| .cse5)) |c_#memory_$Pointer$#0.base|) (= .cse4 |c_ULTIMATE.start_main_~shared~0#1.base|) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse5))))) .cse1) .cse6 .cse7 (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse9 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|)) (.cse10 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse8 (select .cse9 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse8)) (not (= .cse8 |c_ULTIMATE.start_main_~shared~0#1.base|))))) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse10 (select |c_#memory_$Pointer$#0.base| .cse10)) |c_#memory_$Pointer$#0.base|) (exists ((v_prenex_15 Int)) (let ((.cse11 (select .cse9 v_prenex_15))) (and (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse11) 0) 0) (<= 0 v_prenex_15) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse11 |c_ULTIMATE.start_main_~shared~0#1.base|)))) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse10)))) (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse12 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse12 (select |c_#memory_$Pointer$#0.base| .cse12)) |c_#memory_$Pointer$#0.base|) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse12) (exists ((|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse13 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |c_#memory_$Pointer$#0.offset|))) (and (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse13) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse13 (select |c_#memory_$Pointer$#0.offset| .cse13)) |c_#memory_$Pointer$#0.offset|) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse14 (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|) |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse14)) (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_main_~shared~0#1.offset|) (= (select (select |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse14) 0) 0) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse14) 0) 0) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))))))))) (and (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse18 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse15 (select .cse18 |ULTIMATE.start_create_internal_~now~0#1.offset|)) (.cse16 (select .cse18 v_prenex_15)) (.cse17 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse15)) (not (= .cse15 |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse16) 0) 0) (<= 0 v_prenex_15) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse17 (select |c_#memory_$Pointer$#0.base| .cse17)) |c_#memory_$Pointer$#0.base|) (= .cse16 |c_ULTIMATE.start_main_~shared~0#1.base|) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse17))))) .cse1) (and .cse19 .cse1 .cse20) (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse21 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse21 (select |c_#memory_$Pointer$#0.base| .cse21)) |c_#memory_$Pointer$#0.base|) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse21) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse22 (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|) |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse22)) (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_main_~shared~0#1.offset|) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse22) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse22) 0) 0) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|))))))) (and .cse23 .cse24) (and .cse19 .cse25) (and .cse19 .cse20) (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse26 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|)) (.cse27 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| (select .cse26 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse27 (select |c_#memory_$Pointer$#0.base| .cse27)) |c_#memory_$Pointer$#0.base|) (exists ((v_prenex_15 Int)) (let ((.cse28 (select .cse26 v_prenex_15))) (and (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse28) 0) 0) (<= 0 v_prenex_15) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse28 |c_ULTIMATE.start_main_~shared~0#1.base|)))) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse27)))) (and .cse19 .cse1 .cse25) (and .cse1 .cse23 .cse24) (and (or .cse6 .cse7) .cse1) (and .cse29 .cse1 .cse23 .cse20) (and .cse29 .cse23 .cse20) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse30 (select .cse31 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_main_~shared~0#1.offset|) (not (= .cse30 |c_ULTIMATE.start_create_#t~ret9#1.base|)) (= (select (select |c_#memory_$Pointer$#0.base| .cse30) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse30) 0) 0) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (exists ((|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse32 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |c_#memory_$Pointer$#0.offset|))) (and (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse32) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse33 (select .cse31 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_main_~shared~0#1.offset|) (not (= .cse33 |c_ULTIMATE.start_create_#t~ret9#1.base|)) (= (select (select |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse33) 0) 0) (= (select (select |c_#memory_$Pointer$#0.base| .cse33) 0) 0) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse32 (select |c_#memory_$Pointer$#0.offset| .cse32)) |c_#memory_$Pointer$#0.offset|)))) (and .cse0 .cse2)))))) is different from false [2024-11-10 15:23:48,824 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| |c_ULTIMATE.start_main_~shared~0#1.base|)) (let ((.cse31 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse19 (exists ((v_prenex_15 Int)) (let ((.cse43 (select .cse31 v_prenex_15))) (and (<= 0 v_prenex_15) (= (select (select |c_#memory_$Pointer$#0.base| .cse43) 0) 0) (= .cse43 |c_ULTIMATE.start_main_~shared~0#1.base|) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|))))) (.cse29 (= (select .cse31 0) |c_ULTIMATE.start_main_~shared~0#1.base|)) (.cse23 (<= 0 |c_ULTIMATE.start_main_~shared~0#1.offset|))) (let ((.cse25 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse42 (select .cse31 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (not (= .cse42 |c_ULTIMATE.start_main_~shared~0#1.base|)) (not (= .cse42 |c_ULTIMATE.start_create_#t~ret9#1.base|)))))) (.cse24 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse40 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|)) (.cse41 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| (select .cse40 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (= (select .cse40 0) |c_ULTIMATE.start_main_~shared~0#1.base|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse41 (select |c_#memory_$Pointer$#0.base| .cse41)) |c_#memory_$Pointer$#0.base|) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse41))))) (.cse6 (and .cse23 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse38 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|)) (.cse39 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (not (= (select .cse38 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (select .cse38 0) |c_ULTIMATE.start_main_~shared~0#1.base|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse39 (select |c_#memory_$Pointer$#0.base| .cse39)) |c_#memory_$Pointer$#0.base|) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse39)))))) (.cse7 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse35 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|)) (.cse36 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (not (= (select .cse35 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse36 (select |c_#memory_$Pointer$#0.base| .cse36)) |c_#memory_$Pointer$#0.base|) (exists ((v_prenex_15 Int)) (let ((.cse37 (select .cse35 v_prenex_15))) (and (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse37) 0) 0) (<= 0 v_prenex_15) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse37 |c_ULTIMATE.start_main_~shared~0#1.base|)))) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse36))))) (.cse1 (exists ((|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse34 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |c_#memory_$Pointer$#0.offset|))) (and (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse34) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse34 (select |c_#memory_$Pointer$#0.offset| .cse34)) |c_#memory_$Pointer$#0.offset|))))) (.cse20 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (not (= (select .cse31 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_create_#t~ret9#1.base|)))) (.cse0 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (not (= (select .cse31 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_main_~shared~0#1.base|)))) (.cse2 (or .cse19 (and .cse29 .cse23)))) (or (and .cse0 .cse1 .cse2) (and (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse3 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse4 (select .cse3 v_prenex_15)) (.cse5 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| (select .cse3 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse4) 0) 0) (<= 0 v_prenex_15) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse5 (select |c_#memory_$Pointer$#0.base| .cse5)) |c_#memory_$Pointer$#0.base|) (= .cse4 |c_ULTIMATE.start_main_~shared~0#1.base|) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse5))))) .cse1) .cse6 .cse7 (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse9 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|)) (.cse10 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse8 (select .cse9 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse8)) (not (= .cse8 |c_ULTIMATE.start_main_~shared~0#1.base|))))) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse10 (select |c_#memory_$Pointer$#0.base| .cse10)) |c_#memory_$Pointer$#0.base|) (exists ((v_prenex_15 Int)) (let ((.cse11 (select .cse9 v_prenex_15))) (and (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse11) 0) 0) (<= 0 v_prenex_15) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse11 |c_ULTIMATE.start_main_~shared~0#1.base|)))) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse10)))) (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse12 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse12 (select |c_#memory_$Pointer$#0.base| .cse12)) |c_#memory_$Pointer$#0.base|) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse12) (exists ((|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse13 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |c_#memory_$Pointer$#0.offset|))) (and (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse13) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse13 (select |c_#memory_$Pointer$#0.offset| .cse13)) |c_#memory_$Pointer$#0.offset|) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse14 (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|) |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse14)) (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_main_~shared~0#1.offset|) (= (select (select |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse14) 0) 0) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse14) 0) 0) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))))))))) (and (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse18 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse15 (select .cse18 |ULTIMATE.start_create_internal_~now~0#1.offset|)) (.cse16 (select .cse18 v_prenex_15)) (.cse17 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse15)) (not (= .cse15 |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse16) 0) 0) (<= 0 v_prenex_15) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse17 (select |c_#memory_$Pointer$#0.base| .cse17)) |c_#memory_$Pointer$#0.base|) (= .cse16 |c_ULTIMATE.start_main_~shared~0#1.base|) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse17))))) .cse1) (and .cse19 .cse1 .cse20) (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse21 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse21 (select |c_#memory_$Pointer$#0.base| .cse21)) |c_#memory_$Pointer$#0.base|) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse21) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse22 (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|) |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse22)) (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_main_~shared~0#1.offset|) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse22) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse22) 0) 0) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|))))))) (and .cse23 .cse24) (and .cse19 .cse25) (and .cse19 .cse20) (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse26 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|)) (.cse27 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| (select .cse26 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse27 (select |c_#memory_$Pointer$#0.base| .cse27)) |c_#memory_$Pointer$#0.base|) (exists ((v_prenex_15 Int)) (let ((.cse28 (select .cse26 v_prenex_15))) (and (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse28) 0) 0) (<= 0 v_prenex_15) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse28 |c_ULTIMATE.start_main_~shared~0#1.base|)))) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse27)))) (and .cse19 .cse1 .cse25) (and .cse1 .cse23 .cse24) (and (or .cse6 .cse7) .cse1) (and .cse29 .cse1 .cse23 .cse20) (and .cse29 .cse23 .cse20) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse30 (select .cse31 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_main_~shared~0#1.offset|) (not (= .cse30 |c_ULTIMATE.start_create_#t~ret9#1.base|)) (= (select (select |c_#memory_$Pointer$#0.base| .cse30) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse30) 0) 0) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (exists ((|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse32 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |c_#memory_$Pointer$#0.offset|))) (and (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse32) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse33 (select .cse31 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_main_~shared~0#1.offset|) (not (= .cse33 |c_ULTIMATE.start_create_#t~ret9#1.base|)) (= (select (select |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse33) 0) 0) (= (select (select |c_#memory_$Pointer$#0.base| .cse33) 0) 0) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse32 (select |c_#memory_$Pointer$#0.offset| .cse32)) |c_#memory_$Pointer$#0.offset|)))) (and .cse0 .cse2)))))) is different from true [2024-11-10 15:23:53,482 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse4 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse7 (exists ((v_prenex_15 Int)) (let ((.cse43 (select .cse4 v_prenex_15))) (and (<= 0 v_prenex_15) (= (select (select |c_#memory_$Pointer$#0.base| .cse43) 0) 0) (= .cse43 |c_ULTIMATE.start_main_~shared~0#1.base|) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|))))) (.cse19 (= (select .cse4 0) |c_ULTIMATE.start_main_~shared~0#1.base|)) (.cse0 (<= 0 |c_ULTIMATE.start_main_~shared~0#1.offset|))) (let ((.cse8 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse42 (select .cse4 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (not (= .cse42 |c_ULTIMATE.start_main_~shared~0#1.base|)) (not (= .cse42 |c_ULTIMATE.start_create_~now~1#1.base|)))))) (.cse2 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse40 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|)) (.cse39 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (and (not (= (select .cse39 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_main_~shared~0#1.base|)) (= .cse40 |c_ULTIMATE.start_create_~now~1#1.base|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse40 (select |c_#memory_$Pointer$#0.base| .cse40)) |c_#memory_$Pointer$#0.base|) (exists ((v_prenex_15 Int)) (let ((.cse41 (select .cse39 v_prenex_15))) (and (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse41) 0) 0) (<= 0 v_prenex_15) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse41 |c_ULTIMATE.start_main_~shared~0#1.base|)))))))) (.cse13 (and (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse37 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|)) (.cse38 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (not (= (select .cse37 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (select .cse37 0) |c_ULTIMATE.start_main_~shared~0#1.base|) (= .cse38 |c_ULTIMATE.start_create_~now~1#1.base|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse38 (select |c_#memory_$Pointer$#0.base| .cse38)) |c_#memory_$Pointer$#0.base|)))) .cse0)) (.cse6 (exists ((|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse36 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |c_#memory_$Pointer$#0.offset|))) (and (= .cse36 |c_ULTIMATE.start_create_~now~1#1.base|) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse36 (select |c_#memory_$Pointer$#0.offset| .cse36)) |c_#memory_$Pointer$#0.offset|))))) (.cse1 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse34 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|)) (.cse35 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (= (select .cse34 0) |c_ULTIMATE.start_main_~shared~0#1.base|) (not (= (select .cse34 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_create_~now~1#1.base|)) (= .cse35 |c_ULTIMATE.start_create_~now~1#1.base|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse35 (select |c_#memory_$Pointer$#0.base| .cse35)) |c_#memory_$Pointer$#0.base|))))) (.cse18 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (not (= (select .cse4 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_create_~now~1#1.base|)))) (.cse26 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (not (= (select .cse4 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_main_~shared~0#1.base|)))) (.cse27 (or .cse7 (and .cse19 .cse0)))) (or (and .cse0 .cse1) .cse2 (exists ((|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |c_#memory_$Pointer$#0.offset|))) (and (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse3 (select .cse4 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_main_~shared~0#1.offset|) (not (= .cse3 |c_ULTIMATE.start_create_~now~1#1.base|)) (= (select (select |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse3) 0) 0) (= (select (select |c_#memory_$Pointer$#0.base| .cse3) 0) 0) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (= .cse5 |c_ULTIMATE.start_create_~now~1#1.base|) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse5 (select |c_#memory_$Pointer$#0.offset| .cse5)) |c_#memory_$Pointer$#0.offset|)))) (and .cse6 .cse7 .cse8) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse9 (select .cse4 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_main_~shared~0#1.offset|) (not (= .cse9 |c_ULTIMATE.start_create_~now~1#1.base|)) (= (select (select |c_#memory_$Pointer$#0.base| .cse9) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse9) 0) 0) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse11 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|)) (.cse10 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (and (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (not (= (select .cse10 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_create_~now~1#1.base|))) (= .cse11 |c_ULTIMATE.start_create_~now~1#1.base|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse11 (select |c_#memory_$Pointer$#0.base| .cse11)) |c_#memory_$Pointer$#0.base|) (exists ((v_prenex_15 Int)) (let ((.cse12 (select .cse10 v_prenex_15))) (and (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse12) 0) 0) (<= 0 v_prenex_15) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse12 |c_ULTIMATE.start_main_~shared~0#1.base|))))))) .cse13 (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse14 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|)) (.cse16 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (and (= .cse14 |c_ULTIMATE.start_create_~now~1#1.base|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse14 (select |c_#memory_$Pointer$#0.base| .cse14)) |c_#memory_$Pointer$#0.base|) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse15 (select .cse16 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (not (= .cse15 |c_ULTIMATE.start_main_~shared~0#1.base|)) (not (= .cse15 |c_ULTIMATE.start_create_~now~1#1.base|))))) (exists ((v_prenex_15 Int)) (let ((.cse17 (select .cse16 v_prenex_15))) (and (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse17) 0) 0) (<= 0 v_prenex_15) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse17 |c_ULTIMATE.start_main_~shared~0#1.base|))))))) (and .cse6 .cse7 .cse18) (and .cse19 .cse18 .cse0) (and .cse7 .cse8) (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse20 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (= .cse20 |c_ULTIMATE.start_create_~now~1#1.base|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse20 (select |c_#memory_$Pointer$#0.base| .cse20)) |c_#memory_$Pointer$#0.base|) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse21 (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|) |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_main_~shared~0#1.offset|) (not (= .cse21 |c_ULTIMATE.start_create_~now~1#1.base|)) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse21) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse21) 0) 0) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|))))))) (and .cse6 (or .cse2 .cse13)) (and .cse6 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse25 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse22 (select .cse25 |ULTIMATE.start_create_internal_~now~0#1.offset|)) (.cse24 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|)) (.cse23 (select .cse25 v_prenex_15))) (and (not (= .cse22 |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse23) 0) 0) (<= 0 v_prenex_15) (not (= .cse22 |c_ULTIMATE.start_create_~now~1#1.base|)) (= .cse24 |c_ULTIMATE.start_create_~now~1#1.base|) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse24 (select |c_#memory_$Pointer$#0.base| .cse24)) |c_#memory_$Pointer$#0.base|) (= .cse23 |c_ULTIMATE.start_main_~shared~0#1.base|)))))) (and .cse6 .cse19 .cse18 .cse0) (and .cse6 .cse26 .cse27) (and .cse6 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse29 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse30 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|)) (.cse28 (select .cse29 v_prenex_15))) (and (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse28) 0) 0) (<= 0 v_prenex_15) (not (= (select .cse29 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_create_~now~1#1.base|)) (= .cse30 |c_ULTIMATE.start_create_~now~1#1.base|) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse30 (select |c_#memory_$Pointer$#0.base| .cse30)) |c_#memory_$Pointer$#0.base|) (= .cse28 |c_ULTIMATE.start_main_~shared~0#1.base|)))))) (and .cse6 .cse0 .cse1) (and .cse7 .cse18) (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse33 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (exists ((|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse32 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |c_#memory_$Pointer$#0.offset|))) (and (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse31 (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|) |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_main_~shared~0#1.offset|) (not (= .cse31 |c_ULTIMATE.start_create_~now~1#1.base|)) (= (select (select |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse31) 0) 0) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse31) 0) 0) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (= .cse32 |c_ULTIMATE.start_create_~now~1#1.base|) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse32 (select |c_#memory_$Pointer$#0.offset| .cse32)) |c_#memory_$Pointer$#0.offset|)))) (= .cse33 |c_ULTIMATE.start_create_~now~1#1.base|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse33 (select |c_#memory_$Pointer$#0.base| .cse33)) |c_#memory_$Pointer$#0.base|)))) (and .cse26 .cse27))))) (not (= |c_ULTIMATE.start_main_~shared~0#1.base| |c_ULTIMATE.start_create_~now~1#1.base|))) is different from false [2024-11-10 15:23:53,489 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse4 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse7 (exists ((v_prenex_15 Int)) (let ((.cse43 (select .cse4 v_prenex_15))) (and (<= 0 v_prenex_15) (= (select (select |c_#memory_$Pointer$#0.base| .cse43) 0) 0) (= .cse43 |c_ULTIMATE.start_main_~shared~0#1.base|) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|))))) (.cse19 (= (select .cse4 0) |c_ULTIMATE.start_main_~shared~0#1.base|)) (.cse0 (<= 0 |c_ULTIMATE.start_main_~shared~0#1.offset|))) (let ((.cse8 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse42 (select .cse4 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (not (= .cse42 |c_ULTIMATE.start_main_~shared~0#1.base|)) (not (= .cse42 |c_ULTIMATE.start_create_~now~1#1.base|)))))) (.cse2 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse40 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|)) (.cse39 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (and (not (= (select .cse39 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_main_~shared~0#1.base|)) (= .cse40 |c_ULTIMATE.start_create_~now~1#1.base|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse40 (select |c_#memory_$Pointer$#0.base| .cse40)) |c_#memory_$Pointer$#0.base|) (exists ((v_prenex_15 Int)) (let ((.cse41 (select .cse39 v_prenex_15))) (and (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse41) 0) 0) (<= 0 v_prenex_15) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse41 |c_ULTIMATE.start_main_~shared~0#1.base|)))))))) (.cse13 (and (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse37 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|)) (.cse38 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (not (= (select .cse37 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (select .cse37 0) |c_ULTIMATE.start_main_~shared~0#1.base|) (= .cse38 |c_ULTIMATE.start_create_~now~1#1.base|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse38 (select |c_#memory_$Pointer$#0.base| .cse38)) |c_#memory_$Pointer$#0.base|)))) .cse0)) (.cse6 (exists ((|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse36 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |c_#memory_$Pointer$#0.offset|))) (and (= .cse36 |c_ULTIMATE.start_create_~now~1#1.base|) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse36 (select |c_#memory_$Pointer$#0.offset| .cse36)) |c_#memory_$Pointer$#0.offset|))))) (.cse1 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse34 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|)) (.cse35 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (= (select .cse34 0) |c_ULTIMATE.start_main_~shared~0#1.base|) (not (= (select .cse34 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_create_~now~1#1.base|)) (= .cse35 |c_ULTIMATE.start_create_~now~1#1.base|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse35 (select |c_#memory_$Pointer$#0.base| .cse35)) |c_#memory_$Pointer$#0.base|))))) (.cse18 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (not (= (select .cse4 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_create_~now~1#1.base|)))) (.cse26 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (not (= (select .cse4 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_main_~shared~0#1.base|)))) (.cse27 (or .cse7 (and .cse19 .cse0)))) (or (and .cse0 .cse1) .cse2 (exists ((|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |c_#memory_$Pointer$#0.offset|))) (and (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse3 (select .cse4 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_main_~shared~0#1.offset|) (not (= .cse3 |c_ULTIMATE.start_create_~now~1#1.base|)) (= (select (select |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse3) 0) 0) (= (select (select |c_#memory_$Pointer$#0.base| .cse3) 0) 0) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (= .cse5 |c_ULTIMATE.start_create_~now~1#1.base|) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse5 (select |c_#memory_$Pointer$#0.offset| .cse5)) |c_#memory_$Pointer$#0.offset|)))) (and .cse6 .cse7 .cse8) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse9 (select .cse4 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_main_~shared~0#1.offset|) (not (= .cse9 |c_ULTIMATE.start_create_~now~1#1.base|)) (= (select (select |c_#memory_$Pointer$#0.base| .cse9) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse9) 0) 0) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse11 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|)) (.cse10 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (and (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (not (= (select .cse10 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_create_~now~1#1.base|))) (= .cse11 |c_ULTIMATE.start_create_~now~1#1.base|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse11 (select |c_#memory_$Pointer$#0.base| .cse11)) |c_#memory_$Pointer$#0.base|) (exists ((v_prenex_15 Int)) (let ((.cse12 (select .cse10 v_prenex_15))) (and (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse12) 0) 0) (<= 0 v_prenex_15) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse12 |c_ULTIMATE.start_main_~shared~0#1.base|))))))) .cse13 (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse14 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|)) (.cse16 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (and (= .cse14 |c_ULTIMATE.start_create_~now~1#1.base|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse14 (select |c_#memory_$Pointer$#0.base| .cse14)) |c_#memory_$Pointer$#0.base|) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse15 (select .cse16 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (not (= .cse15 |c_ULTIMATE.start_main_~shared~0#1.base|)) (not (= .cse15 |c_ULTIMATE.start_create_~now~1#1.base|))))) (exists ((v_prenex_15 Int)) (let ((.cse17 (select .cse16 v_prenex_15))) (and (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse17) 0) 0) (<= 0 v_prenex_15) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse17 |c_ULTIMATE.start_main_~shared~0#1.base|))))))) (and .cse6 .cse7 .cse18) (and .cse19 .cse18 .cse0) (and .cse7 .cse8) (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse20 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (= .cse20 |c_ULTIMATE.start_create_~now~1#1.base|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse20 (select |c_#memory_$Pointer$#0.base| .cse20)) |c_#memory_$Pointer$#0.base|) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse21 (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|) |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_main_~shared~0#1.offset|) (not (= .cse21 |c_ULTIMATE.start_create_~now~1#1.base|)) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse21) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse21) 0) 0) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|))))))) (and .cse6 (or .cse2 .cse13)) (and .cse6 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse25 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse22 (select .cse25 |ULTIMATE.start_create_internal_~now~0#1.offset|)) (.cse24 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|)) (.cse23 (select .cse25 v_prenex_15))) (and (not (= .cse22 |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse23) 0) 0) (<= 0 v_prenex_15) (not (= .cse22 |c_ULTIMATE.start_create_~now~1#1.base|)) (= .cse24 |c_ULTIMATE.start_create_~now~1#1.base|) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse24 (select |c_#memory_$Pointer$#0.base| .cse24)) |c_#memory_$Pointer$#0.base|) (= .cse23 |c_ULTIMATE.start_main_~shared~0#1.base|)))))) (and .cse6 .cse19 .cse18 .cse0) (and .cse6 .cse26 .cse27) (and .cse6 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse29 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse30 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|)) (.cse28 (select .cse29 v_prenex_15))) (and (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse28) 0) 0) (<= 0 v_prenex_15) (not (= (select .cse29 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_create_~now~1#1.base|)) (= .cse30 |c_ULTIMATE.start_create_~now~1#1.base|) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse30 (select |c_#memory_$Pointer$#0.base| .cse30)) |c_#memory_$Pointer$#0.base|) (= .cse28 |c_ULTIMATE.start_main_~shared~0#1.base|)))))) (and .cse6 .cse0 .cse1) (and .cse7 .cse18) (exists ((|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse33 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_#memory_$Pointer$#0.base|))) (and (exists ((|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse32 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |c_#memory_$Pointer$#0.offset|))) (and (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse31 (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|) |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_main_~shared~0#1.offset|) (not (= .cse31 |c_ULTIMATE.start_create_~now~1#1.base|)) (= (select (select |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse31) 0) 0) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse31) 0) 0) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (= .cse32 |c_ULTIMATE.start_create_~now~1#1.base|) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse32 (select |c_#memory_$Pointer$#0.offset| .cse32)) |c_#memory_$Pointer$#0.offset|)))) (= .cse33 |c_ULTIMATE.start_create_~now~1#1.base|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse33 (select |c_#memory_$Pointer$#0.base| .cse33)) |c_#memory_$Pointer$#0.base|)))) (and .cse26 .cse27))))) (not (= |c_ULTIMATE.start_main_~shared~0#1.base| |c_ULTIMATE.start_create_~now~1#1.base|))) is different from true [2024-11-10 15:23:54,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:23:54,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-10 15:23:54,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:23:54,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:23:54,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:23:54,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:23:54,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-10 15:23:54,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:23:54,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:23:54,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:23:54,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:23:54,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2024-11-10 15:23:54,454 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-10 15:23:54,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 36 [2024-11-10 15:23:54,508 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-10 15:23:54,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 53 [2024-11-10 15:23:54,515 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 31 treesize of output 29 [2024-11-10 15:23:54,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2024-11-10 15:23:54,553 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-10 15:23:54,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 32 [2024-11-10 15:23:54,627 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-10 15:23:54,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 38 [2024-11-10 15:23:54,723 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-10 15:23:54,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 38 [2024-11-10 15:23:54,741 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-10 15:23:54,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 53 [2024-11-10 15:23:54,754 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 31 treesize of output 29 [2024-11-10 15:23:54,845 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-10 15:23:54,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 36 [2024-11-10 15:23:54,869 INFO L349 Elim1Store]: treesize reduction 27, result has 10.0 percent of original size [2024-11-10 15:23:54,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 30 [2024-11-10 15:23:59,323 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse9 (exists ((v_prenex_15 Int)) (let ((.cse39 (select .cse2 v_prenex_15))) (and (<= 0 v_prenex_15) (= (select (select |c_#memory_$Pointer$#0.base| .cse39) 0) 0) (= .cse39 |c_ULTIMATE.start_main_~shared~0#1.base|) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|))))) (.cse10 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (not (= (select .cse2 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_main_~shared~0#1.base|)))) (.cse33 (select .cse2 0))) (or (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|)) (.cse1 (select .cse2 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_main_~shared~0#1.offset|) (not (= .cse0 |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse0 (select |v_#memory_$Pointer$#0.offset_204| .cse0)) |v_#memory_$Pointer$#0.offset_204|) (= (select (select |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse1) 0) 0) (= (store |v_#memory_$Pointer$#0.offset_204| .cse0 (select |c_#memory_$Pointer$#0.offset| .cse0)) |c_#memory_$Pointer$#0.offset|) (not (= .cse1 .cse0)) (= (select (select |c_#memory_$Pointer$#0.base| .cse1) 0) 0) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse6 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|)) (.cse4 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|)) (.cse5 (select .cse6 v_prenex_15))) (and (= .cse3 .cse4) (= (store |v_#memory_$Pointer$#0.base_219| .cse4 (select |c_#memory_$Pointer$#0.base| .cse4)) |c_#memory_$Pointer$#0.base|) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse5) 0) 0) (not (= (select .cse6 |ULTIMATE.start_create_internal_~now~0#1.offset|) .cse4)) (<= 0 v_prenex_15) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse3 (select |v_#memory_$Pointer$#0.base_219| .cse3)) |v_#memory_$Pointer$#0.base_219|) (not (= .cse4 |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse4 (select |v_#memory_$Pointer$#0.offset_204| .cse4)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse4 (select |c_#memory_$Pointer$#0.offset| .cse4)) |c_#memory_$Pointer$#0.offset|) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse5 |c_ULTIMATE.start_main_~shared~0#1.base|))))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse7 (select .cse2 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_main_~shared~0#1.offset|) (= (select (select |c_#memory_$Pointer$#0.base| .cse7) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse7) 0) 0) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (and (exists ((|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|))) (and (not (= .cse8 |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse8 (select |v_#memory_$Pointer$#0.offset_204| .cse8)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse8 (select |c_#memory_$Pointer$#0.offset| .cse8)) |c_#memory_$Pointer$#0.offset|)))) .cse9 .cse10) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse11 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|)) (.cse12 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|)) (.cse13 (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|) |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse11 .cse12) (= (store |v_#memory_$Pointer$#0.base_219| .cse12 (select |c_#memory_$Pointer$#0.base| .cse12)) |c_#memory_$Pointer$#0.base|) (not (= .cse13 .cse12)) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse11 (select |v_#memory_$Pointer$#0.base_219| .cse11)) |v_#memory_$Pointer$#0.base_219|) (= (select (select |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse13) 0) 0) (not (= .cse12 |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse12 (select |v_#memory_$Pointer$#0.offset_204| .cse12)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse12 (select |c_#memory_$Pointer$#0.offset| .cse12)) |c_#memory_$Pointer$#0.offset|) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse13) 0) 0) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (and .cse9 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse14 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|))) (and (not (= .cse14 |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse14 (select |v_#memory_$Pointer$#0.offset_204| .cse14)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse14 (select |c_#memory_$Pointer$#0.offset| .cse14)) |c_#memory_$Pointer$#0.offset|) (not (= (select .cse2 |ULTIMATE.start_create_internal_~now~0#1.offset|) .cse14)))))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse17 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse15 (select .cse17 v_prenex_15)) (.cse16 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|))) (and (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse15) 0) 0) (<= 0 v_prenex_15) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse16 (select |v_#memory_$Pointer$#0.base_219| .cse16)) |v_#memory_$Pointer$#0.base_219|) (not (= .cse16 |c_ULTIMATE.start_main_~shared~0#1.base|)) (not (= (select .cse17 |ULTIMATE.start_create_internal_~now~0#1.offset|) .cse16)) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse15 |c_ULTIMATE.start_main_~shared~0#1.base|) (= |c_#memory_$Pointer$#0.base| (store |v_#memory_$Pointer$#0.base_219| .cse16 (select |c_#memory_$Pointer$#0.base| .cse16))))))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse18 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse19 (select .cse18 v_prenex_15)) (.cse20 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|))) (and (not (= (select .cse18 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse19) 0) 0) (<= 0 v_prenex_15) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse20 (select |v_#memory_$Pointer$#0.base_219| .cse20)) |v_#memory_$Pointer$#0.base_219|) (not (= .cse20 |c_ULTIMATE.start_main_~shared~0#1.base|)) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse19 |c_ULTIMATE.start_main_~shared~0#1.base|) (= |c_#memory_$Pointer$#0.base| (store |v_#memory_$Pointer$#0.base_219| .cse20 (select |c_#memory_$Pointer$#0.base| .cse20))))))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse24 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse21 (select .cse24 |ULTIMATE.start_create_internal_~now~0#1.offset|)) (.cse22 (select .cse24 v_prenex_15)) (.cse23 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|))) (and (not (= .cse21 |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse22) 0) 0) (<= 0 v_prenex_15) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse23 (select |v_#memory_$Pointer$#0.base_219| .cse23)) |v_#memory_$Pointer$#0.base_219|) (not (= .cse23 |c_ULTIMATE.start_main_~shared~0#1.base|)) (not (= .cse21 .cse23)) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse22 |c_ULTIMATE.start_main_~shared~0#1.base|) (= |c_#memory_$Pointer$#0.base| (store |v_#memory_$Pointer$#0.base_219| .cse23 (select |c_#memory_$Pointer$#0.base| .cse23))))))) (exists ((|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse25 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|))) (and (not (= .cse25 |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse25 (select |v_#memory_$Pointer$#0.offset_204| .cse25)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse25 (select |c_#memory_$Pointer$#0.offset| .cse25)) |c_#memory_$Pointer$#0.offset|) (exists ((|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#0.base_219| .cse25 (select |c_#memory_$Pointer$#0.base| .cse25)) |c_#memory_$Pointer$#0.base|) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse26 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|)) (.cse27 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (and (= .cse26 .cse25) (not (= (select .cse27 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse26 (select |v_#memory_$Pointer$#0.base_219| .cse26)) |v_#memory_$Pointer$#0.base_219|) (exists ((v_prenex_15 Int)) (let ((.cse28 (select .cse27 v_prenex_15))) (and (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse28) 0) 0) (<= 0 v_prenex_15) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse28 |c_ULTIMATE.start_main_~shared~0#1.base|)))))))))))) (and .cse9 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse29 (select .cse2 |ULTIMATE.start_create_internal_~now~0#1.offset|)) (.cse30 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|))) (and (not (= .cse29 |c_ULTIMATE.start_main_~shared~0#1.base|)) (not (= .cse30 |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse30 (select |v_#memory_$Pointer$#0.offset_204| .cse30)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse30 (select |c_#memory_$Pointer$#0.offset| .cse30)) |c_#memory_$Pointer$#0.offset|) (not (= .cse29 .cse30)))))) (and .cse9 .cse10) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse32 (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|) |ULTIMATE.start_create_internal_~now~0#1.offset|)) (.cse31 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|))) (and (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_main_~shared~0#1.offset|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse31 (select |v_#memory_$Pointer$#0.base_219| .cse31)) |v_#memory_$Pointer$#0.base_219|) (not (= .cse31 |c_ULTIMATE.start_main_~shared~0#1.base|)) (not (= .cse32 .cse31)) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse32) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse32) 0) 0) (= |c_#memory_$Pointer$#0.base| (store |v_#memory_$Pointer$#0.base_219| .cse31 (select |c_#memory_$Pointer$#0.base| .cse31))) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (and (= .cse33 |c_ULTIMATE.start_main_~shared~0#1.base|) (<= 0 |c_ULTIMATE.start_main_~shared~0#1.offset|)) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse38 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse36 (select .cse38 |ULTIMATE.start_create_internal_~now~0#1.offset|)) (.cse34 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|)) (.cse35 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|)) (.cse37 (select .cse38 v_prenex_15))) (and (= .cse34 .cse35) (= (store |v_#memory_$Pointer$#0.base_219| .cse35 (select |c_#memory_$Pointer$#0.base| .cse35)) |c_#memory_$Pointer$#0.base|) (not (= .cse36 |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse37) 0) 0) (not (= .cse36 .cse35)) (<= 0 v_prenex_15) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse34 (select |v_#memory_$Pointer$#0.base_219| .cse34)) |v_#memory_$Pointer$#0.base_219|) (not (= .cse35 |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse35 (select |v_#memory_$Pointer$#0.offset_204| .cse35)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse35 (select |c_#memory_$Pointer$#0.offset| .cse35)) |c_#memory_$Pointer$#0.offset|) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse37 |c_ULTIMATE.start_main_~shared~0#1.base|))))) (and (= .cse33 0) (exists ((v_prenex_15 Int)) (and (<= 0 v_prenex_15) (= (select .cse2 v_prenex_15) |c_ULTIMATE.start_main_~shared~0#1.base|) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|))))))) is different from false [2024-11-10 15:23:59,344 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse9 (exists ((v_prenex_15 Int)) (let ((.cse39 (select .cse2 v_prenex_15))) (and (<= 0 v_prenex_15) (= (select (select |c_#memory_$Pointer$#0.base| .cse39) 0) 0) (= .cse39 |c_ULTIMATE.start_main_~shared~0#1.base|) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|))))) (.cse10 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (not (= (select .cse2 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_main_~shared~0#1.base|)))) (.cse33 (select .cse2 0))) (or (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|)) (.cse1 (select .cse2 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_main_~shared~0#1.offset|) (not (= .cse0 |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse0 (select |v_#memory_$Pointer$#0.offset_204| .cse0)) |v_#memory_$Pointer$#0.offset_204|) (= (select (select |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse1) 0) 0) (= (store |v_#memory_$Pointer$#0.offset_204| .cse0 (select |c_#memory_$Pointer$#0.offset| .cse0)) |c_#memory_$Pointer$#0.offset|) (not (= .cse1 .cse0)) (= (select (select |c_#memory_$Pointer$#0.base| .cse1) 0) 0) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse6 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|)) (.cse4 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|)) (.cse5 (select .cse6 v_prenex_15))) (and (= .cse3 .cse4) (= (store |v_#memory_$Pointer$#0.base_219| .cse4 (select |c_#memory_$Pointer$#0.base| .cse4)) |c_#memory_$Pointer$#0.base|) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse5) 0) 0) (not (= (select .cse6 |ULTIMATE.start_create_internal_~now~0#1.offset|) .cse4)) (<= 0 v_prenex_15) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse3 (select |v_#memory_$Pointer$#0.base_219| .cse3)) |v_#memory_$Pointer$#0.base_219|) (not (= .cse4 |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse4 (select |v_#memory_$Pointer$#0.offset_204| .cse4)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse4 (select |c_#memory_$Pointer$#0.offset| .cse4)) |c_#memory_$Pointer$#0.offset|) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse5 |c_ULTIMATE.start_main_~shared~0#1.base|))))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse7 (select .cse2 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_main_~shared~0#1.offset|) (= (select (select |c_#memory_$Pointer$#0.base| .cse7) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse7) 0) 0) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (and (exists ((|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|))) (and (not (= .cse8 |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse8 (select |v_#memory_$Pointer$#0.offset_204| .cse8)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse8 (select |c_#memory_$Pointer$#0.offset| .cse8)) |c_#memory_$Pointer$#0.offset|)))) .cse9 .cse10) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse11 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|)) (.cse12 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|)) (.cse13 (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|) |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse11 .cse12) (= (store |v_#memory_$Pointer$#0.base_219| .cse12 (select |c_#memory_$Pointer$#0.base| .cse12)) |c_#memory_$Pointer$#0.base|) (not (= .cse13 .cse12)) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse11 (select |v_#memory_$Pointer$#0.base_219| .cse11)) |v_#memory_$Pointer$#0.base_219|) (= (select (select |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse13) 0) 0) (not (= .cse12 |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse12 (select |v_#memory_$Pointer$#0.offset_204| .cse12)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse12 (select |c_#memory_$Pointer$#0.offset| .cse12)) |c_#memory_$Pointer$#0.offset|) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse13) 0) 0) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (and .cse9 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse14 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|))) (and (not (= .cse14 |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse14 (select |v_#memory_$Pointer$#0.offset_204| .cse14)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse14 (select |c_#memory_$Pointer$#0.offset| .cse14)) |c_#memory_$Pointer$#0.offset|) (not (= (select .cse2 |ULTIMATE.start_create_internal_~now~0#1.offset|) .cse14)))))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse17 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse15 (select .cse17 v_prenex_15)) (.cse16 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|))) (and (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse15) 0) 0) (<= 0 v_prenex_15) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse16 (select |v_#memory_$Pointer$#0.base_219| .cse16)) |v_#memory_$Pointer$#0.base_219|) (not (= .cse16 |c_ULTIMATE.start_main_~shared~0#1.base|)) (not (= (select .cse17 |ULTIMATE.start_create_internal_~now~0#1.offset|) .cse16)) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse15 |c_ULTIMATE.start_main_~shared~0#1.base|) (= |c_#memory_$Pointer$#0.base| (store |v_#memory_$Pointer$#0.base_219| .cse16 (select |c_#memory_$Pointer$#0.base| .cse16))))))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse18 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse19 (select .cse18 v_prenex_15)) (.cse20 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|))) (and (not (= (select .cse18 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse19) 0) 0) (<= 0 v_prenex_15) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse20 (select |v_#memory_$Pointer$#0.base_219| .cse20)) |v_#memory_$Pointer$#0.base_219|) (not (= .cse20 |c_ULTIMATE.start_main_~shared~0#1.base|)) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse19 |c_ULTIMATE.start_main_~shared~0#1.base|) (= |c_#memory_$Pointer$#0.base| (store |v_#memory_$Pointer$#0.base_219| .cse20 (select |c_#memory_$Pointer$#0.base| .cse20))))))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse24 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse21 (select .cse24 |ULTIMATE.start_create_internal_~now~0#1.offset|)) (.cse22 (select .cse24 v_prenex_15)) (.cse23 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|))) (and (not (= .cse21 |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse22) 0) 0) (<= 0 v_prenex_15) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse23 (select |v_#memory_$Pointer$#0.base_219| .cse23)) |v_#memory_$Pointer$#0.base_219|) (not (= .cse23 |c_ULTIMATE.start_main_~shared~0#1.base|)) (not (= .cse21 .cse23)) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse22 |c_ULTIMATE.start_main_~shared~0#1.base|) (= |c_#memory_$Pointer$#0.base| (store |v_#memory_$Pointer$#0.base_219| .cse23 (select |c_#memory_$Pointer$#0.base| .cse23))))))) (exists ((|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse25 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|))) (and (not (= .cse25 |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse25 (select |v_#memory_$Pointer$#0.offset_204| .cse25)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse25 (select |c_#memory_$Pointer$#0.offset| .cse25)) |c_#memory_$Pointer$#0.offset|) (exists ((|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#0.base_219| .cse25 (select |c_#memory_$Pointer$#0.base| .cse25)) |c_#memory_$Pointer$#0.base|) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse26 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|)) (.cse27 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (and (= .cse26 .cse25) (not (= (select .cse27 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse26 (select |v_#memory_$Pointer$#0.base_219| .cse26)) |v_#memory_$Pointer$#0.base_219|) (exists ((v_prenex_15 Int)) (let ((.cse28 (select .cse27 v_prenex_15))) (and (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse28) 0) 0) (<= 0 v_prenex_15) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse28 |c_ULTIMATE.start_main_~shared~0#1.base|)))))))))))) (and .cse9 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse29 (select .cse2 |ULTIMATE.start_create_internal_~now~0#1.offset|)) (.cse30 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|))) (and (not (= .cse29 |c_ULTIMATE.start_main_~shared~0#1.base|)) (not (= .cse30 |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse30 (select |v_#memory_$Pointer$#0.offset_204| .cse30)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse30 (select |c_#memory_$Pointer$#0.offset| .cse30)) |c_#memory_$Pointer$#0.offset|) (not (= .cse29 .cse30)))))) (and .cse9 .cse10) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse32 (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|) |ULTIMATE.start_create_internal_~now~0#1.offset|)) (.cse31 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|))) (and (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_main_~shared~0#1.offset|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse31 (select |v_#memory_$Pointer$#0.base_219| .cse31)) |v_#memory_$Pointer$#0.base_219|) (not (= .cse31 |c_ULTIMATE.start_main_~shared~0#1.base|)) (not (= .cse32 .cse31)) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse32) 0) 0) (= (select (select |c_#memory_$Pointer$#0.offset| .cse32) 0) 0) (= |c_#memory_$Pointer$#0.base| (store |v_#memory_$Pointer$#0.base_219| .cse31 (select |c_#memory_$Pointer$#0.base| .cse31))) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (and (= .cse33 |c_ULTIMATE.start_main_~shared~0#1.base|) (<= 0 |c_ULTIMATE.start_main_~shared~0#1.offset|)) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse38 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse36 (select .cse38 |ULTIMATE.start_create_internal_~now~0#1.offset|)) (.cse34 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|)) (.cse35 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|)) (.cse37 (select .cse38 v_prenex_15))) (and (= .cse34 .cse35) (= (store |v_#memory_$Pointer$#0.base_219| .cse35 (select |c_#memory_$Pointer$#0.base| .cse35)) |c_#memory_$Pointer$#0.base|) (not (= .cse36 |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse37) 0) 0) (not (= .cse36 .cse35)) (<= 0 v_prenex_15) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse34 (select |v_#memory_$Pointer$#0.base_219| .cse34)) |v_#memory_$Pointer$#0.base_219|) (not (= .cse35 |c_ULTIMATE.start_main_~shared~0#1.base|)) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse35 (select |v_#memory_$Pointer$#0.offset_204| .cse35)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse35 (select |c_#memory_$Pointer$#0.offset| .cse35)) |c_#memory_$Pointer$#0.offset|) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|) (= .cse37 |c_ULTIMATE.start_main_~shared~0#1.base|))))) (and (= .cse33 0) (exists ((v_prenex_15 Int)) (and (<= 0 v_prenex_15) (= (select .cse2 v_prenex_15) |c_ULTIMATE.start_main_~shared~0#1.base|) (<= v_prenex_15 |c_ULTIMATE.start_main_~shared~0#1.offset|))))))) is different from true [2024-11-10 15:24:05,250 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_destroy_internal_~l#1.base|))) (let ((.cse4 (select .cse2 0)) (.cse17 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (not (= (select .cse2 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_destroy_internal_~l#1.base|)))) (.cse3 (exists ((v_prenex_15 Int)) (let ((.cse39 (select .cse2 v_prenex_15))) (and (<= 0 v_prenex_15) (= .cse39 |c_ULTIMATE.start_destroy_internal_~l#1.base|) (= (select (select |c_#memory_$Pointer$#0.base| .cse39) 0) 0) (<= v_prenex_15 |c_ULTIMATE.start_destroy_internal_~l#1.offset|)))))) (or (and (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse0 (select .cse2 |ULTIMATE.start_create_internal_~now~0#1.offset|)) (.cse1 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|))) (and (not (= .cse0 |c_ULTIMATE.start_destroy_internal_~l#1.base|)) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse1 (select |v_#memory_$Pointer$#0.offset_204| .cse1)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse1 (select |c_#memory_$Pointer$#0.offset| .cse1)) |c_#memory_$Pointer$#0.offset|) (not (= .cse0 .cse1)) (not (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse1))))) .cse3) (and (= .cse4 0) (exists ((v_prenex_15 Int)) (and (<= 0 v_prenex_15) (= (select .cse2 v_prenex_15) |c_ULTIMATE.start_destroy_internal_~l#1.base|) (<= v_prenex_15 |c_ULTIMATE.start_destroy_internal_~l#1.offset|)))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse5 (select .cse2 |ULTIMATE.start_create_internal_~now~0#1.offset|)) (.cse6 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|))) (and (= (select (select |c_#memory_$Pointer$#0.base| .cse5) 0) 0) (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_destroy_internal_~l#1.offset|) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse6 (select |v_#memory_$Pointer$#0.offset_204| .cse6)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse6 (select |c_#memory_$Pointer$#0.offset| .cse6)) |c_#memory_$Pointer$#0.offset|) (not (= .cse5 .cse6)) (= (select (select |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse5) 0) 0) (not (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse6)) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse7 (select .cse2 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#0.base| .cse7) 0) 0) (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_destroy_internal_~l#1.offset|) (= (select (select |c_#memory_$Pointer$#0.offset| .cse7) 0) 0) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse11 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_destroy_internal_~l#1.base|))) (let ((.cse8 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|)) (.cse9 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|)) (.cse10 (select .cse11 v_prenex_15))) (and (= .cse8 .cse9) (= (store |v_#memory_$Pointer$#0.base_219| .cse9 (select |c_#memory_$Pointer$#0.base| .cse9)) |c_#memory_$Pointer$#0.base|) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse10) 0) 0) (<= 0 v_prenex_15) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse8 (select |v_#memory_$Pointer$#0.base_219| .cse8)) |v_#memory_$Pointer$#0.base_219|) (not (= (select .cse11 |ULTIMATE.start_create_internal_~now~0#1.offset|) .cse9)) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse9 (select |v_#memory_$Pointer$#0.offset_204| .cse9)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse9 (select |c_#memory_$Pointer$#0.offset| .cse9)) |c_#memory_$Pointer$#0.offset|) (not (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse9)) (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse10) (<= v_prenex_15 |c_ULTIMATE.start_destroy_internal_~l#1.offset|))))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse12 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|)) (.cse13 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|)) (.cse14 (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_destroy_internal_~l#1.base|) |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (= .cse12 .cse13) (= (store |v_#memory_$Pointer$#0.base_219| .cse13 (select |c_#memory_$Pointer$#0.base| .cse13)) |c_#memory_$Pointer$#0.base|) (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_destroy_internal_~l#1.offset|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse12 (select |v_#memory_$Pointer$#0.base_219| .cse12)) |v_#memory_$Pointer$#0.base_219|) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse14) 0) 0) (not (= .cse14 .cse13)) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse13 (select |v_#memory_$Pointer$#0.offset_204| .cse13)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse13 (select |c_#memory_$Pointer$#0.offset| .cse13)) |c_#memory_$Pointer$#0.offset|) (not (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse13)) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|) (= (select (select |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse14) 0) 0)))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse15 (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_destroy_internal_~l#1.base|) |ULTIMATE.start_create_internal_~now~0#1.offset|)) (.cse16 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|))) (and (not (= .cse15 .cse16)) (not (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse16)) (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_destroy_internal_~l#1.offset|) (= (select (select |c_#memory_$Pointer$#0.offset| .cse15) 0) 0) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse16 (select |v_#memory_$Pointer$#0.base_219| .cse16)) |v_#memory_$Pointer$#0.base_219|) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse15) 0) 0) (= |c_#memory_$Pointer$#0.base| (store |v_#memory_$Pointer$#0.base_219| .cse16 (select |c_#memory_$Pointer$#0.base| .cse16))) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (and (<= 0 |c_ULTIMATE.start_destroy_internal_~l#1.offset|) (= .cse4 |c_ULTIMATE.start_destroy_internal_~l#1.base|)) (and .cse17 .cse3) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse22 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_destroy_internal_~l#1.base|))) (let ((.cse18 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|)) (.cse21 (select .cse22 |ULTIMATE.start_create_internal_~now~0#1.offset|)) (.cse19 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|)) (.cse20 (select .cse22 v_prenex_15))) (and (= .cse18 .cse19) (= (store |v_#memory_$Pointer$#0.base_219| .cse19 (select |c_#memory_$Pointer$#0.base| .cse19)) |c_#memory_$Pointer$#0.base|) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse20) 0) 0) (<= 0 v_prenex_15) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse18 (select |v_#memory_$Pointer$#0.base_219| .cse18)) |v_#memory_$Pointer$#0.base_219|) (not (= .cse21 .cse19)) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse19 (select |v_#memory_$Pointer$#0.offset_204| .cse19)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse19 (select |c_#memory_$Pointer$#0.offset| .cse19)) |c_#memory_$Pointer$#0.offset|) (not (= .cse21 |c_ULTIMATE.start_destroy_internal_~l#1.base|)) (not (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse19)) (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse20) (<= v_prenex_15 |c_ULTIMATE.start_destroy_internal_~l#1.offset|))))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse26 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_destroy_internal_~l#1.base|))) (let ((.cse23 (select .cse26 |ULTIMATE.start_create_internal_~now~0#1.offset|)) (.cse24 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|)) (.cse25 (select .cse26 v_prenex_15))) (and (not (= .cse23 .cse24)) (not (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse24)) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse25) 0) 0) (<= 0 v_prenex_15) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse24 (select |v_#memory_$Pointer$#0.base_219| .cse24)) |v_#memory_$Pointer$#0.base_219|) (not (= .cse23 |c_ULTIMATE.start_destroy_internal_~l#1.base|)) (= |c_#memory_$Pointer$#0.base| (store |v_#memory_$Pointer$#0.base_219| .cse24 (select |c_#memory_$Pointer$#0.base| .cse24))) (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse25) (<= v_prenex_15 |c_ULTIMATE.start_destroy_internal_~l#1.offset|))))) (and (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse27 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|))) (and (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse27 (select |v_#memory_$Pointer$#0.offset_204| .cse27)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse27 (select |c_#memory_$Pointer$#0.offset| .cse27)) |c_#memory_$Pointer$#0.offset|) (not (= (select .cse2 |ULTIMATE.start_create_internal_~now~0#1.offset|) .cse27)) (not (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse27))))) .cse3) (and (exists ((|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse28 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|))) (and (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse28 (select |v_#memory_$Pointer$#0.offset_204| .cse28)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse28 (select |c_#memory_$Pointer$#0.offset| .cse28)) |c_#memory_$Pointer$#0.offset|) (not (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse28))))) .cse17 .cse3) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse31 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_destroy_internal_~l#1.base|))) (let ((.cse29 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|)) (.cse30 (select .cse31 v_prenex_15))) (and (not (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse29)) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse30) 0) 0) (<= 0 v_prenex_15) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse29 (select |v_#memory_$Pointer$#0.base_219| .cse29)) |v_#memory_$Pointer$#0.base_219|) (not (= (select .cse31 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_destroy_internal_~l#1.base|)) (= |c_#memory_$Pointer$#0.base| (store |v_#memory_$Pointer$#0.base_219| .cse29 (select |c_#memory_$Pointer$#0.base| .cse29))) (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse30) (<= v_prenex_15 |c_ULTIMATE.start_destroy_internal_~l#1.offset|))))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse32 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_destroy_internal_~l#1.base|))) (let ((.cse33 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|)) (.cse34 (select .cse32 v_prenex_15))) (and (not (= (select .cse32 |ULTIMATE.start_create_internal_~now~0#1.offset|) .cse33)) (not (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse33)) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse34) 0) 0) (<= 0 v_prenex_15) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse33 (select |v_#memory_$Pointer$#0.base_219| .cse33)) |v_#memory_$Pointer$#0.base_219|) (= |c_#memory_$Pointer$#0.base| (store |v_#memory_$Pointer$#0.base_219| .cse33 (select |c_#memory_$Pointer$#0.base| .cse33))) (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse34) (<= v_prenex_15 |c_ULTIMATE.start_destroy_internal_~l#1.offset|))))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse38 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_destroy_internal_~l#1.base|))) (let ((.cse35 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|)) (.cse36 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|)) (.cse37 (select .cse38 v_prenex_15))) (and (= .cse35 .cse36) (= (store |v_#memory_$Pointer$#0.base_219| .cse36 (select |c_#memory_$Pointer$#0.base| .cse36)) |c_#memory_$Pointer$#0.base|) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse37) 0) 0) (<= 0 v_prenex_15) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse35 (select |v_#memory_$Pointer$#0.base_219| .cse35)) |v_#memory_$Pointer$#0.base_219|) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse36 (select |v_#memory_$Pointer$#0.offset_204| .cse36)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse36 (select |c_#memory_$Pointer$#0.offset| .cse36)) |c_#memory_$Pointer$#0.offset|) (not (= (select .cse38 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_destroy_internal_~l#1.base|)) (not (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse36)) (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse37) (<= v_prenex_15 |c_ULTIMATE.start_destroy_internal_~l#1.offset|)))))))) is different from false [2024-11-10 15:24:05,263 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_destroy_internal_~l#1.base|))) (let ((.cse4 (select .cse2 0)) (.cse17 (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (not (= (select .cse2 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_destroy_internal_~l#1.base|)))) (.cse3 (exists ((v_prenex_15 Int)) (let ((.cse39 (select .cse2 v_prenex_15))) (and (<= 0 v_prenex_15) (= .cse39 |c_ULTIMATE.start_destroy_internal_~l#1.base|) (= (select (select |c_#memory_$Pointer$#0.base| .cse39) 0) 0) (<= v_prenex_15 |c_ULTIMATE.start_destroy_internal_~l#1.offset|)))))) (or (and (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse0 (select .cse2 |ULTIMATE.start_create_internal_~now~0#1.offset|)) (.cse1 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|))) (and (not (= .cse0 |c_ULTIMATE.start_destroy_internal_~l#1.base|)) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse1 (select |v_#memory_$Pointer$#0.offset_204| .cse1)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse1 (select |c_#memory_$Pointer$#0.offset| .cse1)) |c_#memory_$Pointer$#0.offset|) (not (= .cse0 .cse1)) (not (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse1))))) .cse3) (and (= .cse4 0) (exists ((v_prenex_15 Int)) (and (<= 0 v_prenex_15) (= (select .cse2 v_prenex_15) |c_ULTIMATE.start_destroy_internal_~l#1.base|) (<= v_prenex_15 |c_ULTIMATE.start_destroy_internal_~l#1.offset|)))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse5 (select .cse2 |ULTIMATE.start_create_internal_~now~0#1.offset|)) (.cse6 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|))) (and (= (select (select |c_#memory_$Pointer$#0.base| .cse5) 0) 0) (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_destroy_internal_~l#1.offset|) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse6 (select |v_#memory_$Pointer$#0.offset_204| .cse6)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse6 (select |c_#memory_$Pointer$#0.offset| .cse6)) |c_#memory_$Pointer$#0.offset|) (not (= .cse5 .cse6)) (= (select (select |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse5) 0) 0) (not (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse6)) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int)) (let ((.cse7 (select .cse2 |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#0.base| .cse7) 0) 0) (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_destroy_internal_~l#1.offset|) (= (select (select |c_#memory_$Pointer$#0.offset| .cse7) 0) 0) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse11 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_destroy_internal_~l#1.base|))) (let ((.cse8 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|)) (.cse9 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|)) (.cse10 (select .cse11 v_prenex_15))) (and (= .cse8 .cse9) (= (store |v_#memory_$Pointer$#0.base_219| .cse9 (select |c_#memory_$Pointer$#0.base| .cse9)) |c_#memory_$Pointer$#0.base|) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse10) 0) 0) (<= 0 v_prenex_15) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse8 (select |v_#memory_$Pointer$#0.base_219| .cse8)) |v_#memory_$Pointer$#0.base_219|) (not (= (select .cse11 |ULTIMATE.start_create_internal_~now~0#1.offset|) .cse9)) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse9 (select |v_#memory_$Pointer$#0.offset_204| .cse9)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse9 (select |c_#memory_$Pointer$#0.offset| .cse9)) |c_#memory_$Pointer$#0.offset|) (not (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse9)) (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse10) (<= v_prenex_15 |c_ULTIMATE.start_destroy_internal_~l#1.offset|))))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse12 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|)) (.cse13 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|)) (.cse14 (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_destroy_internal_~l#1.base|) |ULTIMATE.start_create_internal_~now~0#1.offset|))) (and (= .cse12 .cse13) (= (store |v_#memory_$Pointer$#0.base_219| .cse13 (select |c_#memory_$Pointer$#0.base| .cse13)) |c_#memory_$Pointer$#0.base|) (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_destroy_internal_~l#1.offset|) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse12 (select |v_#memory_$Pointer$#0.base_219| .cse12)) |v_#memory_$Pointer$#0.base_219|) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse14) 0) 0) (not (= .cse14 .cse13)) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse13 (select |v_#memory_$Pointer$#0.offset_204| .cse13)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse13 (select |c_#memory_$Pointer$#0.offset| .cse13)) |c_#memory_$Pointer$#0.offset|) (not (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse13)) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|) (= (select (select |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse14) 0) 0)))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse15 (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_destroy_internal_~l#1.base|) |ULTIMATE.start_create_internal_~now~0#1.offset|)) (.cse16 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|))) (and (not (= .cse15 .cse16)) (not (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse16)) (<= |ULTIMATE.start_create_internal_~now~0#1.offset| |c_ULTIMATE.start_destroy_internal_~l#1.offset|) (= (select (select |c_#memory_$Pointer$#0.offset| .cse15) 0) 0) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse16 (select |v_#memory_$Pointer$#0.base_219| .cse16)) |v_#memory_$Pointer$#0.base_219|) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse15) 0) 0) (= |c_#memory_$Pointer$#0.base| (store |v_#memory_$Pointer$#0.base_219| .cse16 (select |c_#memory_$Pointer$#0.base| .cse16))) (<= 0 |ULTIMATE.start_create_internal_~now~0#1.offset|)))) (and (<= 0 |c_ULTIMATE.start_destroy_internal_~l#1.offset|) (= .cse4 |c_ULTIMATE.start_destroy_internal_~l#1.base|)) (and .cse17 .cse3) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse22 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_destroy_internal_~l#1.base|))) (let ((.cse18 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|)) (.cse21 (select .cse22 |ULTIMATE.start_create_internal_~now~0#1.offset|)) (.cse19 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|)) (.cse20 (select .cse22 v_prenex_15))) (and (= .cse18 .cse19) (= (store |v_#memory_$Pointer$#0.base_219| .cse19 (select |c_#memory_$Pointer$#0.base| .cse19)) |c_#memory_$Pointer$#0.base|) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse20) 0) 0) (<= 0 v_prenex_15) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse18 (select |v_#memory_$Pointer$#0.base_219| .cse18)) |v_#memory_$Pointer$#0.base_219|) (not (= .cse21 .cse19)) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse19 (select |v_#memory_$Pointer$#0.offset_204| .cse19)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse19 (select |c_#memory_$Pointer$#0.offset| .cse19)) |c_#memory_$Pointer$#0.offset|) (not (= .cse21 |c_ULTIMATE.start_destroy_internal_~l#1.base|)) (not (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse19)) (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse20) (<= v_prenex_15 |c_ULTIMATE.start_destroy_internal_~l#1.offset|))))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse26 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_destroy_internal_~l#1.base|))) (let ((.cse23 (select .cse26 |ULTIMATE.start_create_internal_~now~0#1.offset|)) (.cse24 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|)) (.cse25 (select .cse26 v_prenex_15))) (and (not (= .cse23 .cse24)) (not (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse24)) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse25) 0) 0) (<= 0 v_prenex_15) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse24 (select |v_#memory_$Pointer$#0.base_219| .cse24)) |v_#memory_$Pointer$#0.base_219|) (not (= .cse23 |c_ULTIMATE.start_destroy_internal_~l#1.base|)) (= |c_#memory_$Pointer$#0.base| (store |v_#memory_$Pointer$#0.base_219| .cse24 (select |c_#memory_$Pointer$#0.base| .cse24))) (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse25) (<= v_prenex_15 |c_ULTIMATE.start_destroy_internal_~l#1.offset|))))) (and (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse27 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|))) (and (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse27 (select |v_#memory_$Pointer$#0.offset_204| .cse27)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse27 (select |c_#memory_$Pointer$#0.offset| .cse27)) |c_#memory_$Pointer$#0.offset|) (not (= (select .cse2 |ULTIMATE.start_create_internal_~now~0#1.offset|) .cse27)) (not (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse27))))) .cse3) (and (exists ((|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse28 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|))) (and (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse28 (select |v_#memory_$Pointer$#0.offset_204| .cse28)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse28 (select |c_#memory_$Pointer$#0.offset| .cse28)) |c_#memory_$Pointer$#0.offset|) (not (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse28))))) .cse17 .cse3) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse31 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_destroy_internal_~l#1.base|))) (let ((.cse29 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|)) (.cse30 (select .cse31 v_prenex_15))) (and (not (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse29)) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse30) 0) 0) (<= 0 v_prenex_15) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse29 (select |v_#memory_$Pointer$#0.base_219| .cse29)) |v_#memory_$Pointer$#0.base_219|) (not (= (select .cse31 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_destroy_internal_~l#1.base|)) (= |c_#memory_$Pointer$#0.base| (store |v_#memory_$Pointer$#0.base_219| .cse29 (select |c_#memory_$Pointer$#0.base| .cse29))) (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse30) (<= v_prenex_15 |c_ULTIMATE.start_destroy_internal_~l#1.offset|))))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse32 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_destroy_internal_~l#1.base|))) (let ((.cse33 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|)) (.cse34 (select .cse32 v_prenex_15))) (and (not (= (select .cse32 |ULTIMATE.start_create_internal_~now~0#1.offset|) .cse33)) (not (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse33)) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse34) 0) 0) (<= 0 v_prenex_15) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse33 (select |v_#memory_$Pointer$#0.base_219| .cse33)) |v_#memory_$Pointer$#0.base_219|) (= |c_#memory_$Pointer$#0.base| (store |v_#memory_$Pointer$#0.base_219| .cse33 (select |c_#memory_$Pointer$#0.base| .cse33))) (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse34) (<= v_prenex_15 |c_ULTIMATE.start_destroy_internal_~l#1.offset|))))) (exists ((|ULTIMATE.start_create_internal_~now~0#1.offset| Int) (v_prenex_15 Int) (|v_#memory_$Pointer$#0.base_219| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#0.offset_204| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| (Array Int (Array Int Int)))) (let ((.cse38 (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |c_ULTIMATE.start_destroy_internal_~l#1.base|))) (let ((.cse35 (@diff |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| |v_#memory_$Pointer$#0.base_219|)) (.cse36 (@diff |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| |v_#memory_$Pointer$#0.offset_204|)) (.cse37 (select .cse38 v_prenex_15))) (and (= .cse35 .cse36) (= (store |v_#memory_$Pointer$#0.base_219| .cse36 (select |c_#memory_$Pointer$#0.base| .cse36)) |c_#memory_$Pointer$#0.base|) (= (select (select |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse37) 0) 0) (<= 0 v_prenex_15) (= (store |v_old(#memory_$Pointer$#0.base)_AFTER_CALL_60| .cse35 (select |v_#memory_$Pointer$#0.base_219| .cse35)) |v_#memory_$Pointer$#0.base_219|) (= (store |v_old(#memory_$Pointer$#0.offset)_AFTER_CALL_60| .cse36 (select |v_#memory_$Pointer$#0.offset_204| .cse36)) |v_#memory_$Pointer$#0.offset_204|) (= (store |v_#memory_$Pointer$#0.offset_204| .cse36 (select |c_#memory_$Pointer$#0.offset| .cse36)) |c_#memory_$Pointer$#0.offset|) (not (= (select .cse38 |ULTIMATE.start_create_internal_~now~0#1.offset|) |c_ULTIMATE.start_destroy_internal_~l#1.base|)) (not (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse36)) (= |c_ULTIMATE.start_destroy_internal_~l#1.base| .cse37) (<= v_prenex_15 |c_ULTIMATE.start_destroy_internal_~l#1.offset|)))))))) is different from true