./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/dll-middle-data.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/dll-middle-data.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 55fed19fd46c3c3877aeb4601619875fca08ed123cdc32456163a7ce3c0dda73 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:54:01,492 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:54:01,575 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-09 07:54:01,583 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:54:01,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:54:01,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:54:01,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:54:01,616 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:54:01,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:54:01,618 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:54:01,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:54:01,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:54:01,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:54:01,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:54:01,622 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:54:01,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:54:01,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:54:01,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:54:01,623 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:54:01,623 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:54:01,624 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:54:01,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:54:01,624 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:54:01,625 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:54:01,625 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:54:01,626 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:54:01,626 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:54:01,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:54:01,627 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:54:01,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:54:01,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:54:01,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:54:01,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:54:01,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:54:01,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:54:01,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:54:01,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:54:01,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:54:01,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:54:01,630 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 -> 55fed19fd46c3c3877aeb4601619875fca08ed123cdc32456163a7ce3c0dda73 [2024-11-09 07:54:01,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:54:01,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:54:01,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:54:01,924 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:54:01,925 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:54:01,926 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/dll-middle-data.i [2024-11-09 07:54:03,408 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:54:03,699 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:54:03,700 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-middle-data.i [2024-11-09 07:54:03,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4d81cf5e/645e9c33a73d43c7be798f9d47620d62/FLAGbfab4cc21 [2024-11-09 07:54:03,756 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4d81cf5e/645e9c33a73d43c7be798f9d47620d62 [2024-11-09 07:54:03,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:54:03,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:54:03,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:54:03,765 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:54:03,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:54:03,771 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:54:03" (1/1) ... [2024-11-09 07:54:03,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c4a6f85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:03, skipping insertion in model container [2024-11-09 07:54:03,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:54:03" (1/1) ... [2024-11-09 07:54:03,830 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:54:04,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:54:04,220 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:54:04,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:54:04,334 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:54:04,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:04 WrapperNode [2024-11-09 07:54:04,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:54:04,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:54:04,336 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:54:04,336 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:54:04,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:04" (1/1) ... [2024-11-09 07:54:04,356 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:04" (1/1) ... [2024-11-09 07:54:04,379 INFO L138 Inliner]: procedures = 121, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 80 [2024-11-09 07:54:04,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:54:04,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:54:04,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:54:04,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:54:04,392 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:04" (1/1) ... [2024-11-09 07:54:04,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:04" (1/1) ... [2024-11-09 07:54:04,400 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:04" (1/1) ... [2024-11-09 07:54:04,427 INFO L175 MemorySlicer]: Split 16 memory accesses to 1 slices as follows [16]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 10 writes are split as follows [10]. [2024-11-09 07:54:04,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:04" (1/1) ... [2024-11-09 07:54:04,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:04" (1/1) ... [2024-11-09 07:54:04,434 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:04" (1/1) ... [2024-11-09 07:54:04,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:04" (1/1) ... [2024-11-09 07:54:04,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:04" (1/1) ... [2024-11-09 07:54:04,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:04" (1/1) ... [2024-11-09 07:54:04,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:54:04,449 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:54:04,450 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:54:04,450 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:54:04,452 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:04" (1/1) ... [2024-11-09 07:54:04,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:54:04,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:04,490 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:54:04,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:54:04,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:54:04,533 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-09 07:54:04,533 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-09 07:54:04,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:54:04,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:54:04,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:54:04,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:54:04,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:54:04,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:54:04,639 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:54:04,641 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:54:05,016 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-09 07:54:05,017 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:54:05,034 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:54:05,037 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 07:54:05,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:54:05 BoogieIcfgContainer [2024-11-09 07:54:05,042 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:54:05,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:54:05,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:54:05,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:54:05,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:54:03" (1/3) ... [2024-11-09 07:54:05,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8e15f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:54:05, skipping insertion in model container [2024-11-09 07:54:05,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:04" (2/3) ... [2024-11-09 07:54:05,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8e15f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:54:05, skipping insertion in model container [2024-11-09 07:54:05,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:54:05" (3/3) ... [2024-11-09 07:54:05,052 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-middle-data.i [2024-11-09 07:54:05,070 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:54:05,070 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2024-11-09 07:54:05,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:54:05,125 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;@2b7cff8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:54:05,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2024-11-09 07:54:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 83 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:54:05,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:54:05,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:05,139 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:54:05,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:05,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:05,145 INFO L85 PathProgramCache]: Analyzing trace with hash 43105657, now seen corresponding path program 1 times [2024-11-09 07:54:05,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:05,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787079473] [2024-11-09 07:54:05,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:05,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:05,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:05,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:05,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787079473] [2024-11-09 07:54:05,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787079473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:05,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:05,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:54:05,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820484106] [2024-11-09 07:54:05,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:05,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:54:05,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:05,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:54:05,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:54:05,442 INFO L87 Difference]: Start difference. First operand has 87 states, 47 states have (on average 1.8936170212765957) internal successors, (89), 83 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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-09 07:54:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:05,554 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-11-09 07:54:05,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:54:05,557 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-09 07:54:05,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:05,564 INFO L225 Difference]: With dead ends: 83 [2024-11-09 07:54:05,565 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 07:54:05,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:54:05,572 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:05,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 123 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:05,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 07:54:05,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-09 07:54:05,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 77 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:54:05,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-11-09 07:54:05,617 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 5 [2024-11-09 07:54:05,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:05,617 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-11-09 07:54:05,618 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-09 07:54:05,618 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-11-09 07:54:05,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:54:05,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:05,619 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:54:05,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:54:05,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:05,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:05,620 INFO L85 PathProgramCache]: Analyzing trace with hash 43105658, now seen corresponding path program 1 times [2024-11-09 07:54:05,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:05,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413723394] [2024-11-09 07:54:05,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:05,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:05,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:05,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:05,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413723394] [2024-11-09 07:54:05,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413723394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:05,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:05,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:54:05,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474975366] [2024-11-09 07:54:05,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:05,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:54:05,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:05,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:54:05,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:54:05,766 INFO L87 Difference]: Start difference. First operand 81 states and 84 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-09 07:54:05,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:05,829 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2024-11-09 07:54:05,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:54:05,830 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-09 07:54:05,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:05,831 INFO L225 Difference]: With dead ends: 77 [2024-11-09 07:54:05,832 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 07:54:05,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:54:05,834 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:05,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 125 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:05,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 07:54:05,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-09 07:54:05,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 73 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:54:05,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2024-11-09 07:54:05,842 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 5 [2024-11-09 07:54:05,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:05,843 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2024-11-09 07:54:05,843 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-09 07:54:05,843 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2024-11-09 07:54:05,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:54:05,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:05,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:54:05,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:54:05,845 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:05,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:05,846 INFO L85 PathProgramCache]: Analyzing trace with hash 188280013, now seen corresponding path program 1 times [2024-11-09 07:54:05,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:05,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129920398] [2024-11-09 07:54:05,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:05,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:06,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:06,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:06,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:06,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129920398] [2024-11-09 07:54:06,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129920398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:06,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:06,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:54:06,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714257073] [2024-11-09 07:54:06,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:06,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:54:06,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:06,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:54:06,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:54:06,156 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:06,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:06,356 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2024-11-09 07:54:06,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:54:06,357 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-09 07:54:06,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:06,360 INFO L225 Difference]: With dead ends: 76 [2024-11-09 07:54:06,361 INFO L226 Difference]: Without dead ends: 76 [2024-11-09 07:54:06,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-09 07:54:06,363 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 26 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:06,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 201 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:54:06,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-09 07:54:06,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2024-11-09 07:54:06,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 67 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:54:06,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2024-11-09 07:54:06,379 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 13 [2024-11-09 07:54:06,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:06,379 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2024-11-09 07:54:06,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:06,380 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2024-11-09 07:54:06,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:54:06,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:06,381 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:54:06,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:54:06,382 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:06,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:06,383 INFO L85 PathProgramCache]: Analyzing trace with hash 188280014, now seen corresponding path program 1 times [2024-11-09 07:54:06,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:06,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980011199] [2024-11-09 07:54:06,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:06,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:06,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:06,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:06,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980011199] [2024-11-09 07:54:06,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980011199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:06,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:06,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:54:06,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426946332] [2024-11-09 07:54:06,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:06,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:54:06,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:06,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:54:06,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:54:06,764 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:06,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:06,933 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2024-11-09 07:54:06,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:54:06,934 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-09 07:54:06,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:06,935 INFO L225 Difference]: With dead ends: 74 [2024-11-09 07:54:06,935 INFO L226 Difference]: Without dead ends: 74 [2024-11-09 07:54:06,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-09 07:54:06,936 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 8 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:06,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 242 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:54:06,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-09 07:54:06,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2024-11-09 07:54:06,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:54:06,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-11-09 07:54:06,951 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 13 [2024-11-09 07:54:06,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:06,952 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-11-09 07:54:06,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:06,952 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2024-11-09 07:54:06,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:54:06,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:06,953 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] [2024-11-09 07:54:06,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:54:06,954 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:06,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:06,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1968389437, now seen corresponding path program 1 times [2024-11-09 07:54:06,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:06,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838721436] [2024-11-09 07:54:06,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:06,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:07,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:07,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:07,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:07,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838721436] [2024-11-09 07:54:07,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838721436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:07,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:07,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:54:07,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682208121] [2024-11-09 07:54:07,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:07,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:54:07,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:07,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:54:07,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:54:07,169 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:07,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:07,369 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2024-11-09 07:54:07,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:54:07,370 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-09 07:54:07,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:07,372 INFO L225 Difference]: With dead ends: 106 [2024-11-09 07:54:07,372 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 07:54:07,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:54:07,377 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 73 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:07,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 216 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:54:07,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 07:54:07,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2024-11-09 07:54:07,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.542857142857143) internal successors, (108), 89 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:07,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2024-11-09 07:54:07,390 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 23 [2024-11-09 07:54:07,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:07,391 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2024-11-09 07:54:07,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:07,391 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2024-11-09 07:54:07,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:54:07,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:07,392 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] [2024-11-09 07:54:07,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:54:07,393 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:07,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:07,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1968389436, now seen corresponding path program 1 times [2024-11-09 07:54:07,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:07,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67594500] [2024-11-09 07:54:07,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:07,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:07,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:07,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:07,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67594500] [2024-11-09 07:54:07,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67594500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:07,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:07,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:54:07,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163473661] [2024-11-09 07:54:07,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:07,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:54:07,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:07,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:54:07,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:54:07,854 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:08,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:08,079 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2024-11-09 07:54:08,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:54:08,080 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-09 07:54:08,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:08,081 INFO L225 Difference]: With dead ends: 99 [2024-11-09 07:54:08,081 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 07:54:08,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:54:08,083 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 1 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:08,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 289 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:54:08,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 07:54:08,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-09 07:54:08,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.52) internal successors, (114), 94 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2024-11-09 07:54:08,095 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 23 [2024-11-09 07:54:08,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:08,096 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2024-11-09 07:54:08,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:08,100 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2024-11-09 07:54:08,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:54:08,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:08,101 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] [2024-11-09 07:54:08,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:54:08,101 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:08,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:08,102 INFO L85 PathProgramCache]: Analyzing trace with hash -890581727, now seen corresponding path program 1 times [2024-11-09 07:54:08,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:08,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721302368] [2024-11-09 07:54:08,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:08,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:08,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:08,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:08,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:08,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721302368] [2024-11-09 07:54:08,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721302368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:08,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:08,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:54:08,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449304678] [2024-11-09 07:54:08,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:08,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:54:08,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:08,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:54:08,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:54:08,292 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:08,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:08,403 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2024-11-09 07:54:08,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:54:08,404 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-09 07:54:08,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:08,406 INFO L225 Difference]: With dead ends: 102 [2024-11-09 07:54:08,406 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 07:54:08,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:54:08,407 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 30 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:08,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 409 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:08,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 07:54:08,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2024-11-09 07:54:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 76 states have (on average 1.486842105263158) internal successors, (113), 95 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2024-11-09 07:54:08,422 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 24 [2024-11-09 07:54:08,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:08,422 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2024-11-09 07:54:08,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:08,423 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2024-11-09 07:54:08,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:54:08,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:08,423 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] [2024-11-09 07:54:08,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:54:08,424 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 33 more)] === [2024-11-09 07:54:08,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:08,424 INFO L85 PathProgramCache]: Analyzing trace with hash 223592766, now seen corresponding path program 1 times [2024-11-09 07:54:08,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:08,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626554540] [2024-11-09 07:54:08,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:08,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:09,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:09,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:09,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:09,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626554540] [2024-11-09 07:54:09,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626554540] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:09,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704016425] [2024-11-09 07:54:09,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:09,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:09,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:09,462 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:54:09,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:54:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:09,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-09 07:54:09,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:54:09,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:54:09,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:54:09,714 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-09 07:54:09,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:54:09,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:09,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:54:09,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:54:09,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:09,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:54:09,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:54:10,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:10,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:10,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:54:10,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:10,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:54:10,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:54:10,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:54:10,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:10,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:54:10,486 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 20 |c_ULTIMATE.start_create_~now~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_ArrVal_420 (Array Int Int))) (or (= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base| v_ArrVal_420) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse0)) (not (= v_ArrVal_420 (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1 (select v_ArrVal_420 .cse1)))))) (forall ((v_ArrVal_419 Int)) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1 v_ArrVal_419)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse0) 0)))) is different from false [2024-11-09 07:54:11,565 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 15 [2024-11-09 07:54:11,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2024-11-09 07:54:11,584 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 15 [2024-11-09 07:54:11,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:11,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704016425] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:54:11,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:54:11,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 30 [2024-11-09 07:54:11,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682974362] [2024-11-09 07:54:11,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:54:11,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 07:54:11,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:11,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 07:54:11,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=726, Unknown=1, NotChecked=54, Total=870 [2024-11-09 07:54:11,623 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 26 states have internal predecessors, (59), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:54:12,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:12,110 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2024-11-09 07:54:12,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:54:12,111 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 26 states have internal predecessors, (59), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-11-09 07:54:12,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:12,112 INFO L225 Difference]: With dead ends: 102 [2024-11-09 07:54:12,112 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 07:54:12,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=99, Invalid=834, Unknown=1, NotChecked=58, Total=992 [2024-11-09 07:54:12,113 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 13 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:12,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 875 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 485 Invalid, 0 Unknown, 44 Unchecked, 0.4s Time] [2024-11-09 07:54:12,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 07:54:12,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-09 07:54:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 97 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:12,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2024-11-09 07:54:12,119 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 27 [2024-11-09 07:54:12,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:12,119 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2024-11-09 07:54:12,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 26 states have internal predecessors, (59), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:54:12,120 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2024-11-09 07:54:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:54:12,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:12,120 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] [2024-11-09 07:54:12,141 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-09 07:54:12,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:12,325 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:12,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:12,325 INFO L85 PathProgramCache]: Analyzing trace with hash -726274359, now seen corresponding path program 1 times [2024-11-09 07:54:12,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:12,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110748590] [2024-11-09 07:54:12,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:12,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:12,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:12,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 07:54:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:12,637 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:12,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:12,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110748590] [2024-11-09 07:54:12,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110748590] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:12,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832898857] [2024-11-09 07:54:12,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:12,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:12,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:12,642 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:54:12,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:54:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:12,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 07:54:12,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:54:12,805 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-09 07:54:12,852 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:54:12,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 07:54:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:12,855 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:54:12,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832898857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:12,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:54:12,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-09 07:54:12,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547019531] [2024-11-09 07:54:12,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:12,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:54:12,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:12,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:54:12,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-11-09 07:54:12,857 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 2 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-09 07:54:12,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:12,919 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2024-11-09 07:54:12,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:54:12,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 2 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 28 [2024-11-09 07:54:12,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:12,920 INFO L225 Difference]: With dead ends: 102 [2024-11-09 07:54:12,920 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 07:54:12,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 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-09 07:54:12,921 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 21 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:12,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 103 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 96 Unchecked, 0.1s Time] [2024-11-09 07:54:12,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 07:54:12,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-09 07:54:12,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 78 states have (on average 1.4615384615384615) internal successors, (114), 97 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:12,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 120 transitions. [2024-11-09 07:54:12,927 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 120 transitions. Word has length 28 [2024-11-09 07:54:12,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:12,927 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 120 transitions. [2024-11-09 07:54:12,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (2), 2 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-09 07:54:12,927 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2024-11-09 07:54:12,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:54:12,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:12,928 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] [2024-11-09 07:54:12,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:54:13,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-09 07:54:13,133 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:13,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:13,133 INFO L85 PathProgramCache]: Analyzing trace with hash -726274358, now seen corresponding path program 1 times [2024-11-09 07:54:13,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:13,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029895081] [2024-11-09 07:54:13,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:13,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:13,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:13,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 07:54:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:13,576 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:13,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:13,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029895081] [2024-11-09 07:54:13,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029895081] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:13,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957524196] [2024-11-09 07:54:13,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:13,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:13,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:13,580 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:54:13,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:54:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:13,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:54:13,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:54:13,792 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-09 07:54:13,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:13,837 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-09 07:54:13,847 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:54:13,848 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-09 07:54:13,866 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:13,866 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:54:13,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957524196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:13,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:54:13,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2024-11-09 07:54:13,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444199475] [2024-11-09 07:54:13,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:13,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:54:13,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:13,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:54:13,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2024-11-09 07:54:13,869 INFO L87 Difference]: Start difference. First operand 102 states and 120 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 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-09 07:54:13,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:13,975 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2024-11-09 07:54:13,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:54:13,975 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 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 28 [2024-11-09 07:54:13,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:13,976 INFO L225 Difference]: With dead ends: 108 [2024-11-09 07:54:13,976 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 07:54:13,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2024-11-09 07:54:13,977 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 61 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:13,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 145 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 109 Invalid, 0 Unknown, 128 Unchecked, 0.1s Time] [2024-11-09 07:54:13,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 07:54:13,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2024-11-09 07:54:13,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 97 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:13,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2024-11-09 07:54:13,982 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 28 [2024-11-09 07:54:13,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:13,982 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2024-11-09 07:54:13,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 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-09 07:54:13,983 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2024-11-09 07:54:13,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:54:13,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:13,983 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] [2024-11-09 07:54:14,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 07:54:14,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:14,185 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:14,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:14,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1658610170, now seen corresponding path program 1 times [2024-11-09 07:54:14,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:14,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923703898] [2024-11-09 07:54:14,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:14,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:14,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:14,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:14,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:14,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923703898] [2024-11-09 07:54:14,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923703898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:14,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:14,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:54:14,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770092229] [2024-11-09 07:54:14,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:14,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:54:14,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:14,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:54:14,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:54:14,304 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:14,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:14,477 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2024-11-09 07:54:14,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:54:14,477 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-09 07:54:14,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:14,478 INFO L225 Difference]: With dead ends: 117 [2024-11-09 07:54:14,478 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 07:54:14,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:54:14,479 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 57 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:14,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 240 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:54:14,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 07:54:14,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2024-11-09 07:54:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 85 states have (on average 1.411764705882353) internal successors, (120), 103 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:14,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2024-11-09 07:54:14,483 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 28 [2024-11-09 07:54:14,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:14,484 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2024-11-09 07:54:14,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:14,484 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2024-11-09 07:54:14,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:54:14,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:14,485 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] [2024-11-09 07:54:14,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:54:14,485 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:14,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:14,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1658610169, now seen corresponding path program 1 times [2024-11-09 07:54:14,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:14,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15458558] [2024-11-09 07:54:14,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:14,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:14,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:14,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:14,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:14,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15458558] [2024-11-09 07:54:14,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15458558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:14,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:14,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:54:14,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708291819] [2024-11-09 07:54:14,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:14,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:54:14,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:14,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:54:14,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:54:14,767 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:14,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:14,999 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2024-11-09 07:54:15,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:54:15,000 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-09 07:54:15,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:15,001 INFO L225 Difference]: With dead ends: 113 [2024-11-09 07:54:15,001 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 07:54:15,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:54:15,002 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 6 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:15,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 348 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:54:15,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 07:54:15,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-09 07:54:15,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.4) internal successors, (126), 108 states have internal predecessors, (126), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:15,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 132 transitions. [2024-11-09 07:54:15,008 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 132 transitions. Word has length 28 [2024-11-09 07:54:15,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:15,009 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 132 transitions. [2024-11-09 07:54:15,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:15,009 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2024-11-09 07:54:15,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:54:15,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:15,012 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-09 07:54:15,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:54:15,012 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:15,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:15,013 INFO L85 PathProgramCache]: Analyzing trace with hash 122690851, now seen corresponding path program 1 times [2024-11-09 07:54:15,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:15,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416219203] [2024-11-09 07:54:15,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:15,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:15,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:15,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:15,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:15,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416219203] [2024-11-09 07:54:15,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416219203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:15,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:15,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:54:15,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561537110] [2024-11-09 07:54:15,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:15,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:54:15,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:15,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:54:15,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:54:15,182 INFO L87 Difference]: Start difference. First operand 113 states and 132 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:15,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:15,316 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2024-11-09 07:54:15,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:54:15,316 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-11-09 07:54:15,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:15,317 INFO L225 Difference]: With dead ends: 120 [2024-11-09 07:54:15,317 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 07:54:15,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:54:15,318 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 36 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:15,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 428 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:15,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 07:54:15,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2024-11-09 07:54:15,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 109 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:15,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2024-11-09 07:54:15,325 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 29 [2024-11-09 07:54:15,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:15,327 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2024-11-09 07:54:15,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:15,327 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2024-11-09 07:54:15,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:54:15,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:15,328 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] [2024-11-09 07:54:15,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:54:15,328 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:15,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:15,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1605820231, now seen corresponding path program 1 times [2024-11-09 07:54:15,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:15,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998550151] [2024-11-09 07:54:15,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:15,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:15,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:15,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 07:54:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:15,650 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:15,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:15,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998550151] [2024-11-09 07:54:15,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998550151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:15,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:15,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:54:15,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679568029] [2024-11-09 07:54:15,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:15,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:54:15,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:15,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:54:15,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:54:15,653 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 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-09 07:54:15,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:15,806 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2024-11-09 07:54:15,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:54:15,806 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 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 31 [2024-11-09 07:54:15,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:15,807 INFO L225 Difference]: With dead ends: 113 [2024-11-09 07:54:15,807 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 07:54:15,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-09 07:54:15,808 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 4 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:15,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 273 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:15,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 07:54:15,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-09 07:54:15,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 108 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:15,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2024-11-09 07:54:15,812 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 31 [2024-11-09 07:54:15,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:15,812 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2024-11-09 07:54:15,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 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-09 07:54:15,812 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2024-11-09 07:54:15,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:54:15,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:15,813 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] [2024-11-09 07:54:15,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:54:15,813 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:15,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:15,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1605820230, now seen corresponding path program 1 times [2024-11-09 07:54:15,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:15,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548346673] [2024-11-09 07:54:15,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:15,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:15,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:15,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 07:54:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:15,977 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:54:15,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:15,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548346673] [2024-11-09 07:54:15,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548346673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:15,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:15,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:54:15,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163219124] [2024-11-09 07:54:15,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:15,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:54:15,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:15,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:54:15,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:54:15,980 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:54:16,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:16,117 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2024-11-09 07:54:16,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:54:16,118 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-11-09 07:54:16,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:16,118 INFO L225 Difference]: With dead ends: 112 [2024-11-09 07:54:16,119 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 07:54:16,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-09 07:54:16,119 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 8 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:16,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 257 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:16,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 07:54:16,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-09 07:54:16,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 107 states have internal predecessors, (121), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:16,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2024-11-09 07:54:16,123 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 31 [2024-11-09 07:54:16,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:16,123 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2024-11-09 07:54:16,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:54:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2024-11-09 07:54:16,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:54:16,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:16,126 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] [2024-11-09 07:54:16,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:54:16,126 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:16,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:16,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1943242535, now seen corresponding path program 1 times [2024-11-09 07:54:16,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:16,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080883166] [2024-11-09 07:54:16,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:16,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:16,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:16,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:16,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:16,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080883166] [2024-11-09 07:54:16,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080883166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:16,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:16,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:54:16,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283469477] [2024-11-09 07:54:16,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:16,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:54:16,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:16,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:54:16,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:54:16,280 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:16,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:16,431 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2024-11-09 07:54:16,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:54:16,432 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-11-09 07:54:16,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:16,433 INFO L225 Difference]: With dead ends: 117 [2024-11-09 07:54:16,433 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 07:54:16,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:54:16,434 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 30 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:16,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 388 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:16,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 07:54:16,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-11-09 07:54:16,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 95 states have (on average 1.3473684210526315) internal successors, (128), 111 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:16,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2024-11-09 07:54:16,441 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 31 [2024-11-09 07:54:16,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:16,442 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2024-11-09 07:54:16,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2024-11-09 07:54:16,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 07:54:16,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:16,443 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] [2024-11-09 07:54:16,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:54:16,444 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:16,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:16,445 INFO L85 PathProgramCache]: Analyzing trace with hash -725680917, now seen corresponding path program 1 times [2024-11-09 07:54:16,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:16,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232194168] [2024-11-09 07:54:16,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:16,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:17,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:17,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:17,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:17,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232194168] [2024-11-09 07:54:17,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232194168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:17,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468321403] [2024-11-09 07:54:17,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:17,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:17,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:17,419 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:54:17,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:54:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:17,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-09 07:54:17,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:54:17,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:54:17,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:54:17,621 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-09 07:54:17,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:54:17,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:17,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:54:17,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:54:17,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:17,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:54:17,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:54:17,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:54:17,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:54:17,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:54:17,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:54:18,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:18,076 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 15 [2024-11-09 07:54:18,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:18,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 26 [2024-11-09 07:54:18,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:18,189 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:54:18,439 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 20 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((v_ArrVal_1426 Int)) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 v_ArrVal_1426)) |c_ULTIMATE.start_create_~dll~0#1.base|) 4) 0)) (forall ((v_ArrVal_1425 (Array Int Int))) (or (not (= v_ArrVal_1425 (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select v_ArrVal_1425 .cse0)))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base| v_ArrVal_1425) |c_ULTIMATE.start_create_~dll~0#1.base|) 4) 0))))) is different from false [2024-11-09 07:54:18,467 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 20 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((v_ArrVal_1420 Int) (v_ArrVal_1426 Int)) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| (store (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| v_ArrVal_1420) .cse0 v_ArrVal_1426)) |c_ULTIMATE.start_create_~dll~0#1.base|) 4) 0)) (forall ((v_ArrVal_1425 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base| v_ArrVal_1425) |c_ULTIMATE.start_create_~dll~0#1.base|) 4) 0) (not (= v_ArrVal_1425 (store (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| (select v_ArrVal_1425 |c_ULTIMATE.start_create_~now~0#1.offset|)) .cse0 (select v_ArrVal_1425 .cse0)))))))) is different from false [2024-11-09 07:54:18,973 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 23 [2024-11-09 07:54:18,975 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 442 treesize of output 438 [2024-11-09 07:54:18,994 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 23 [2024-11-09 07:54:18,997 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:54:18,997 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:54:18,999 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-09 07:54:19,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:19,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468321403] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:54:19,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:54:19,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 38 [2024-11-09 07:54:19,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502110021] [2024-11-09 07:54:19,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:54:19,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 07:54:19,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:19,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 07:54:19,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1158, Unknown=2, NotChecked=138, Total=1406 [2024-11-09 07:54:19,006 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand has 38 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 34 states have internal predecessors, (82), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:54:19,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:19,791 INFO L93 Difference]: Finished difference Result 119 states and 137 transitions. [2024-11-09 07:54:19,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 07:54:19,791 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 34 states have internal predecessors, (82), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2024-11-09 07:54:19,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:19,792 INFO L225 Difference]: With dead ends: 119 [2024-11-09 07:54:19,793 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 07:54:19,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=157, Invalid=1655, Unknown=2, NotChecked=166, Total=1980 [2024-11-09 07:54:19,794 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 15 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:19,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1046 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 717 Invalid, 0 Unknown, 105 Unchecked, 0.5s Time] [2024-11-09 07:54:19,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 07:54:19,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-09 07:54:19,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 98 states have (on average 1.336734693877551) internal successors, (131), 114 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:19,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 137 transitions. [2024-11-09 07:54:19,798 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 137 transitions. Word has length 34 [2024-11-09 07:54:19,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:19,798 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 137 transitions. [2024-11-09 07:54:19,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 34 states have internal predecessors, (82), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:54:19,799 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 137 transitions. [2024-11-09 07:54:19,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:54:19,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:19,799 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] [2024-11-09 07:54:19,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 07:54:20,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 07:54:20,000 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:20,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:20,001 INFO L85 PathProgramCache]: Analyzing trace with hash -552420024, now seen corresponding path program 1 times [2024-11-09 07:54:20,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:20,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106610623] [2024-11-09 07:54:20,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:20,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:20,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:20,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 07:54:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:20,405 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:20,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:20,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106610623] [2024-11-09 07:54:20,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106610623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:20,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:20,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:54:20,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438582759] [2024-11-09 07:54:20,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:20,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:54:20,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:20,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:54:20,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:54:20,408 INFO L87 Difference]: Start difference. First operand 119 states and 137 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 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-09 07:54:20,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:20,616 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2024-11-09 07:54:20,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:54:20,617 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 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 35 [2024-11-09 07:54:20,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:20,618 INFO L225 Difference]: With dead ends: 120 [2024-11-09 07:54:20,618 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 07:54:20,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:54:20,619 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 34 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:20,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 266 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:54:20,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 07:54:20,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-11-09 07:54:20,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 98 states have (on average 1.3265306122448979) internal successors, (130), 114 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:20,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 136 transitions. [2024-11-09 07:54:20,624 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 136 transitions. Word has length 35 [2024-11-09 07:54:20,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:20,625 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 136 transitions. [2024-11-09 07:54:20,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 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-09 07:54:20,626 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 136 transitions. [2024-11-09 07:54:20,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:54:20,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:20,626 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] [2024-11-09 07:54:20,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:54:20,627 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:20,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:20,628 INFO L85 PathProgramCache]: Analyzing trace with hash -552420023, now seen corresponding path program 1 times [2024-11-09 07:54:20,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:20,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423748876] [2024-11-09 07:54:20,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:20,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:21,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:21,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 07:54:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:21,331 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:21,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:21,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423748876] [2024-11-09 07:54:21,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423748876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:21,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:21,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 07:54:21,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305150494] [2024-11-09 07:54:21,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:21,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 07:54:21,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:21,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 07:54:21,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:54:21,334 INFO L87 Difference]: Start difference. First operand 119 states and 136 transitions. Second operand has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 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-09 07:54:21,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:21,621 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2024-11-09 07:54:21,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:54:21,622 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 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 35 [2024-11-09 07:54:21,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:21,622 INFO L225 Difference]: With dead ends: 119 [2024-11-09 07:54:21,622 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 07:54:21,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:54:21,623 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 6 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:21,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 418 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:54:21,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 07:54:21,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-09 07:54:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 98 states have (on average 1.316326530612245) internal successors, (129), 114 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:21,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2024-11-09 07:54:21,627 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 35 [2024-11-09 07:54:21,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:21,627 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2024-11-09 07:54:21,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 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-09 07:54:21,628 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2024-11-09 07:54:21,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:54:21,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:21,629 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, 1, 1, 1] [2024-11-09 07:54:21,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:54:21,630 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:21,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:21,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1021273378, now seen corresponding path program 1 times [2024-11-09 07:54:21,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:21,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433205227] [2024-11-09 07:54:21,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:21,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:21,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:21,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:21,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:21,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433205227] [2024-11-09 07:54:21,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433205227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:21,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387588030] [2024-11-09 07:54:21,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:21,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:21,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:21,863 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:54:21,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:54:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:22,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 07:54:22,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:54:22,117 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 13 treesize of output 9 [2024-11-09 07:54:22,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:22,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:54:22,201 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_#t~ret4#1.base_18| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_18|) 0)) (= (store |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_18| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2024-11-09 07:54:22,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387588030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:22,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:54:22,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 12 [2024-11-09 07:54:22,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644924449] [2024-11-09 07:54:22,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:54:22,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:54:22,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:22,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:54:22,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=132, Unknown=1, NotChecked=22, Total=182 [2024-11-09 07:54:22,205 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 10 states have internal predecessors, (38), 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-09 07:54:22,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:22,463 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2024-11-09 07:54:22,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:54:22,463 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 10 states have internal predecessors, (38), 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 35 [2024-11-09 07:54:22,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:22,464 INFO L225 Difference]: With dead ends: 121 [2024-11-09 07:54:22,464 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 07:54:22,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=132, Unknown=1, NotChecked=22, Total=182 [2024-11-09 07:54:22,466 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:22,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 386 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:54:22,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 07:54:22,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-09 07:54:22,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 99 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:22,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2024-11-09 07:54:22,470 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 35 [2024-11-09 07:54:22,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:22,470 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2024-11-09 07:54:22,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 10 states have internal predecessors, (38), 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-09 07:54:22,470 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2024-11-09 07:54:22,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 07:54:22,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:22,471 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] [2024-11-09 07:54:22,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 07:54:22,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:22,671 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:22,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:22,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1903135819, now seen corresponding path program 1 times [2024-11-09 07:54:22,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:22,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051727392] [2024-11-09 07:54:22,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:22,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:23,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:23,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 07:54:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:23,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:23,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051727392] [2024-11-09 07:54:23,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051727392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:23,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:23,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 07:54:23,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691256941] [2024-11-09 07:54:23,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:23,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 07:54:23,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:23,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 07:54:23,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:54:23,409 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 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-09 07:54:23,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:23,689 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2024-11-09 07:54:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:54:23,689 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 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 39 [2024-11-09 07:54:23,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:23,690 INFO L225 Difference]: With dead ends: 105 [2024-11-09 07:54:23,690 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 07:54:23,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:54:23,691 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 9 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:23,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 396 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:54:23,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 07:54:23,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-09 07:54:23,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 99 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:23,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2024-11-09 07:54:23,695 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 39 [2024-11-09 07:54:23,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:23,695 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2024-11-09 07:54:23,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 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-09 07:54:23,696 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2024-11-09 07:54:23,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 07:54:23,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:23,696 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] [2024-11-09 07:54:23,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 07:54:23,697 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:23,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:23,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1903135818, now seen corresponding path program 1 times [2024-11-09 07:54:23,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:23,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80990431] [2024-11-09 07:54:23,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:23,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:24,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:24,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 07:54:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:24,081 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:24,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:24,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80990431] [2024-11-09 07:54:24,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80990431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:24,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:24,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 07:54:24,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733447966] [2024-11-09 07:54:24,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:24,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:54:24,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:24,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:54:24,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:54:24,083 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 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-09 07:54:24,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:24,294 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2024-11-09 07:54:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:54:24,295 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 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 39 [2024-11-09 07:54:24,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:24,296 INFO L225 Difference]: With dead ends: 104 [2024-11-09 07:54:24,296 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 07:54:24,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:54:24,297 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 34 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:24,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 301 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:54:24,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 07:54:24,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-09 07:54:24,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 99 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:24,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2024-11-09 07:54:24,300 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 39 [2024-11-09 07:54:24,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:24,301 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2024-11-09 07:54:24,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 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-09 07:54:24,301 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2024-11-09 07:54:24,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 07:54:24,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:24,302 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] [2024-11-09 07:54:24,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 07:54:24,302 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:24,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:24,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1447824343, now seen corresponding path program 1 times [2024-11-09 07:54:24,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:24,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600595373] [2024-11-09 07:54:24,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:24,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:24,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:24,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 07:54:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:24,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:24,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600595373] [2024-11-09 07:54:24,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600595373] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:24,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304732455] [2024-11-09 07:54:24,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:24,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:24,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:24,638 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:54:24,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 07:54:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:24,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 07:54:24,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:54:25,043 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-09 07:54:25,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:54:25,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:25,177 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 21 treesize of output 25 [2024-11-09 07:54:25,289 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-09 07:54:25,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304732455] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:54:25,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:54:25,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 6] total 21 [2024-11-09 07:54:25,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138686406] [2024-11-09 07:54:25,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:54:25,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 07:54:25,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:25,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 07:54:25,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:54:25,292 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand has 22 states, 21 states have (on average 4.9523809523809526) internal successors, (104), 20 states have internal predecessors, (104), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 07:54:25,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:25,517 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2024-11-09 07:54:25,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:54:25,517 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.9523809523809526) internal successors, (104), 20 states have internal predecessors, (104), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 49 [2024-11-09 07:54:25,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:25,518 INFO L225 Difference]: With dead ends: 105 [2024-11-09 07:54:25,518 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 07:54:25,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:54:25,519 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:25,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 462 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:54:25,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 07:54:25,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-09 07:54:25,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 99 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:25,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2024-11-09 07:54:25,522 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 49 [2024-11-09 07:54:25,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:25,523 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2024-11-09 07:54:25,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.9523809523809526) internal successors, (104), 20 states have internal predecessors, (104), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 07:54:25,523 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2024-11-09 07:54:25,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 07:54:25,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:25,523 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, 1] [2024-11-09 07:54:25,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 07:54:25,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:25,724 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:25,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:25,725 INFO L85 PathProgramCache]: Analyzing trace with hash -147699503, now seen corresponding path program 1 times [2024-11-09 07:54:25,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:25,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065884666] [2024-11-09 07:54:25,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:25,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:26,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:26,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 07:54:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:26,755 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-09 07:54:26,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:26,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065884666] [2024-11-09 07:54:26,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065884666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:26,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109814591] [2024-11-09 07:54:26,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:26,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:26,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:26,757 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:54:26,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 07:54:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:26,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-09 07:54:27,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:54:27,188 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:54:27,188 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-09 07:54:27,234 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-09 07:54:27,308 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:54:27,308 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-09 07:54:27,418 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:54:27,418 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-09 07:54:27,486 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:54:27,487 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-09 07:54:27,616 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-09 07:54:27,662 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:27,662 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:54:27,782 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2537) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) 1)) is different from false [2024-11-09 07:54:27,789 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)) v_ArrVal_2537) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) 1)) is different from false [2024-11-09 07:54:27,801 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2536))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)) v_ArrVal_2537)) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) 1)) is different from false [2024-11-09 07:54:27,872 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-09 07:54:27,872 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 57 treesize of output 56 [2024-11-09 07:54:27,878 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| (select (select (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2535))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2536)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2537))) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)))) is different from false [2024-11-09 07:54:27,887 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int)) (v_ArrVal_2536 (Array Int Int)) (v_ArrVal_2535 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2535))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_2536)))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_2537)) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)))))) is different from false [2024-11-09 07:54:27,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:27,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 59 [2024-11-09 07:54:27,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:27,914 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 11840 treesize of output 9829 [2024-11-09 07:54:28,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:28,310 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 1768 treesize of output 1616 [2024-11-09 07:54:28,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:28,343 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 1608 treesize of output 1376 [2024-11-09 07:54:28,382 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 1368 treesize of output 1244 [2024-11-09 07:54:29,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109814591] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:29,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:54:29,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 38 [2024-11-09 07:54:29,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099961457] [2024-11-09 07:54:29,359 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:54:29,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-09 07:54:29,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:29,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-09 07:54:29,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1887, Unknown=22, NotChecked=460, Total=2550 [2024-11-09 07:54:29,362 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand has 39 states, 38 states have (on average 2.289473684210526) internal successors, (87), 33 states have internal predecessors, (87), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:54:30,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:30,058 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2024-11-09 07:54:30,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 07:54:30,058 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.289473684210526) internal successors, (87), 33 states have internal predecessors, (87), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2024-11-09 07:54:30,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:30,059 INFO L225 Difference]: With dead ends: 109 [2024-11-09 07:54:30,060 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 07:54:30,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=269, Invalid=2697, Unknown=24, NotChecked=550, Total=3540 [2024-11-09 07:54:30,061 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 20 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:30,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 908 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:54:30,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 07:54:30,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-09 07:54:30,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 103 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2024-11-09 07:54:30,066 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 53 [2024-11-09 07:54:30,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:30,066 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2024-11-09 07:54:30,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.289473684210526) internal successors, (87), 33 states have internal predecessors, (87), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:54:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2024-11-09 07:54:30,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 07:54:30,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:30,067 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, 1] [2024-11-09 07:54:30,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 07:54:30,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:30,268 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:30,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:30,269 INFO L85 PathProgramCache]: Analyzing trace with hash -147699502, now seen corresponding path program 1 times [2024-11-09 07:54:30,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:30,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389300345] [2024-11-09 07:54:30,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:30,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:31,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:31,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 07:54:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:31,892 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:31,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:31,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389300345] [2024-11-09 07:54:31,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389300345] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:31,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342781473] [2024-11-09 07:54:31,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:31,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:31,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:31,895 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-09 07:54:31,896 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-09 07:54:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:32,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-09 07:54:32,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:54:32,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:54:32,349 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:54:32,350 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-09 07:54:32,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:54:32,400 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 19 treesize of output 1 [2024-11-09 07:54:32,521 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:54:32,521 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 62 treesize of output 57 [2024-11-09 07:54:32,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 07:54:32,620 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:54:32,620 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 62 treesize of output 57 [2024-11-09 07:54:32,628 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 30 treesize of output 13 [2024-11-09 07:54:32,696 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:54:32,696 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 62 treesize of output 57 [2024-11-09 07:54:32,701 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 30 treesize of output 13 [2024-11-09 07:54:32,848 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 31 treesize of output 13 [2024-11-09 07:54:32,850 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 3 [2024-11-09 07:54:32,918 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:32,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:54:33,105 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_ArrVal_2774 (Array Int Int)) (v_ArrVal_2773 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2773) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2774) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse0)))) (forall ((v_ArrVal_2773 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2773) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse0) 4))))) is different from false [2024-11-09 07:54:33,213 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (and (forall ((v_ArrVal_2773 (Array Int Int)) (v_ArrVal_2772 (Array Int Int)) (v_ArrVal_2771 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2772) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2771) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) v_ArrVal_2773) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_2774 (Array Int Int)) (v_ArrVal_2773 (Array Int Int)) (v_ArrVal_2772 (Array Int Int)) (v_ArrVal_2771 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2771))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2772) .cse2 v_ArrVal_2773) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2774) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1)))))))) is different from false [2024-11-09 07:54:33,232 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse4)) (.cse2 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_ArrVal_2774 (Array Int Int)) (v_ArrVal_2773 (Array Int Int)) (v_ArrVal_2772 (Array Int Int)) (v_ArrVal_2771 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2771))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse4))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2772) .cse1 v_ArrVal_2773) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2774) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2773 (Array Int Int)) (v_ArrVal_2772 (Array Int Int)) (v_ArrVal_2771 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2772) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2771) |c_ULTIMATE.start_create_~now~0#1.base|) .cse4) v_ArrVal_2773) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) 4)))))) is different from false [2024-11-09 07:54:33,252 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (and (forall ((v_ArrVal_2769 (Array Int Int)) (v_ArrVal_2773 (Array Int Int)) (v_ArrVal_2772 (Array Int Int)) (v_ArrVal_2771 (Array Int Int)) (v_ArrVal_2770 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2769))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2770) .cse0 v_ArrVal_2772) (select (select (store .cse1 .cse0 v_ArrVal_2771) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_2773))) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3) 4))) (forall ((v_ArrVal_2769 (Array Int Int)) (v_ArrVal_2774 (Array Int Int)) (v_ArrVal_2773 (Array Int Int)) (v_ArrVal_2772 (Array Int Int)) (v_ArrVal_2771 (Array Int Int)) (v_ArrVal_2770 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2769))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2771))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2770) .cse4 v_ArrVal_2772) .cse5 v_ArrVal_2773) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3) 12) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2774) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3)))))))))) is different from false [2024-11-09 07:54:33,268 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2769 (Array Int Int)) (v_ArrVal_2773 (Array Int Int)) (v_ArrVal_2772 (Array Int Int)) (v_ArrVal_2771 (Array Int Int)) (v_ArrVal_2770 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2769))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2770) .cse1 v_ArrVal_2772) (select (select (store .cse2 .cse1 v_ArrVal_2771) |c_ULTIMATE.start_create_~now~0#1.base|) .cse3) v_ArrVal_2773))) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4) 4))) (forall ((v_ArrVal_2769 (Array Int Int)) (v_ArrVal_2774 (Array Int Int)) (v_ArrVal_2773 (Array Int Int)) (v_ArrVal_2772 (Array Int Int)) (v_ArrVal_2771 (Array Int Int)) (v_ArrVal_2770 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2769))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_2771))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2770) .cse5 v_ArrVal_2772) .cse6 v_ArrVal_2773) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4) 12) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_2774) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4))))))))))) is different from false [2024-11-09 07:54:33,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:33,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 178 [2024-11-09 07:54:33,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:33,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 108 [2024-11-09 07:54:33,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:33,316 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 33386 treesize of output 28747 [2024-11-09 07:54:34,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:34,117 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 75591 treesize of output 73100 [2024-11-09 07:54:34,543 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 9069 treesize of output 8493 [2024-11-09 07:54:34,594 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 8493 treesize of output 8301 [2024-11-09 07:54:34,649 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 8301 treesize of output 8173 [2024-11-09 07:54:34,705 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 8173 treesize of output 7597 [2024-11-09 07:54:34,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:34,760 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 7597 treesize of output 6741 [2024-11-09 07:54:34,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:34,842 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 6733 treesize of output 5317 [2024-11-09 07:54:53,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:53,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 91 [2024-11-09 07:54:53,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:53,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 61 [2024-11-09 07:54:53,686 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:54:53,688 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 85 treesize of output 55 [2024-11-09 07:54:53,701 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:54:53,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:53,705 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 07:54:53,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342781473] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:53,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:54:53,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2024-11-09 07:54:53,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939813737] [2024-11-09 07:54:53,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:54:53,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-09 07:54:53,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:53,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-09 07:54:53,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1806, Unknown=20, NotChecked=450, Total=2450 [2024-11-09 07:54:53,861 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand has 37 states, 36 states have (on average 2.611111111111111) internal successors, (94), 32 states have internal predecessors, (94), 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-09 07:54:54,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:54,613 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2024-11-09 07:54:54,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 07:54:54,613 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.611111111111111) internal successors, (94), 32 states have internal predecessors, (94), 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 53 [2024-11-09 07:54:54,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:54,614 INFO L225 Difference]: With dead ends: 109 [2024-11-09 07:54:54,614 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 07:54:54,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=293, Invalid=2787, Unknown=20, NotChecked=560, Total=3660 [2024-11-09 07:54:54,615 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 38 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:54,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 788 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:54:54,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 07:54:54,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-09 07:54:54,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 103 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:54,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2024-11-09 07:54:54,619 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 53 [2024-11-09 07:54:54,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:54,619 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2024-11-09 07:54:54,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.611111111111111) internal successors, (94), 32 states have internal predecessors, (94), 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-09 07:54:54,619 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2024-11-09 07:54:54,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 07:54:54,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:54,620 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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-09 07:54:54,635 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-09 07:54:54,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-09 07:54:54,821 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:54,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:54,821 INFO L85 PathProgramCache]: Analyzing trace with hash 648567190, now seen corresponding path program 1 times [2024-11-09 07:54:54,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:54,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504486822] [2024-11-09 07:54:54,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:54,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:55,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:55,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 07:54:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:55,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 07:54:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:55,498 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:54:55,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:55,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504486822] [2024-11-09 07:54:55,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504486822] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:55,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793611803] [2024-11-09 07:54:55,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:55,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:55,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:55,501 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-09 07:54:55,502 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-09 07:54:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:55,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 07:54:55,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:54:55,800 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:54:55,801 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-09 07:54:55,821 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 19 treesize of output 1 [2024-11-09 07:54:55,875 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:54:55,876 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 42 treesize of output 41 [2024-11-09 07:54:55,929 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:54:55,929 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 42 treesize of output 41 [2024-11-09 07:54:55,976 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:54:55,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 07:54:55,985 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 31 treesize of output 13 [2024-11-09 07:54:55,995 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-09 07:54:56,023 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:54:56,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 07:54:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 7 not checked. [2024-11-09 07:54:56,025 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:54:56,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793611803] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:56,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:54:56,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 24 [2024-11-09 07:54:56,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392005104] [2024-11-09 07:54:56,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:54:56,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 07:54:56,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:56,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 07:54:56,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=525, Unknown=1, NotChecked=46, Total=650 [2024-11-09 07:54:56,062 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand has 25 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 21 states have internal predecessors, (79), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 07:54:56,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:56,368 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2024-11-09 07:54:56,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:54:56,368 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 21 states have internal predecessors, (79), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 54 [2024-11-09 07:54:56,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:56,369 INFO L225 Difference]: With dead ends: 105 [2024-11-09 07:54:56,369 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 07:54:56,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=858, Unknown=1, NotChecked=60, Total=1056 [2024-11-09 07:54:56,370 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 36 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:56,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 424 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 415 Invalid, 0 Unknown, 59 Unchecked, 0.2s Time] [2024-11-09 07:54:56,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 07:54:56,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-09 07:54:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 100 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:56,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2024-11-09 07:54:56,376 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 54 [2024-11-09 07:54:56,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:56,376 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2024-11-09 07:54:56,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 21 states have internal predecessors, (79), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 07:54:56,377 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2024-11-09 07:54:56,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 07:54:56,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:56,377 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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-09 07:54:56,395 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-09 07:54:56,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 07:54:56,578 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:56,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:56,579 INFO L85 PathProgramCache]: Analyzing trace with hash 648567191, now seen corresponding path program 1 times [2024-11-09 07:54:56,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:56,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306663101] [2024-11-09 07:54:56,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:56,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:57,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:57,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 07:54:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:57,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 07:54:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:57,535 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:54:57,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:57,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306663101] [2024-11-09 07:54:57,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306663101] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:57,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894218774] [2024-11-09 07:54:57,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:57,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:57,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:57,536 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-09 07:54:57,537 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-09 07:54:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:57,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-09 07:54:57,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:54:57,860 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:54:57,861 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-09 07:54:57,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:54:57,882 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 19 treesize of output 1 [2024-11-09 07:54:57,940 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:54:57,940 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 81 treesize of output 74 [2024-11-09 07:54:57,943 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 49 treesize of output 30 [2024-11-09 07:54:58,029 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:54:58,029 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 81 treesize of output 74 [2024-11-09 07:54:58,032 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 49 treesize of output 30 [2024-11-09 07:54:58,097 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:54:58,097 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 81 treesize of output 74 [2024-11-09 07:54:58,100 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 49 treesize of output 30 [2024-11-09 07:54:58,116 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 50 treesize of output 26 [2024-11-09 07:54:58,118 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 32 treesize of output 14 [2024-11-09 07:54:58,201 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-09 07:54:58,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:58,223 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-09 07:54:58,229 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:54:58,229 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-09 07:54:58,250 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-09 07:54:58,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:54:58,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894218774] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:58,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:54:58,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 32 [2024-11-09 07:54:58,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774352829] [2024-11-09 07:54:58,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:54:58,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 07:54:58,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:58,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 07:54:58,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1017, Unknown=1, NotChecked=64, Total=1190 [2024-11-09 07:54:58,358 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 33 states, 32 states have (on average 2.71875) internal successors, (87), 26 states have internal predecessors, (87), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:54:59,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:59,124 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2024-11-09 07:54:59,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 07:54:59,125 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.71875) internal successors, (87), 26 states have internal predecessors, (87), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 54 [2024-11-09 07:54:59,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:59,126 INFO L225 Difference]: With dead ends: 100 [2024-11-09 07:54:59,126 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 07:54:59,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=287, Invalid=2068, Unknown=1, NotChecked=94, Total=2450 [2024-11-09 07:54:59,127 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 90 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:59,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 751 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 709 Invalid, 0 Unknown, 72 Unchecked, 0.4s Time] [2024-11-09 07:54:59,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 07:54:59,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-09 07:54:59,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 87 states have (on average 1.2298850574712643) internal successors, (107), 95 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:59,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2024-11-09 07:54:59,135 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 54 [2024-11-09 07:54:59,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:59,135 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2024-11-09 07:54:59,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.71875) internal successors, (87), 26 states have internal predecessors, (87), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:54:59,136 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2024-11-09 07:54:59,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 07:54:59,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:59,136 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, 1] [2024-11-09 07:54:59,152 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-09 07:54:59,337 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,SelfDestructingSolverStorable26 [2024-11-09 07:54:59,337 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:54:59,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:59,338 INFO L85 PathProgramCache]: Analyzing trace with hash -283768620, now seen corresponding path program 1 times [2024-11-09 07:54:59,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:59,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046255916] [2024-11-09 07:54:59,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:59,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:59,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:59,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 07:54:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:59,622 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:54:59,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:59,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046255916] [2024-11-09 07:54:59,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046255916] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:59,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520349413] [2024-11-09 07:54:59,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:59,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:59,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:59,625 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-09 07:54:59,626 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-09 07:54:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:59,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 07:54:59,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:55:00,117 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:55:00,118 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:55:00,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:55:00,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-11-09 07:55:00,315 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 07:55:00,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520349413] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:55:00,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:55:00,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 22 [2024-11-09 07:55:00,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015855567] [2024-11-09 07:55:00,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:55:00,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 07:55:00,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:00,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 07:55:00,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:55:00,317 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 23 states, 22 states have (on average 5.136363636363637) internal successors, (113), 21 states have internal predecessors, (113), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 07:55:00,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:00,651 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2024-11-09 07:55:00,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 07:55:00,652 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.136363636363637) internal successors, (113), 21 states have internal predecessors, (113), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 54 [2024-11-09 07:55:00,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:00,652 INFO L225 Difference]: With dead ends: 105 [2024-11-09 07:55:00,653 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 07:55:00,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2024-11-09 07:55:00,654 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 49 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:00,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 511 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:55:00,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 07:55:00,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2024-11-09 07:55:00,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 87 states have (on average 1.1954022988505748) internal successors, (104), 95 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:00,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2024-11-09 07:55:00,657 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 54 [2024-11-09 07:55:00,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:00,657 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2024-11-09 07:55:00,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.136363636363637) internal successors, (113), 21 states have internal predecessors, (113), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 07:55:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2024-11-09 07:55:00,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 07:55:00,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:00,658 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:00,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 07:55:00,859 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,SelfDestructingSolverStorable27 [2024-11-09 07:55:00,859 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-09 07:55:00,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:00,860 INFO L85 PathProgramCache]: Analyzing trace with hash 275484748, now seen corresponding path program 2 times [2024-11-09 07:55:00,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:00,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658683659] [2024-11-09 07:55:00,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:00,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:03,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:03,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 07:55:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:03,286 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:55:03,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:03,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658683659] [2024-11-09 07:55:03,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658683659] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:03,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336415719] [2024-11-09 07:55:03,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:55:03,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:03,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:03,288 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-09 07:55:03,289 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-09 07:55:03,633 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:55:03,633 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:55:03,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-09 07:55:03,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:55:03,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:55:03,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:55:03,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:55:03,812 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-09 07:55:03,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:55:03,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:55:03,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:55:03,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:55:03,875 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:55:03,875 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-09 07:55:03,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2024-11-09 07:55:03,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 07:55:03,952 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 07:55:03,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 57 [2024-11-09 07:55:03,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2024-11-09 07:55:04,108 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 07:55:04,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 75 [2024-11-09 07:55:04,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2024-11-09 07:55:04,212 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 07:55:04,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 75 [2024-11-09 07:55:04,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2024-11-09 07:55:04,702 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:04,702 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:55:04,915 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base|)) (.cse4 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base|)) (.cse3 (+ 20 |c_ULTIMATE.start_create_#t~mem12#1.offset|))) (and (forall ((v_ArrVal_3888 (Array Int Int))) (or (forall ((v_ArrVal_3887 Int)) (= (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_3888))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| (store .cse2 .cse3 v_ArrVal_3887)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 4)) 0)) (not (= v_ArrVal_3888 (store .cse4 .cse3 (select v_ArrVal_3888 .cse3)))))) (forall ((v_ArrVal_3888 (Array Int Int))) (or (forall ((v_ArrVal_3887 Int)) (= (let ((.cse5 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| (store .cse2 .cse3 v_ArrVal_3887)))) (select (select .cse5 (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_3888) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1)) (+ (select (select .cse5 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 4))) 0)) (not (= v_ArrVal_3888 (store .cse4 .cse3 (select v_ArrVal_3888 .cse3)))))))) is different from false [2024-11-09 07:55:04,940 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse7))) (let ((.cse3 (select |c_#memory_$Pointer$#0.offset| .cse1)) (.cse2 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$#0.base| .cse1)) (.cse4 (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse7) 20))) (and (forall ((v_ArrVal_3888 (Array Int Int))) (or (forall ((v_ArrVal_3887 Int)) (= (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| .cse1 (store .cse3 .cse4 v_ArrVal_3887)))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_3888) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2)) (+ (select (select .cse0 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) 4))) 0)) (not (= (store .cse5 .cse4 (select v_ArrVal_3888 .cse4)) v_ArrVal_3888)))) (forall ((v_ArrVal_3888 (Array Int Int))) (or (forall ((v_ArrVal_3887 Int)) (= (select (let ((.cse6 (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_3888))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse1 (store .cse3 .cse4 v_ArrVal_3887)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) 4)) 0)) (not (= (store .cse5 .cse4 (select v_ArrVal_3888 .cse4)) v_ArrVal_3888)))))))) is different from false [2024-11-09 07:55:09,369 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse3 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse8 (select |c_#memory_$Pointer$#0.base| .cse7)) (.cse10 (select |c_#memory_$Pointer$#0.offset| .cse7)) (.cse9 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (and (forall ((v_ArrVal_3885 (Array Int Int))) (or (forall ((v_ArrVal_3884 Int) (v_ArrVal_3888 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.offset| .cse7 v_ArrVal_3885)) (.cse1 (store |c_#memory_$Pointer$#0.base| .cse7 (store .cse8 .cse9 v_ArrVal_3884)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse5 (+ (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 20))) (or (forall ((v_ArrVal_3887 Int)) (= (let ((.cse0 (store .cse4 .cse2 (store (select .cse4 .cse2) .cse5 v_ArrVal_3887)))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_3888) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3)) (+ (select (select .cse0 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3) 4))) 0)) (not (= (store (select .cse1 .cse2) .cse5 (select v_ArrVal_3888 .cse5)) v_ArrVal_3888)))))) (not (= (store .cse10 .cse9 (select v_ArrVal_3885 .cse9)) v_ArrVal_3885)))) (forall ((v_ArrVal_3885 (Array Int Int))) (or (forall ((v_ArrVal_3884 Int) (v_ArrVal_3888 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#0.offset| .cse7 v_ArrVal_3885)) (.cse12 (store |c_#memory_$Pointer$#0.base| .cse7 (store .cse8 .cse9 v_ArrVal_3884)))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse15 (+ (select (select .cse14 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 20))) (or (forall ((v_ArrVal_3887 Int)) (= (select (let ((.cse11 (store .cse12 .cse13 v_ArrVal_3888))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3))) (+ (select (select (store .cse14 .cse13 (store (select .cse14 .cse13) .cse15 v_ArrVal_3887)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3) 4)) 0)) (not (= (store (select .cse12 .cse13) .cse15 (select v_ArrVal_3888 .cse15)) v_ArrVal_3888)))))) (not (= (store .cse10 .cse9 (select v_ArrVal_3885 .cse9)) v_ArrVal_3885)))))))) is different from false [2024-11-09 07:55:09,499 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (+ |c_ULTIMATE.start_create_#t~mem9#1.offset| 12))) (let ((.cse9 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base|) .cse18 |c_ULTIMATE.start_create_~now~0#1.base|))) (.cse8 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse12 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base|) .cse18 |c_ULTIMATE.start_create_~now~0#1.offset|))) (.cse10 (select (select .cse9 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8))) (let ((.cse0 (select .cse12 .cse10)) (.cse6 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse11 (select .cse9 .cse10)) (.cse1 (select (select .cse12 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8))) (and (forall ((v_ArrVal_3885 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_3885 .cse1)) v_ArrVal_3885)) (forall ((v_ArrVal_3884 Int) (v_ArrVal_3888 (Array Int Int))) (let ((.cse7 (store .cse12 .cse10 v_ArrVal_3885)) (.cse2 (store .cse9 .cse10 (store .cse11 .cse1 v_ArrVal_3884)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8)) (.cse4 (+ (select (select .cse7 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8) 20))) (or (not (= (store (select .cse2 .cse3) .cse4 (select v_ArrVal_3888 .cse4)) v_ArrVal_3888)) (forall ((v_ArrVal_3887 Int)) (= (select (let ((.cse5 (store .cse2 .cse3 v_ArrVal_3888))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse6))) (+ (select (select (store .cse7 .cse3 (store (select .cse7 .cse3) .cse4 v_ArrVal_3887)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse6) 4)) 0)))))))) (forall ((v_ArrVal_3885 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_3885 .cse1)) v_ArrVal_3885)) (forall ((v_ArrVal_3884 Int) (v_ArrVal_3888 (Array Int Int))) (let ((.cse16 (store .cse12 .cse10 v_ArrVal_3885)) (.cse14 (store .cse9 .cse10 (store .cse11 .cse1 v_ArrVal_3884)))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8)) (.cse17 (+ (select (select .cse16 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8) 20))) (or (forall ((v_ArrVal_3887 Int)) (= (let ((.cse13 (store .cse16 .cse15 (store (select .cse16 .cse15) .cse17 v_ArrVal_3887)))) (select (select .cse13 (select (select (store .cse14 .cse15 v_ArrVal_3888) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse6)) (+ (select (select .cse13 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse6) 4))) 0)) (not (= (store (select .cse14 .cse15) .cse17 (select v_ArrVal_3888 .cse17)) v_ArrVal_3888))))))))))))) is different from false [2024-11-09 07:55:09,571 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse18 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse8)) (.cse19 (+ (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse8) 12))) (let ((.cse9 (store |c_#memory_$Pointer$#0.base| .cse18 (store (select |c_#memory_$Pointer$#0.base| .cse18) .cse19 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse12 (store |c_#memory_$Pointer$#0.offset| .cse18 (store (select |c_#memory_$Pointer$#0.offset| .cse18) .cse19 |c_ULTIMATE.start_create_~now~0#1.offset|))) (.cse10 (select (select .cse9 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8))) (let ((.cse5 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse11 (select .cse9 .cse10)) (.cse0 (select .cse12 .cse10)) (.cse1 (select (select .cse12 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8))) (and (forall ((v_ArrVal_3885 (Array Int Int))) (or (not (= v_ArrVal_3885 (store .cse0 .cse1 (select v_ArrVal_3885 .cse1)))) (forall ((v_ArrVal_3884 Int) (v_ArrVal_3888 (Array Int Int))) (let ((.cse6 (store .cse12 .cse10 v_ArrVal_3885)) (.cse3 (store .cse9 .cse10 (store .cse11 .cse1 v_ArrVal_3884)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8)) (.cse7 (+ 20 (select (select .cse6 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8)))) (or (forall ((v_ArrVal_3887 Int)) (= (let ((.cse2 (store .cse6 .cse4 (store (select .cse6 .cse4) .cse7 v_ArrVal_3887)))) (select (select .cse2 (select (select (store .cse3 .cse4 v_ArrVal_3888) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5)) (+ (select (select .cse2 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5) 4))) 0)) (not (= v_ArrVal_3888 (store (select .cse3 .cse4) .cse7 (select v_ArrVal_3888 .cse7)))))))))) (forall ((v_ArrVal_3885 (Array Int Int))) (or (forall ((v_ArrVal_3884 Int) (v_ArrVal_3888 (Array Int Int))) (let ((.cse17 (store .cse12 .cse10 v_ArrVal_3885)) (.cse13 (store .cse9 .cse10 (store .cse11 .cse1 v_ArrVal_3884)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8)) (.cse15 (+ 20 (select (select .cse17 |c_ULTIMATE.start_create_~now~0#1.base|) .cse8)))) (or (not (= v_ArrVal_3888 (store (select .cse13 .cse14) .cse15 (select v_ArrVal_3888 .cse15)))) (forall ((v_ArrVal_3887 Int)) (= (select (let ((.cse16 (store .cse13 .cse14 v_ArrVal_3888))) (select .cse16 (select (select .cse16 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5))) (+ (select (select (store .cse17 .cse14 (store (select .cse17 .cse14) .cse15 v_ArrVal_3887)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5) 4)) 0)))))) (not (= v_ArrVal_3885 (store .cse0 .cse1 (select v_ArrVal_3885 .cse1)))))))))))) is different from false [2024-11-09 07:55:09,702 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse19 (+ 12 |c_ULTIMATE.start_create_#t~ret8#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse7 (let ((.cse20 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse6 |c_ULTIMATE.start_create_#t~ret8#1.base|)))) (store .cse20 |c_ULTIMATE.start_create_#t~ret8#1.base| (store (select .cse20 |c_ULTIMATE.start_create_#t~ret8#1.base|) .cse19 |c_ULTIMATE.start_create_~now~0#1.base|))))) (let ((.cse11 (let ((.cse18 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse6 |c_ULTIMATE.start_create_#t~ret8#1.offset|)))) (store .cse18 |c_ULTIMATE.start_create_#t~ret8#1.base| (store (select .cse18 |c_ULTIMATE.start_create_#t~ret8#1.base|) .cse19 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (.cse8 (select (select .cse7 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse12 (select .cse11 .cse8)) (.cse3 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse9 (select .cse7 .cse8)) (.cse10 (select (select .cse11 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (and (forall ((v_ArrVal_3885 (Array Int Int))) (or (forall ((v_ArrVal_3884 Int) (v_ArrVal_3888 (Array Int Int))) (let ((.cse4 (store .cse11 .cse8 v_ArrVal_3885)) (.cse1 (store .cse7 .cse8 (store .cse9 .cse10 v_ArrVal_3884)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse5 (+ (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 20))) (or (forall ((v_ArrVal_3887 Int)) (= (let ((.cse0 (store .cse4 .cse2 (store (select .cse4 .cse2) .cse5 v_ArrVal_3887)))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_3888) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3)) (+ (select (select .cse0 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3) 4))) 0)) (not (= v_ArrVal_3888 (store (select .cse1 .cse2) .cse5 (select v_ArrVal_3888 .cse5)))))))) (not (= v_ArrVal_3885 (store .cse12 .cse10 (select v_ArrVal_3885 .cse10)))))) (forall ((v_ArrVal_3885 (Array Int Int))) (or (not (= v_ArrVal_3885 (store .cse12 .cse10 (select v_ArrVal_3885 .cse10)))) (forall ((v_ArrVal_3884 Int) (v_ArrVal_3888 (Array Int Int))) (let ((.cse17 (store .cse11 .cse8 v_ArrVal_3885)) (.cse13 (store .cse7 .cse8 (store .cse9 .cse10 v_ArrVal_3884)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse15 (+ (select (select .cse17 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6) 20))) (or (not (= v_ArrVal_3888 (store (select .cse13 .cse14) .cse15 (select v_ArrVal_3888 .cse15)))) (forall ((v_ArrVal_3887 Int)) (= (select (let ((.cse16 (store .cse13 .cse14 v_ArrVal_3888))) (select .cse16 (select (select .cse16 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3))) (+ (select (select (store .cse17 .cse14 (store (select .cse17 .cse14) .cse15 v_ArrVal_3887)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3) 4)) 0))))))))))))) is different from false