./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-lst-data.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-lst-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 681b2cdabf3cde7288ed8a3079e7f4da8bc32fbe83841db92939828e5c0eb464 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 18:05:13,491 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 18:05:13,555 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-14 18:05:13,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 18:05:13,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 18:05:13,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 18:05:13,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 18:05:13,583 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 18:05:13,583 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 18:05:13,583 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 18:05:13,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 18:05:13,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 18:05:13,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 18:05:13,584 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 18:05:13,585 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 18:05:13,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 18:05:13,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 18:05:13,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 18:05:13,586 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 18:05:13,586 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 18:05:13,586 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 18:05:13,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 18:05:13,587 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 18:05:13,587 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 18:05:13,587 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 18:05:13,588 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 18:05:13,588 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 18:05:13,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 18:05:13,588 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 18:05:13,588 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 18:05:13,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:05:13,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 18:05:13,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 18:05:13,589 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 18:05:13,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 18:05:13,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 18:05:13,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 18:05:13,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 18:05:13,590 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 18:05:13,590 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 -> 681b2cdabf3cde7288ed8a3079e7f4da8bc32fbe83841db92939828e5c0eb464 [2024-10-14 18:05:13,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 18:05:13,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 18:05:13,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 18:05:13,833 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 18:05:13,833 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 18:05:13,835 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-lst-data.i [2024-10-14 18:05:15,205 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 18:05:15,434 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 18:05:15,434 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-lst-data.i [2024-10-14 18:05:15,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a954e00e/ed3702ea41534d899cd24d03d068b566/FLAG103786ac4 [2024-10-14 18:05:15,471 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a954e00e/ed3702ea41534d899cd24d03d068b566 [2024-10-14 18:05:15,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 18:05:15,474 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 18:05:15,475 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 18:05:15,475 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 18:05:15,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 18:05:15,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:05:15" (1/1) ... [2024-10-14 18:05:15,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1382ab2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:15, skipping insertion in model container [2024-10-14 18:05:15,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:05:15" (1/1) ... [2024-10-14 18:05:15,528 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 18:05:15,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:05:15,815 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 18:05:15,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:05:15,886 INFO L204 MainTranslator]: Completed translation [2024-10-14 18:05:15,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:15 WrapperNode [2024-10-14 18:05:15,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 18:05:15,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 18:05:15,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 18:05:15,888 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 18:05:15,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:15" (1/1) ... [2024-10-14 18:05:15,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:15" (1/1) ... [2024-10-14 18:05:15,929 INFO L138 Inliner]: procedures = 121, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 69 [2024-10-14 18:05:15,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 18:05:15,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 18:05:15,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 18:05:15,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 18:05:15,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:15" (1/1) ... [2024-10-14 18:05:15,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:15" (1/1) ... [2024-10-14 18:05:15,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:15" (1/1) ... [2024-10-14 18:05:15,968 INFO L175 MemorySlicer]: Split 12 memory accesses to 1 slices as follows [12]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 7 writes are split as follows [7]. [2024-10-14 18:05:15,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:15" (1/1) ... [2024-10-14 18:05:15,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:15" (1/1) ... [2024-10-14 18:05:15,973 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:15" (1/1) ... [2024-10-14 18:05:15,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:15" (1/1) ... [2024-10-14 18:05:15,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:15" (1/1) ... [2024-10-14 18:05:15,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:15" (1/1) ... [2024-10-14 18:05:15,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 18:05:15,980 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 18:05:15,980 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 18:05:15,980 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 18:05:15,981 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:15" (1/1) ... [2024-10-14 18:05:15,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:05:15,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:05:16,012 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-10-14 18:05:16,014 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-10-14 18:05:16,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 18:05:16,053 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-10-14 18:05:16,053 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-10-14 18:05:16,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 18:05:16,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 18:05:16,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 18:05:16,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 18:05:16,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 18:05:16,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 18:05:16,144 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 18:05:16,146 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 18:05:16,326 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2024-10-14 18:05:16,326 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 18:05:16,380 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 18:05:16,381 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-14 18:05:16,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:05:16 BoogieIcfgContainer [2024-10-14 18:05:16,381 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 18:05:16,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 18:05:16,384 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 18:05:16,387 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 18:05:16,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:05:15" (1/3) ... [2024-10-14 18:05:16,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746fe70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:05:16, skipping insertion in model container [2024-10-14 18:05:16,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:05:15" (2/3) ... [2024-10-14 18:05:16,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746fe70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:05:16, skipping insertion in model container [2024-10-14 18:05:16,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:05:16" (3/3) ... [2024-10-14 18:05:16,389 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-lst-data.i [2024-10-14 18:05:16,404 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 18:05:16,405 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2024-10-14 18:05:16,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 18:05:16,453 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;@1932ecf9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 18:05:16,453 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-10-14 18:05:16,456 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 54 states have internal predecessors, (60), 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-10-14 18:05:16,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 18:05:16,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:16,466 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 18:05:16,466 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 25 more)] === [2024-10-14 18:05:16,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:16,471 INFO L85 PathProgramCache]: Analyzing trace with hash 4482106, now seen corresponding path program 1 times [2024-10-14 18:05:16,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:16,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015654195] [2024-10-14 18:05:16,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:16,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:16,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:16,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015654195] [2024-10-14 18:05:16,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015654195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:16,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:16,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:05:16,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266079244] [2024-10-14 18:05:16,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:16,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:05:16,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:16,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:05:16,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:05:16,734 INFO L87 Difference]: Start difference. First operand has 58 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 54 states have internal predecessors, (60), 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 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10-14 18:05:16,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:16,814 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2024-10-14 18:05:16,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:05:16,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 4 [2024-10-14 18:05:16,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:16,822 INFO L225 Difference]: With dead ends: 55 [2024-10-14 18:05:16,822 INFO L226 Difference]: Without dead ends: 54 [2024-10-14 18:05:16,824 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-10-14 18:05:16,827 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:16,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:05:16,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-14 18:05:16,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-14 18:05:16,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 50 states have internal predecessors, (53), 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-10-14 18:05:16,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2024-10-14 18:05:16,864 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 4 [2024-10-14 18:05:16,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:16,865 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2024-10-14 18:05:16,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10-14 18:05:16,866 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2024-10-14 18:05:16,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 18:05:16,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:16,867 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 18:05:16,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 18:05:16,868 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 25 more)] === [2024-10-14 18:05:16,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:16,869 INFO L85 PathProgramCache]: Analyzing trace with hash 4482107, now seen corresponding path program 1 times [2024-10-14 18:05:16,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:16,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265170337] [2024-10-14 18:05:16,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:16,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:16,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:16,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:16,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265170337] [2024-10-14 18:05:16,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265170337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:16,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:16,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:05:16,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127517009] [2024-10-14 18:05:16,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:16,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:05:16,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:16,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:05:16,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:05:16,953 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10-14 18:05:16,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:16,995 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2024-10-14 18:05:16,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:05:16,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 4 [2024-10-14 18:05:16,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:16,996 INFO L225 Difference]: With dead ends: 51 [2024-10-14 18:05:16,997 INFO L226 Difference]: Without dead ends: 51 [2024-10-14 18:05:16,997 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-10-14 18:05:16,998 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:16,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 69 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:05:16,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-14 18:05:17,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-14 18:05:17,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 47 states have internal predecessors, (50), 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-10-14 18:05:17,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2024-10-14 18:05:17,003 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 4 [2024-10-14 18:05:17,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:17,003 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2024-10-14 18:05:17,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10-14 18:05:17,003 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2024-10-14 18:05:17,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 18:05:17,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:17,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:17,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 18:05:17,005 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 25 more)] === [2024-10-14 18:05:17,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:17,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1869924759, now seen corresponding path program 1 times [2024-10-14 18:05:17,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:17,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140236079] [2024-10-14 18:05:17,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:17,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:17,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:17,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:17,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:17,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140236079] [2024-10-14 18:05:17,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140236079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:17,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:17,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:05:17,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073800159] [2024-10-14 18:05:17,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:17,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:05:17,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:17,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:05:17,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:05:17,226 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-10-14 18:05:17,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:17,391 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2024-10-14 18:05:17,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:05:17,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 9 [2024-10-14 18:05:17,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:17,394 INFO L225 Difference]: With dead ends: 51 [2024-10-14 18:05:17,394 INFO L226 Difference]: Without dead ends: 51 [2024-10-14 18:05:17,394 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-10-14 18:05:17,396 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:17,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 108 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:05:17,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-14 18:05:17,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2024-10-14 18:05:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 43 states have internal predecessors, (46), 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-10-14 18:05:17,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2024-10-14 18:05:17,405 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 9 [2024-10-14 18:05:17,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:17,406 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2024-10-14 18:05:17,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-10-14 18:05:17,406 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2024-10-14 18:05:17,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 18:05:17,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:17,406 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:17,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 18:05:17,407 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 25 more)] === [2024-10-14 18:05:17,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:17,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1869924758, now seen corresponding path program 1 times [2024-10-14 18:05:17,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:17,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654878709] [2024-10-14 18:05:17,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:17,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:17,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:17,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:17,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654878709] [2024-10-14 18:05:17,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654878709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:17,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:17,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:05:17,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028459041] [2024-10-14 18:05:17,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:17,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:05:17,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:17,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:05:17,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:05:17,739 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-10-14 18:05:17,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:17,860 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2024-10-14 18:05:17,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:05:17,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 9 [2024-10-14 18:05:17,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:17,862 INFO L225 Difference]: With dead ends: 50 [2024-10-14 18:05:17,862 INFO L226 Difference]: Without dead ends: 50 [2024-10-14 18:05:17,862 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-10-14 18:05:17,863 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:17,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 128 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:05:17,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-14 18:05:17,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2024-10-14 18:05:17,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 42 states have internal predecessors, (45), 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-10-14 18:05:17,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2024-10-14 18:05:17,871 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 9 [2024-10-14 18:05:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:17,871 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2024-10-14 18:05:17,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-10-14 18:05:17,872 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2024-10-14 18:05:17,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 18:05:17,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:17,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:17,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 18:05:17,873 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-14 18:05:17,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:17,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1709563605, now seen corresponding path program 1 times [2024-10-14 18:05:17,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:17,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628076895] [2024-10-14 18:05:17,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:17,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:17,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:18,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:18,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628076895] [2024-10-14 18:05:18,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628076895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:18,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:18,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 18:05:18,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436532345] [2024-10-14 18:05:18,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:18,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 18:05:18,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:18,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 18:05:18,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:05:18,004 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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-10-14 18:05:18,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:18,114 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2024-10-14 18:05:18,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:05:18,115 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 14 [2024-10-14 18:05:18,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:18,115 INFO L225 Difference]: With dead ends: 52 [2024-10-14 18:05:18,115 INFO L226 Difference]: Without dead ends: 52 [2024-10-14 18:05:18,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:05:18,116 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:18,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 136 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:05:18,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-14 18:05:18,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2024-10-14 18:05:18,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 47 states have internal predecessors, (53), 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-10-14 18:05:18,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2024-10-14 18:05:18,120 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 14 [2024-10-14 18:05:18,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:18,121 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2024-10-14 18:05:18,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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-10-14 18:05:18,121 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2024-10-14 18:05:18,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 18:05:18,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:18,122 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:18,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 18:05:18,122 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-14 18:05:18,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:18,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1709563604, now seen corresponding path program 1 times [2024-10-14 18:05:18,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:18,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704598992] [2024-10-14 18:05:18,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:18,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:18,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:18,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:18,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:18,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704598992] [2024-10-14 18:05:18,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704598992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:18,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:18,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 18:05:18,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611739399] [2024-10-14 18:05:18,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:18,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 18:05:18,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:18,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 18:05:18,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:05:18,408 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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-10-14 18:05:18,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:18,534 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2024-10-14 18:05:18,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:05:18,534 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 14 [2024-10-14 18:05:18,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:18,535 INFO L225 Difference]: With dead ends: 52 [2024-10-14 18:05:18,536 INFO L226 Difference]: Without dead ends: 52 [2024-10-14 18:05:18,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:05:18,537 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:18,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 141 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:05:18,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-14 18:05:18,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2024-10-14 18:05:18,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 47 states have internal predecessors, (52), 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-10-14 18:05:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2024-10-14 18:05:18,544 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2024-10-14 18:05:18,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:18,546 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-10-14 18:05:18,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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-10-14 18:05:18,546 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-10-14 18:05:18,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 18:05:18,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:18,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:18,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 18:05:18,547 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-14 18:05:18,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:18,548 INFO L85 PathProgramCache]: Analyzing trace with hash 2080190251, now seen corresponding path program 1 times [2024-10-14 18:05:18,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:18,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780389521] [2024-10-14 18:05:18,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:18,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:18,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:18,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:18,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:18,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780389521] [2024-10-14 18:05:18,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780389521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:18,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:18,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 18:05:18,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228289921] [2024-10-14 18:05:18,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:18,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 18:05:18,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:18,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 18:05:18,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:05:18,677 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-10-14 18:05:18,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:18,772 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2024-10-14 18:05:18,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:05:18,772 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 16 [2024-10-14 18:05:18,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:18,773 INFO L225 Difference]: With dead ends: 53 [2024-10-14 18:05:18,773 INFO L226 Difference]: Without dead ends: 53 [2024-10-14 18:05:18,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:05:18,774 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 193 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-10-14 18:05:18,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 193 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:05:18,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-14 18:05:18,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2024-10-14 18:05:18,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.625) internal successors, (52), 48 states have internal predecessors, (52), 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-10-14 18:05:18,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2024-10-14 18:05:18,777 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2024-10-14 18:05:18,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:18,778 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2024-10-14 18:05:18,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-10-14 18:05:18,778 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2024-10-14 18:05:18,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 18:05:18,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:18,779 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:18,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 18:05:18,779 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-14 18:05:18,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:18,779 INFO L85 PathProgramCache]: Analyzing trace with hash 2081893250, now seen corresponding path program 1 times [2024-10-14 18:05:18,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:18,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660271725] [2024-10-14 18:05:18,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:18,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:19,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:19,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:19,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:19,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660271725] [2024-10-14 18:05:19,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660271725] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:05:19,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129340534] [2024-10-14 18:05:19,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:19,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:05:19,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:05:19,346 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-10-14 18:05:19,347 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-10-14 18:05:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:19,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-14 18:05:19,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:19,490 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-10-14 18:05:19,495 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-10-14 18:05:19,514 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-10-14 18:05:19,523 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-10-14 18:05:19,564 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-10-14 18:05:19,569 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-10-14 18:05:19,698 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-10-14 18:05:19,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 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-14 18:05:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:19,797 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:05:20,446 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-10-14 18:05:20,457 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-10-14 18:05:20,474 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-10-14 18:05:20,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:05:20,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:20,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129340534] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:05:20,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:05:20,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 24 [2024-10-14 18:05:20,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226482751] [2024-10-14 18:05:20,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:05:20,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 18:05:20,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:20,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 18:05:20,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2024-10-14 18:05:20,555 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 24 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 20 states have internal predecessors, (35), 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-10-14 18:05:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:20,856 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2024-10-14 18:05:20,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 18:05:20,856 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 20 states have internal predecessors, (35), 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 16 [2024-10-14 18:05:20,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:20,857 INFO L225 Difference]: With dead ends: 54 [2024-10-14 18:05:20,857 INFO L226 Difference]: Without dead ends: 54 [2024-10-14 18:05:20,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2024-10-14 18:05:20,858 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 12 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:20,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 433 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:05:20,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-14 18:05:20,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2024-10-14 18:05:20,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.606060606060606) internal successors, (53), 49 states have internal predecessors, (53), 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-10-14 18:05:20,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2024-10-14 18:05:20,862 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 16 [2024-10-14 18:05:20,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:20,862 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2024-10-14 18:05:20,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 20 states have internal predecessors, (35), 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-10-14 18:05:20,862 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2024-10-14 18:05:20,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 18:05:20,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:20,863 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:20,883 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-10-14 18:05:21,067 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-10-14 18:05:21,068 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-14 18:05:21,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:21,069 INFO L85 PathProgramCache]: Analyzing trace with hash -154021097, now seen corresponding path program 1 times [2024-10-14 18:05:21,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:21,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803810412] [2024-10-14 18:05:21,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:21,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:21,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:21,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:05:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:21,315 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:05:21,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:21,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803810412] [2024-10-14 18:05:21,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803810412] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:05:21,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243472599] [2024-10-14 18:05:21,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:21,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:05:21,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:05:21,318 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-10-14 18:05:21,320 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-10-14 18:05:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:21,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 18:05:21,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:21,437 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-10-14 18:05:21,475 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-14 18:05:21,475 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-10-14 18:05:21,481 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:21,482 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:21,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243472599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:21,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:05:21,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-10-14 18:05:21,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233802643] [2024-10-14 18:05:21,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:21,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:05:21,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:21,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:05:21,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-10-14 18:05:21,483 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-10-14 18:05:21,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:21,528 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2024-10-14 18:05:21,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:05:21,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 18 [2024-10-14 18:05:21,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:21,529 INFO L225 Difference]: With dead ends: 55 [2024-10-14 18:05:21,529 INFO L226 Difference]: Without dead ends: 55 [2024-10-14 18:05:21,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 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-10-14 18:05:21,530 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:21,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 59 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 68 Unchecked, 0.0s Time] [2024-10-14 18:05:21,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-14 18:05:21,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-14 18:05:21,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 50 states have internal predecessors, (55), 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-10-14 18:05:21,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2024-10-14 18:05:21,536 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 18 [2024-10-14 18:05:21,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:21,536 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2024-10-14 18:05:21,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-10-14 18:05:21,537 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2024-10-14 18:05:21,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 18:05:21,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:21,537 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:21,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 18:05:21,741 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-10-14 18:05:21,742 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-14 18:05:21,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:21,742 INFO L85 PathProgramCache]: Analyzing trace with hash -154021096, now seen corresponding path program 1 times [2024-10-14 18:05:21,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:21,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523217510] [2024-10-14 18:05:21,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:21,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:21,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:21,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:05:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:22,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:05:22,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:22,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523217510] [2024-10-14 18:05:22,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523217510] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:05:22,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998459403] [2024-10-14 18:05:22,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:22,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:05:22,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:05:22,028 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-10-14 18:05:22,030 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-10-14 18:05:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:22,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 18:05:22,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:22,126 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-10-14 18:05:22,268 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-10-14 18:05:22,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:05:22,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:05:22,297 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:05:22,298 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-10-14 18:05:22,299 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-14 18:05:22,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:05:22,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998459403] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:05:22,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:05:22,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2024-10-14 18:05:22,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795447096] [2024-10-14 18:05:22,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:05:22,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 18:05:22,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:22,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 18:05:22,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=229, Unknown=1, NotChecked=30, Total=306 [2024-10-14 18:05:22,379 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 16 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 18:05:22,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:22,620 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2024-10-14 18:05:22,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:05:22,621 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 18 [2024-10-14 18:05:22,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:22,621 INFO L225 Difference]: With dead ends: 64 [2024-10-14 18:05:22,621 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 18:05:22,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=288, Unknown=1, NotChecked=34, Total=380 [2024-10-14 18:05:22,622 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:22,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 229 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 336 Invalid, 0 Unknown, 61 Unchecked, 0.2s Time] [2024-10-14 18:05:22,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 18:05:22,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2024-10-14 18:05:22,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 55 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:05:22,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2024-10-14 18:05:22,627 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 18 [2024-10-14 18:05:22,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:22,627 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2024-10-14 18:05:22,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 18:05:22,627 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2024-10-14 18:05:22,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 18:05:22,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:22,628 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:22,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 18:05:22,828 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-10-14 18:05:22,829 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-14 18:05:22,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:22,830 INFO L85 PathProgramCache]: Analyzing trace with hash -757006398, now seen corresponding path program 1 times [2024-10-14 18:05:22,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:22,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859560277] [2024-10-14 18:05:22,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:22,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:22,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:22,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:22,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859560277] [2024-10-14 18:05:22,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859560277] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:05:22,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223935788] [2024-10-14 18:05:22,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:22,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:05:22,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:05:22,898 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-10-14 18:05:22,899 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-10-14 18:05:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:22,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-14 18:05:22,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:22,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:22,988 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:05:22,997 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-14 18:05:22,997 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 12 treesize of output 11 [2024-10-14 18:05:23,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:23,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223935788] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:05:23,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:05:23,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2024-10-14 18:05:23,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108316029] [2024-10-14 18:05:23,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:05:23,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:05:23,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:23,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:05:23,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:05:23,008 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-10-14 18:05:23,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:23,106 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2024-10-14 18:05:23,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:05:23,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 18 [2024-10-14 18:05:23,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:23,107 INFO L225 Difference]: With dead ends: 64 [2024-10-14 18:05:23,107 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 18:05:23,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:05:23,108 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:23,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 95 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:05:23,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 18:05:23,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2024-10-14 18:05:23,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 56 states have internal predecessors, (66), 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-10-14 18:05:23,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2024-10-14 18:05:23,111 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 18 [2024-10-14 18:05:23,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:23,112 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2024-10-14 18:05:23,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-10-14 18:05:23,112 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2024-10-14 18:05:23,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 18:05:23,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:23,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:23,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 18:05:23,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:05:23,317 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-14 18:05:23,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:23,317 INFO L85 PathProgramCache]: Analyzing trace with hash -757006397, now seen corresponding path program 1 times [2024-10-14 18:05:23,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:23,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029994200] [2024-10-14 18:05:23,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:23,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:23,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:23,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:05:23,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:23,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029994200] [2024-10-14 18:05:23,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029994200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:23,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:23,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 18:05:23,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030434136] [2024-10-14 18:05:23,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:23,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 18:05:23,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:23,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 18:05:23,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:05:23,488 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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-10-14 18:05:23,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:23,624 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2024-10-14 18:05:23,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 18:05:23,625 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 18 [2024-10-14 18:05:23,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:23,625 INFO L225 Difference]: With dead ends: 65 [2024-10-14 18:05:23,625 INFO L226 Difference]: Without dead ends: 65 [2024-10-14 18:05:23,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:05:23,626 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:23,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 126 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:05:23,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-14 18:05:23,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-14 18:05:23,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 60 states have internal predecessors, (71), 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-10-14 18:05:23,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2024-10-14 18:05:23,633 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 18 [2024-10-14 18:05:23,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:23,633 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2024-10-14 18:05:23,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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-10-14 18:05:23,634 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2024-10-14 18:05:23,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 18:05:23,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:23,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:23,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 18:05:23,638 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-14 18:05:23,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:23,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1992363304, now seen corresponding path program 1 times [2024-10-14 18:05:23,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:23,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776841856] [2024-10-14 18:05:23,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:23,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:23,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:05:23,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:23,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776841856] [2024-10-14 18:05:23,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776841856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:23,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:23,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 18:05:23,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594105941] [2024-10-14 18:05:23,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:23,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 18:05:23,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:23,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 18:05:23,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:05:23,773 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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-10-14 18:05:23,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:23,864 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2024-10-14 18:05:23,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 18:05:23,864 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 19 [2024-10-14 18:05:23,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:23,865 INFO L225 Difference]: With dead ends: 69 [2024-10-14 18:05:23,865 INFO L226 Difference]: Without dead ends: 69 [2024-10-14 18:05:23,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:05:23,865 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 23 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:23,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 184 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:05:23,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-14 18:05:23,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2024-10-14 18:05:23,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.5333333333333334) internal successors, (69), 60 states have internal predecessors, (69), 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-10-14 18:05:23,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2024-10-14 18:05:23,868 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 19 [2024-10-14 18:05:23,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:23,868 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2024-10-14 18:05:23,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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-10-14 18:05:23,869 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2024-10-14 18:05:23,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 18:05:23,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:23,869 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:23,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 18:05:23,869 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-14 18:05:23,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:23,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1985306195, now seen corresponding path program 1 times [2024-10-14 18:05:23,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:23,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115060900] [2024-10-14 18:05:23,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:23,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:23,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:23,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:05:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 18:05:23,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:23,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115060900] [2024-10-14 18:05:23,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115060900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:23,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:23,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 18:05:23,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272367950] [2024-10-14 18:05:23,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:23,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 18:05:23,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:23,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 18:05:23,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:05:24,000 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-10-14 18:05:24,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:24,097 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2024-10-14 18:05:24,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:05:24,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 20 [2024-10-14 18:05:24,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:24,098 INFO L225 Difference]: With dead ends: 64 [2024-10-14 18:05:24,098 INFO L226 Difference]: Without dead ends: 64 [2024-10-14 18:05:24,099 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-10-14 18:05:24,099 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:24,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 134 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:05:24,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-14 18:05:24,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-14 18:05:24,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.488888888888889) internal successors, (67), 59 states have internal predecessors, (67), 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-10-14 18:05:24,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2024-10-14 18:05:24,105 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 20 [2024-10-14 18:05:24,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:24,105 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2024-10-14 18:05:24,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-10-14 18:05:24,106 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2024-10-14 18:05:24,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 18:05:24,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:24,106 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:24,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 18:05:24,106 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-14 18:05:24,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:24,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1985306194, now seen corresponding path program 1 times [2024-10-14 18:05:24,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:24,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231819204] [2024-10-14 18:05:24,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:24,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:24,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:24,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:05:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:05:24,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:24,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231819204] [2024-10-14 18:05:24,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231819204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:24,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:24,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 18:05:24,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270524140] [2024-10-14 18:05:24,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:24,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 18:05:24,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:24,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 18:05:24,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:05:24,322 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:05:24,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:24,422 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2024-10-14 18:05:24,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:05:24,423 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-10-14 18:05:24,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:24,423 INFO L225 Difference]: With dead ends: 63 [2024-10-14 18:05:24,423 INFO L226 Difference]: Without dead ends: 63 [2024-10-14 18:05:24,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-10-14 18:05:24,424 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:24,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 143 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:05:24,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-14 18:05:24,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-14 18:05:24,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 58 states have internal predecessors, (65), 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-10-14 18:05:24,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2024-10-14 18:05:24,427 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 20 [2024-10-14 18:05:24,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:24,427 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2024-10-14 18:05:24,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:05:24,427 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2024-10-14 18:05:24,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 18:05:24,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:24,427 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] [2024-10-14 18:05:24,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 18:05:24,428 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-14 18:05:24,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:24,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1633644576, now seen corresponding path program 1 times [2024-10-14 18:05:24,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:24,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613273605] [2024-10-14 18:05:24,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:24,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:24,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:24,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:05:24,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:24,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613273605] [2024-10-14 18:05:24,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613273605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:24,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:24,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 18:05:24,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029533151] [2024-10-14 18:05:24,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:24,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 18:05:24,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:24,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 18:05:24,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:05:24,554 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-10-14 18:05:24,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:24,662 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2024-10-14 18:05:24,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 18:05:24,663 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 20 [2024-10-14 18:05:24,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:24,663 INFO L225 Difference]: With dead ends: 66 [2024-10-14 18:05:24,664 INFO L226 Difference]: Without dead ends: 66 [2024-10-14 18:05:24,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 18:05:24,664 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:24,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 156 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:05:24,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-14 18:05:24,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-10-14 18:05:24,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.446808510638298) internal successors, (68), 60 states have internal predecessors, (68), 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-10-14 18:05:24,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2024-10-14 18:05:24,670 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 20 [2024-10-14 18:05:24,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:24,670 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2024-10-14 18:05:24,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-10-14 18:05:24,670 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2024-10-14 18:05:24,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 18:05:24,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:24,671 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:24,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 18:05:24,671 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-14 18:05:24,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:24,671 INFO L85 PathProgramCache]: Analyzing trace with hash -913695245, now seen corresponding path program 1 times [2024-10-14 18:05:24,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:24,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179212706] [2024-10-14 18:05:24,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:24,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:24,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:24,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:05:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:05:24,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:24,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179212706] [2024-10-14 18:05:24,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179212706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:24,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:05:24,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 18:05:24,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35291314] [2024-10-14 18:05:24,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:24,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 18:05:24,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:24,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 18:05:24,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-10-14 18:05:24,993 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 15 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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-10-14 18:05:25,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:25,194 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2024-10-14 18:05:25,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 18:05:25,194 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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 22 [2024-10-14 18:05:25,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:25,195 INFO L225 Difference]: With dead ends: 66 [2024-10-14 18:05:25,195 INFO L226 Difference]: Without dead ends: 66 [2024-10-14 18:05:25,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-10-14 18:05:25,196 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:25,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 212 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:05:25,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-14 18:05:25,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-10-14 18:05:25,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.425531914893617) internal successors, (67), 60 states have internal predecessors, (67), 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-10-14 18:05:25,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2024-10-14 18:05:25,198 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 22 [2024-10-14 18:05:25,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:25,199 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2024-10-14 18:05:25,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 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-10-14 18:05:25,199 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2024-10-14 18:05:25,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 18:05:25,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:25,199 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:25,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 18:05:25,200 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-14 18:05:25,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:25,200 INFO L85 PathProgramCache]: Analyzing trace with hash -913695244, now seen corresponding path program 1 times [2024-10-14 18:05:25,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:25,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022330829] [2024-10-14 18:05:25,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:25,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:25,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:25,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:05:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:25,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:05:25,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:25,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022330829] [2024-10-14 18:05:25,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022330829] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:05:25,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385425407] [2024-10-14 18:05:25,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:25,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:05:25,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:05:25,614 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-10-14 18:05:25,615 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-10-14 18:05:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:25,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-14 18:05:25,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:25,781 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:05:25,782 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-10-14 18:05:25,803 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-10-14 18:05:25,808 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-10-14 18:05:25,874 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 18:05:25,874 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 70 treesize of output 65 [2024-10-14 18:05:25,878 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-10-14 18:05:25,911 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 39 treesize of output 21 [2024-10-14 18:05:25,917 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-10-14 18:05:25,938 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:25,939 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:05:25,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385425407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:05:25,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:05:25,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 21 [2024-10-14 18:05:25,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711794848] [2024-10-14 18:05:25,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:05:25,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 18:05:25,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:25,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 18:05:25,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2024-10-14 18:05:25,940 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 11 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 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-10-14 18:05:26,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:26,178 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2024-10-14 18:05:26,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 18:05:26,179 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 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 22 [2024-10-14 18:05:26,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:26,179 INFO L225 Difference]: With dead ends: 65 [2024-10-14 18:05:26,179 INFO L226 Difference]: Without dead ends: 65 [2024-10-14 18:05:26,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2024-10-14 18:05:26,180 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:26,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 211 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:05:26,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-14 18:05:26,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-14 18:05:26,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 60 states have internal predecessors, (66), 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-10-14 18:05:26,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2024-10-14 18:05:26,182 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 22 [2024-10-14 18:05:26,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:26,183 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2024-10-14 18:05:26,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 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-10-14 18:05:26,183 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2024-10-14 18:05:26,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 18:05:26,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:26,183 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] [2024-10-14 18:05:26,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 18:05:26,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-14 18:05:26,388 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-14 18:05:26,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:26,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1631005853, now seen corresponding path program 1 times [2024-10-14 18:05:26,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:26,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773277239] [2024-10-14 18:05:26,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:26,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:26,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:26,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:26,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773277239] [2024-10-14 18:05:26,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773277239] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:05:26,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25224452] [2024-10-14 18:05:26,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:26,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:05:26,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:05:26,664 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-10-14 18:05:26,665 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-10-14 18:05:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:26,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-14 18:05:26,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:26,775 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-10-14 18:05:26,779 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-10-14 18:05:26,800 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-10-14 18:05:26,804 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-10-14 18:05:26,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:05:26,838 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-10-14 18:05:26,844 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-10-14 18:05:26,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:05:26,928 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-10-14 18:05:26,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:05:26,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:05:26,934 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-10-14 18:05:27,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:05:27,035 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-10-14 18:05:27,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:05:27,048 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-10-14 18:05:27,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:05:27,107 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:05:27,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-10-14 18:05:27,790 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 6618 treesize of output 6554 [2024-10-14 18:05:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:05:27,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25224452] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:05:27,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:05:27,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 32 [2024-10-14 18:05:27,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163386131] [2024-10-14 18:05:27,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:05:27,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-14 18:05:27,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:27,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-14 18:05:27,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=882, Unknown=24, NotChecked=0, Total=992 [2024-10-14 18:05:27,849 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 32 states, 29 states have (on average 1.793103448275862) internal successors, (52), 28 states have internal predecessors, (52), 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-10-14 18:05:28,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:28,476 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2024-10-14 18:05:28,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 18:05:28,477 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 1.793103448275862) internal successors, (52), 28 states have internal predecessors, (52), 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 23 [2024-10-14 18:05:28,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:28,477 INFO L225 Difference]: With dead ends: 77 [2024-10-14 18:05:28,478 INFO L226 Difference]: Without dead ends: 77 [2024-10-14 18:05:28,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=163, Invalid=1608, Unknown=35, NotChecked=0, Total=1806 [2024-10-14 18:05:28,478 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:28,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 361 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 18:05:28,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-14 18:05:28,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2024-10-14 18:05:28,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 68 states have internal predecessors, (78), 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-10-14 18:05:28,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2024-10-14 18:05:28,483 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 23 [2024-10-14 18:05:28,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:28,483 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2024-10-14 18:05:28,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 1.793103448275862) internal successors, (52), 28 states have internal predecessors, (52), 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-10-14 18:05:28,484 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2024-10-14 18:05:28,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 18:05:28,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:28,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] [2024-10-14 18:05:28,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 18:05:28,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:05:28,689 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-14 18:05:28,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:28,690 INFO L85 PathProgramCache]: Analyzing trace with hash 978424663, now seen corresponding path program 1 times [2024-10-14 18:05:28,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:28,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938777926] [2024-10-14 18:05:28,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:28,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:28,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:28,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:05:28,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:28,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938777926] [2024-10-14 18:05:28,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938777926] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:05:28,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750134787] [2024-10-14 18:05:28,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:28,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:05:28,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:05:28,842 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-10-14 18:05:28,843 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-10-14 18:05:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:28,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-14 18:05:28,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:28,997 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-10-14 18:05:29,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:05:29,021 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:05:29,061 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_#t~ret4#1.base_26| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_26|) 0)) (= (store |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_26| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2024-10-14 18:05:29,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750134787] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:05:29,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:05:29,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2024-10-14 18:05:29,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850454900] [2024-10-14 18:05:29,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:05:29,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 18:05:29,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:29,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 18:05:29,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=110, Unknown=1, NotChecked=20, Total=156 [2024-10-14 18:05:29,063 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 12 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 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-10-14 18:05:29,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:29,208 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2024-10-14 18:05:29,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 18:05:29,208 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 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 24 [2024-10-14 18:05:29,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:29,208 INFO L225 Difference]: With dead ends: 79 [2024-10-14 18:05:29,209 INFO L226 Difference]: Without dead ends: 66 [2024-10-14 18:05:29,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=110, Unknown=1, NotChecked=20, Total=156 [2024-10-14 18:05:29,209 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:29,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 157 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:05:29,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-14 18:05:29,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-14 18:05:29,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 61 states have internal predecessors, (70), 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-10-14 18:05:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2024-10-14 18:05:29,212 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 24 [2024-10-14 18:05:29,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:29,213 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2024-10-14 18:05:29,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 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-10-14 18:05:29,213 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2024-10-14 18:05:29,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 18:05:29,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:29,215 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:29,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-14 18:05:29,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:05:29,416 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-14 18:05:29,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:29,416 INFO L85 PathProgramCache]: Analyzing trace with hash 804858780, now seen corresponding path program 1 times [2024-10-14 18:05:29,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:29,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822867635] [2024-10-14 18:05:29,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:29,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:29,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:29,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:05:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 18:05:29,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:29,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822867635] [2024-10-14 18:05:29,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822867635] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:05:29,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098917066] [2024-10-14 18:05:29,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:29,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:05:29,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:05:29,543 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-10-14 18:05:29,544 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-10-14 18:05:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:29,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 18:05:29,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:29,691 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 18:05:29,691 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:05:29,708 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-14 18:05:29,708 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 12 treesize of output 11 [2024-10-14 18:05:29,721 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 18:05:29,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098917066] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:05:29,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:05:29,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2024-10-14 18:05:29,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074511776] [2024-10-14 18:05:29,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:05:29,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:05:29,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:29,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:05:29,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:05:29,722 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:05:29,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:29,793 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2024-10-14 18:05:29,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:05:29,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-10-14 18:05:29,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:29,794 INFO L225 Difference]: With dead ends: 72 [2024-10-14 18:05:29,795 INFO L226 Difference]: Without dead ends: 72 [2024-10-14 18:05:29,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:05:29,795 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:29,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 110 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:05:29,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-14 18:05:29,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2024-10-14 18:05:29,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 66 states have internal predecessors, (77), 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-10-14 18:05:29,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2024-10-14 18:05:29,798 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 28 [2024-10-14 18:05:29,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:29,799 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2024-10-14 18:05:29,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:05:29,799 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2024-10-14 18:05:29,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 18:05:29,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:29,799 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:29,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-14 18:05:30,000 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,SelfDestructingSolverStorable20 [2024-10-14 18:05:30,001 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-14 18:05:30,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:30,002 INFO L85 PathProgramCache]: Analyzing trace with hash 804858781, now seen corresponding path program 1 times [2024-10-14 18:05:30,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:30,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819107895] [2024-10-14 18:05:30,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:30,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:30,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:30,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:05:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:30,198 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:05:30,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:30,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819107895] [2024-10-14 18:05:30,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819107895] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:05:30,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672505024] [2024-10-14 18:05:30,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:30,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:05:30,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:05:30,201 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-10-14 18:05:30,202 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-10-14 18:05:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:30,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 18:05:30,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:30,417 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 18:05:30,417 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:05:30,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:05:30,472 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-10-14 18:05:30,533 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 18:05:30,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672505024] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:05:30,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:05:30,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 17 [2024-10-14 18:05:30,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915411697] [2024-10-14 18:05:30,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:05:30,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 18:05:30,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:30,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 18:05:30,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-10-14 18:05:30,535 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 18 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 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-10-14 18:05:30,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:30,647 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2024-10-14 18:05:30,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 18:05:30,648 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 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 28 [2024-10-14 18:05:30,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:30,648 INFO L225 Difference]: With dead ends: 72 [2024-10-14 18:05:30,648 INFO L226 Difference]: Without dead ends: 72 [2024-10-14 18:05:30,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-10-14 18:05:30,649 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:30,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 284 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:05:30,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-14 18:05:30,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2024-10-14 18:05:30,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 66 states have internal predecessors, (76), 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-10-14 18:05:30,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2024-10-14 18:05:30,651 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 28 [2024-10-14 18:05:30,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:30,651 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2024-10-14 18:05:30,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 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-10-14 18:05:30,651 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2024-10-14 18:05:30,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 18:05:30,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:30,652 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:30,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 18:05:30,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:05:30,856 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-14 18:05:30,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:30,856 INFO L85 PathProgramCache]: Analyzing trace with hash 375217587, now seen corresponding path program 1 times [2024-10-14 18:05:30,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:30,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685868175] [2024-10-14 18:05:30,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:30,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:31,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:31,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:05:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:05:31,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:31,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685868175] [2024-10-14 18:05:31,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685868175] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:05:31,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752365839] [2024-10-14 18:05:31,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:31,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:05:31,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:05:31,471 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-10-14 18:05:31,473 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-10-14 18:05:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:31,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-14 18:05:31,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:31,741 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:05:31,741 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-10-14 18:05:31,775 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-10-14 18:05:31,844 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:05:31,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-10-14 18:05:31,885 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:05:31,885 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-10-14 18:05:31,959 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-10-14 18:05:31,962 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:31,962 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:05:32,013 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-10-14 18:05:32,014 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 20 [2024-10-14 18:05:32,079 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1921 (Array Int Int)) (v_ArrVal_1920 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem8#1.base| v_ArrVal_1920))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)))) (= (select (select (store .cse0 .cse1 v_ArrVal_1921) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) .cse1)))) is different from false [2024-10-14 18:05:32,085 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1921 (Array Int Int)) (v_ArrVal_1920 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_1920))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_1921) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) .cse1))))) is different from false [2024-10-14 18:05:32,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:05:32,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 44 [2024-10-14 18:05:32,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:05:32,099 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 420 treesize of output 317 [2024-10-14 18:05:32,111 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 108 treesize of output 96 [2024-10-14 18:05:32,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:05:32,121 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 74 treesize of output 55 [2024-10-14 18:05:32,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752365839] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:05:32,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:05:32,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 30 [2024-10-14 18:05:32,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756537717] [2024-10-14 18:05:32,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:05:32,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-14 18:05:32,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:32,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-14 18:05:32,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1205, Unknown=10, NotChecked=142, Total=1482 [2024-10-14 18:05:32,244 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 31 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 25 states have internal predecessors, (47), 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-10-14 18:05:32,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:32,586 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2024-10-14 18:05:32,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 18:05:32,587 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 25 states have internal predecessors, (47), 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 30 [2024-10-14 18:05:32,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:32,588 INFO L225 Difference]: With dead ends: 74 [2024-10-14 18:05:32,588 INFO L226 Difference]: Without dead ends: 74 [2024-10-14 18:05:32,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=181, Invalid=1539, Unknown=10, NotChecked=162, Total=1892 [2024-10-14 18:05:32,589 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:32,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 456 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:05:32,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-14 18:05:32,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-10-14 18:05:32,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 68 states have internal predecessors, (80), 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-10-14 18:05:32,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2024-10-14 18:05:32,594 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 30 [2024-10-14 18:05:32,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:32,594 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2024-10-14 18:05:32,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 25 states have internal predecessors, (47), 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-10-14 18:05:32,594 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2024-10-14 18:05:32,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 18:05:32,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:32,594 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:32,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-14 18:05:32,795 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,SelfDestructingSolverStorable22 [2024-10-14 18:05:32,795 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-14 18:05:32,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:32,796 INFO L85 PathProgramCache]: Analyzing trace with hash 375217588, now seen corresponding path program 1 times [2024-10-14 18:05:32,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:32,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321253871] [2024-10-14 18:05:32,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:32,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:33,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:33,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:05:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:33,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:05:33,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:33,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321253871] [2024-10-14 18:05:33,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321253871] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:05:33,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766624612] [2024-10-14 18:05:33,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:33,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:05:33,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:05:33,557 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-10-14 18:05:33,558 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-10-14 18:05:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:33,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-10-14 18:05:33,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:33,782 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-10-14 18:05:33,868 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:05:33,869 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-10-14 18:05:33,900 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-10-14 18:05:33,908 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-10-14 18:05:33,979 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 18:05:33,979 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-10-14 18:05:33,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-14 18:05:34,021 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 18:05:34,022 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-10-14 18:05:34,026 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-10-14 18:05:34,096 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-10-14 18:05:34,099 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 9 treesize of output 3 [2024-10-14 18:05:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:34,119 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:05:34,210 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_ArrVal_2098 (Array Int Int)) (v_ArrVal_2097 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2097) |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~mem9#1.base| v_ArrVal_2098) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse0)))) (forall ((v_ArrVal_2097 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2097) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse0) 4))))) is different from false [2024-10-14 18:05:34,282 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_2097 (Array Int Int)) (v_ArrVal_2096 (Array Int Int)) (v_ArrVal_2095 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem8#1.base| v_ArrVal_2096) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem8#1.base| v_ArrVal_2095) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) v_ArrVal_2097) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_2098 (Array Int Int)) (v_ArrVal_2097 (Array Int Int)) (v_ArrVal_2096 (Array Int Int)) (v_ArrVal_2095 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem8#1.base| v_ArrVal_2095))) (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~mem8#1.base| v_ArrVal_2096) .cse2 v_ArrVal_2097) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2098) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1)))))))) is different from false [2024-10-14 18:05:34,293 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_2098 (Array Int Int)) (v_ArrVal_2097 (Array Int Int)) (v_ArrVal_2096 (Array Int Int)) (v_ArrVal_2095 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2095))) (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_2096) .cse1 v_ArrVal_2097) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2098) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2097 (Array Int Int)) (v_ArrVal_2096 (Array Int Int)) (v_ArrVal_2095 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2096) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2095) |c_ULTIMATE.start_create_~now~0#1.base|) .cse4) v_ArrVal_2097) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) 4)))))) is different from false [2024-10-14 18:05:34,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:05:34,302 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 89 treesize of output 90 [2024-10-14 18:05:34,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:05:34,307 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 79 treesize of output 60 [2024-10-14 18:05:34,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:05:34,319 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 754 treesize of output 651 [2024-10-14 18:05:34,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:05:34,344 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 1369 treesize of output 1278 [2024-10-14 18:05:34,363 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 655 treesize of output 607 [2024-10-14 18:05:34,370 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 607 treesize of output 559 [2024-10-14 18:05:34,378 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 559 treesize of output 543 [2024-10-14 18:05:34,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:05:34,390 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 543 treesize of output 447 [2024-10-14 18:05:34,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:05:34,558 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 46 treesize of output 47 [2024-10-14 18:05:34,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:05:34,566 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 36 treesize of output 37 [2024-10-14 18:05:34,568 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:05:34,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2024-10-14 18:05:34,573 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:05:34,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:05:34,575 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-10-14 18:05:34,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766624612] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:05:34,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:05:34,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 29 [2024-10-14 18:05:34,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421569752] [2024-10-14 18:05:34,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:05:34,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-14 18:05:34,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:34,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-14 18:05:34,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1120, Unknown=19, NotChecked=210, Total=1482 [2024-10-14 18:05:34,673 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand has 30 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 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-10-14 18:05:35,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:35,063 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2024-10-14 18:05:35,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 18:05:35,064 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 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 30 [2024-10-14 18:05:35,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:35,064 INFO L225 Difference]: With dead ends: 74 [2024-10-14 18:05:35,064 INFO L226 Difference]: Without dead ends: 74 [2024-10-14 18:05:35,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=204, Invalid=1593, Unknown=21, NotChecked=252, Total=2070 [2024-10-14 18:05:35,065 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:35,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 380 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:05:35,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-14 18:05:35,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-10-14 18:05:35,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 68 states have internal predecessors, (79), 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-10-14 18:05:35,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2024-10-14 18:05:35,067 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 30 [2024-10-14 18:05:35,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:35,067 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2024-10-14 18:05:35,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 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-10-14 18:05:35,068 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2024-10-14 18:05:35,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 18:05:35,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:35,068 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:35,082 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-10-14 18:05:35,272 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,SelfDestructingSolverStorable23 [2024-10-14 18:05:35,273 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-14 18:05:35,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:35,273 INFO L85 PathProgramCache]: Analyzing trace with hash 408173832, now seen corresponding path program 1 times [2024-10-14 18:05:35,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:35,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143798369] [2024-10-14 18:05:35,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:35,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:35,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:35,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:05:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:35,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 18:05:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:35,721 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:05:35,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:35,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143798369] [2024-10-14 18:05:35,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143798369] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:05:35,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145223411] [2024-10-14 18:05:35,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:35,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:05:35,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:05:35,723 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-10-14 18:05:35,724 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-10-14 18:05:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:35,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-14 18:05:35,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:35,898 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:05:35,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:05:35,913 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-10-14 18:05:35,945 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 18:05:35,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-10-14 18:05:35,974 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 18:05:35,974 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-10-14 18:05:35,979 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-10-14 18:05:35,985 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base 1))) is different from true [2024-10-14 18:05:35,995 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 18:05:35,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-14 18:05:36,004 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-10-14 18:05:36,005 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:05:36,089 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2333 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2333) |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) 1)) is different from false [2024-10-14 18:05:36,092 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2333 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) v_ArrVal_2333) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) 1)) is different from false [2024-10-14 18:05:36,099 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-10-14 18:05:36,099 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 33 treesize of output 32 [2024-10-14 18:05:36,102 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2333 (Array Int Int)) (v_ArrVal_2332 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem8#1.base| v_ArrVal_2332))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2333)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) |c_ULTIMATE.start_create_#t~mem8#1.base|)) is different from false [2024-10-14 18:05:36,106 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2333 (Array Int Int)) (v_ArrVal_2332 (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 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2332))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_2333)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))))) is different from false [2024-10-14 18:05:36,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:05:36,110 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 44 treesize of output 35 [2024-10-14 18:05:36,112 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 162 treesize of output 126 [2024-10-14 18:05:36,137 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 15 treesize of output 11 [2024-10-14 18:05:36,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-10-14 18:05:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:36,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145223411] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:05:36,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:05:36,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 13] total 30 [2024-10-14 18:05:36,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921442648] [2024-10-14 18:05:36,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:05:36,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-14 18:05:36,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:36,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-14 18:05:36,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=576, Unknown=5, NotChecked=260, Total=930 [2024-10-14 18:05:36,184 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand has 31 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 3 states have call successors, (7), 5 states have call predecessors, (7), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 18:05:36,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:36,456 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2024-10-14 18:05:36,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 18:05:36,457 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 3 states have call successors, (7), 5 states have call predecessors, (7), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 32 [2024-10-14 18:05:36,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:36,458 INFO L225 Difference]: With dead ends: 71 [2024-10-14 18:05:36,458 INFO L226 Difference]: Without dead ends: 71 [2024-10-14 18:05:36,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=868, Unknown=5, NotChecked=320, Total=1332 [2024-10-14 18:05:36,459 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:36,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 304 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 381 Invalid, 0 Unknown, 152 Unchecked, 0.2s Time] [2024-10-14 18:05:36,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-14 18:05:36,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-14 18:05:36,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 55 states have (on average 1.4) internal successors, (77), 66 states have internal predecessors, (77), 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-10-14 18:05:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2024-10-14 18:05:36,460 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 32 [2024-10-14 18:05:36,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:36,461 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2024-10-14 18:05:36,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 3 states have call successors, (7), 5 states have call predecessors, (7), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 18:05:36,461 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2024-10-14 18:05:36,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 18:05:36,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:36,465 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:36,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-14 18:05:36,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-14 18:05:36,666 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-14 18:05:36,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:36,667 INFO L85 PathProgramCache]: Analyzing trace with hash 408173833, now seen corresponding path program 1 times [2024-10-14 18:05:36,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:36,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855180359] [2024-10-14 18:05:36,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:36,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:37,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:37,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:05:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:37,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 18:05:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:37,296 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:05:37,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:37,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855180359] [2024-10-14 18:05:37,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855180359] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:05:37,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706471464] [2024-10-14 18:05:37,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:37,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:05:37,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:05:37,298 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:05:37,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-14 18:05:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:37,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-14 18:05:37,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:37,488 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-10-14 18:05:37,547 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:05:37,547 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-10-14 18:05:37,577 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-10-14 18:05:37,581 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-10-14 18:05:37,639 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 18:05:37,640 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-10-14 18:05:37,645 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-10-14 18:05:37,681 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 18:05:37,681 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 73 treesize of output 66 [2024-10-14 18:05:37,684 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-10-14 18:05:37,714 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 42 treesize of output 18 [2024-10-14 18:05:37,718 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 9 treesize of output 3 [2024-10-14 18:05:37,763 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-10-14 18:05:37,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:05:37,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:05:37,789 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:05:37,789 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-10-14 18:05:37,809 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-14 18:05:37,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:05:37,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706471464] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:05:37,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:05:37,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 30 [2024-10-14 18:05:37,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510330024] [2024-10-14 18:05:37,882 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:05:37,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-14 18:05:37,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:37,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-14 18:05:37,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=895, Unknown=1, NotChecked=60, Total=1056 [2024-10-14 18:05:37,883 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 31 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 23 states have internal predecessors, (49), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:05:38,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:38,294 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2024-10-14 18:05:38,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 18:05:38,294 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 23 states have internal predecessors, (49), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 32 [2024-10-14 18:05:38,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:38,294 INFO L225 Difference]: With dead ends: 67 [2024-10-14 18:05:38,295 INFO L226 Difference]: Without dead ends: 67 [2024-10-14 18:05:38,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=1445, Unknown=1, NotChecked=78, Total=1722 [2024-10-14 18:05:38,295 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:38,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 353 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 595 Invalid, 0 Unknown, 46 Unchecked, 0.2s Time] [2024-10-14 18:05:38,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-14 18:05:38,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-14 18:05:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 62 states have internal predecessors, (73), 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-10-14 18:05:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2024-10-14 18:05:38,297 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 32 [2024-10-14 18:05:38,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:38,298 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2024-10-14 18:05:38,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 23 states have internal predecessors, (49), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-14 18:05:38,298 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2024-10-14 18:05:38,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 18:05:38,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:38,298 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:38,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-14 18:05:38,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-14 18:05:38,499 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-14 18:05:38,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:38,499 INFO L85 PathProgramCache]: Analyzing trace with hash -194811468, now seen corresponding path program 1 times [2024-10-14 18:05:38,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:38,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725674843] [2024-10-14 18:05:38,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:38,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:38,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:38,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:05:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:38,670 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:05:38,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:38,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725674843] [2024-10-14 18:05:38,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725674843] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:05:38,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004680107] [2024-10-14 18:05:38,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:38,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:05:38,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:05:38,673 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:05:38,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-14 18:05:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:38,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 18:05:38,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 18:05:38,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:05:39,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:05:39,021 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-10-14 18:05:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 18:05:39,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004680107] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:05:39,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:05:39,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 19 [2024-10-14 18:05:39,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793441949] [2024-10-14 18:05:39,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:05:39,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 18:05:39,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:05:39,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 18:05:39,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-10-14 18:05:39,088 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 20 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 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-10-14 18:05:39,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:05:39,264 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2024-10-14 18:05:39,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 18:05:39,265 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 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 32 [2024-10-14 18:05:39,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:05:39,265 INFO L225 Difference]: With dead ends: 70 [2024-10-14 18:05:39,265 INFO L226 Difference]: Without dead ends: 70 [2024-10-14 18:05:39,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2024-10-14 18:05:39,266 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 20 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:05:39,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 256 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:05:39,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-14 18:05:39,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2024-10-14 18:05:39,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 62 states have internal predecessors, (70), 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-10-14 18:05:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2024-10-14 18:05:39,270 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 32 [2024-10-14 18:05:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:05:39,270 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2024-10-14 18:05:39,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 18 states have internal predecessors, (66), 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-10-14 18:05:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2024-10-14 18:05:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 18:05:39,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:05:39,271 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:05:39,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-14 18:05:39,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:05:39,471 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-14 18:05:39,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:05:39,472 INFO L85 PathProgramCache]: Analyzing trace with hash -193108470, now seen corresponding path program 2 times [2024-10-14 18:05:39,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:05:39,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374949313] [2024-10-14 18:05:39,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:05:39,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:05:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:40,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 18:05:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:40,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 18:05:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:05:40,556 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:05:40,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:05:40,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374949313] [2024-10-14 18:05:40,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374949313] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:05:40,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731894541] [2024-10-14 18:05:40,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 18:05:40,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:05:40,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:05:40,557 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:05:40,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-14 18:05:40,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 18:05:40,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 18:05:40,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-10-14 18:05:40,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:05:40,833 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-10-14 18:05:40,835 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-10-14 18:05:40,847 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-10-14 18:05:40,852 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-10-14 18:05:40,887 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-10-14 18:05:40,892 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-10-14 18:05:40,934 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:05:40,934 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-10-14 18:05:40,968 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 40 treesize of output 42 [2024-10-14 18:05:40,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-10-14 18:05:41,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:05:41,070 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2024-10-14 18:05:41,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 63 [2024-10-14 18:05:41,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:05:41,083 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2024-10-14 18:05:41,083 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 64 [2024-10-14 18:05:41,268 INFO L349 Elim1Store]: treesize reduction 110, result has 18.5 percent of original size [2024-10-14 18:05:41,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 178 treesize of output 117 [2024-10-14 18:05:41,293 INFO L349 Elim1Store]: treesize reduction 51, result has 29.2 percent of original size [2024-10-14 18:05:41,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 94 [2024-10-14 18:05:41,966 INFO L349 Elim1Store]: treesize reduction 60, result has 71.6 percent of original size [2024-10-14 18:05:41,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 191 treesize of output 247 [2024-10-14 18:05:42,147 INFO L349 Elim1Store]: treesize reduction 72, result has 71.3 percent of original size [2024-10-14 18:05:42,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 26 case distinctions, treesize of input 95 treesize of output 235 [2024-10-14 18:05:50,213 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:05:50,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:05:50,566 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse7))) (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| .cse4)) (.cse5 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$#0.base| .cse4)) (.cse1 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse7))) (and (forall ((v_ArrVal_2928 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_2928 .cse1)) v_ArrVal_2928)) (forall ((v_ArrVal_2929 (Array Int Int))) (or (not (= (store .cse2 .cse1 (select v_ArrVal_2929 .cse1)) v_ArrVal_2929)) (= (let ((.cse3 (store |c_#memory_$Pointer$#0.offset| .cse4 v_ArrVal_2928))) (select (select .cse3 (select (select (store |c_#memory_$Pointer$#0.base| .cse4 v_ArrVal_2929) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5)) (+ (select (select .cse3 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5) 4))) 0))))) (forall ((v_ArrVal_2928 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_2928 .cse1)) v_ArrVal_2928)) (forall ((v_ArrVal_2929 (Array Int Int))) (or (= (select (let ((.cse6 (store |c_#memory_$Pointer$#0.base| .cse4 v_ArrVal_2929))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5))) (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse4 v_ArrVal_2928) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5) 4)) 0) (not (= (store .cse2 .cse1 (select v_ArrVal_2929 .cse1)) v_ArrVal_2929)))))))))) is different from false [2024-10-14 18:05:50,619 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_create_#t~mem8#1.offset| 12))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem8#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem8#1.base|) .cse10 |c_ULTIMATE.start_create_~now~0#1.base|))) (.cse9 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse6 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem8#1.base| (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem8#1.base|) .cse10 |c_ULTIMATE.start_create_~now~0#1.offset|))) (.cse4 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse9))) (let ((.cse0 (select .cse6 .cse4)) (.cse5 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse7 (select .cse3 .cse4)) (.cse1 (select (select .cse6 |c_ULTIMATE.start_create_~now~0#1.base|) .cse9))) (and (forall ((v_ArrVal_2928 (Array Int Int))) (or (not (= v_ArrVal_2928 (store .cse0 .cse1 (select v_ArrVal_2928 .cse1)))) (forall ((v_ArrVal_2929 (Array Int Int))) (or (= (let ((.cse2 (store .cse6 .cse4 v_ArrVal_2928))) (select (select .cse2 (select (select (store .cse3 .cse4 v_ArrVal_2929) |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_2929 (store .cse7 .cse1 (select v_ArrVal_2929 .cse1)))))))) (forall ((v_ArrVal_2928 (Array Int Int))) (or (not (= v_ArrVal_2928 (store .cse0 .cse1 (select v_ArrVal_2928 .cse1)))) (forall ((v_ArrVal_2929 (Array Int Int))) (or (= (select (let ((.cse8 (store .cse3 .cse4 v_ArrVal_2929))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5))) (+ (select (select (store .cse6 .cse4 v_ArrVal_2928) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5) 4)) 0) (not (= v_ArrVal_2929 (store .cse7 .cse1 (select v_ArrVal_2929 .cse1))))))))))))) is different from false [2024-10-14 18:05:50,682 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 ((.cse11 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse4 (+ |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))) (and (forall ((|v_ULTIMATE.start_create_#t~mem8#1.offset_33| Int)) (or (forall ((v_ArrVal_2928 (Array Int Int))) (let ((.cse9 (+ 12 |v_ULTIMATE.start_create_#t~mem8#1.offset_33|))) (let ((.cse5 (store |c_#memory_$Pointer$#0.offset| .cse7 (store .cse10 .cse9 |c_ULTIMATE.start_create_~now~0#1.offset|))) (.cse0 (store |c_#memory_$Pointer$#0.base| .cse7 (store .cse8 .cse9 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse2 (select (select .cse5 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (forall ((v_ArrVal_2929 (Array Int Int))) (or (not (= v_ArrVal_2929 (store (select .cse0 .cse1) .cse2 (select v_ArrVal_2929 .cse2)))) (= (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_2929))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4))) (+ (select (select (store .cse5 .cse1 v_ArrVal_2928) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4) 4)) 0))) (not (= v_ArrVal_2928 (store (select .cse5 .cse1) .cse2 (select v_ArrVal_2928 .cse2))))))))) (< |v_ULTIMATE.start_create_#t~mem8#1.offset_33| .cse11))) (forall ((|v_ULTIMATE.start_create_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_create_#t~mem8#1.offset_33| .cse11) (forall ((v_ArrVal_2928 (Array Int Int))) (let ((.cse17 (+ 12 |v_ULTIMATE.start_create_#t~mem8#1.offset_33|))) (let ((.cse15 (store |c_#memory_$Pointer$#0.offset| .cse7 (store .cse10 .cse17 |c_ULTIMATE.start_create_~now~0#1.offset|))) (.cse13 (store |c_#memory_$Pointer$#0.base| .cse7 (store .cse8 .cse17 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse16 (select (select .cse15 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (forall ((v_ArrVal_2929 (Array Int Int))) (or (= (let ((.cse12 (store .cse15 .cse14 v_ArrVal_2928))) (select (select .cse12 (select (select (store .cse13 .cse14 v_ArrVal_2929) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4)) (+ (select (select .cse12 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4) 4))) 0) (not (= v_ArrVal_2929 (store (select .cse13 .cse14) .cse16 (select v_ArrVal_2929 .cse16)))))) (not (= v_ArrVal_2928 (store (select .cse15 .cse14) .cse16 (select v_ArrVal_2928 .cse16))))))))))))))) is different from false [2024-10-14 18:05:50,993 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse10 (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~ret7#1.offset|))) (.cse7 (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~ret7#1.base|)))) (let ((.cse4 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse8 (select .cse7 |c_ULTIMATE.start_create_#t~ret7#1.base|)) (.cse11 (select .cse10 |c_ULTIMATE.start_create_#t~ret7#1.base|))) (and (forall ((|v_ULTIMATE.start_create_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_create_#t~mem8#1.offset_33| |c_ULTIMATE.start_create_#t~ret7#1.offset|) (forall ((v_ArrVal_2928 (Array Int Int))) (let ((.cse9 (+ 12 |v_ULTIMATE.start_create_#t~mem8#1.offset_33|))) (let ((.cse5 (store .cse10 |c_ULTIMATE.start_create_#t~ret7#1.base| (store .cse11 .cse9 |c_ULTIMATE.start_create_~now~0#1.offset|))) (.cse0 (store .cse7 |c_ULTIMATE.start_create_#t~ret7#1.base| (store .cse8 .cse9 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse2 (select (select .cse5 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (forall ((v_ArrVal_2929 (Array Int Int))) (or (not (= (store (select .cse0 .cse1) .cse2 (select v_ArrVal_2929 .cse2)) v_ArrVal_2929)) (= (select (let ((.cse3 (store .cse0 .cse1 v_ArrVal_2929))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4))) (+ (select (select (store .cse5 .cse1 v_ArrVal_2928) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4) 4)) 0))) (not (= v_ArrVal_2928 (store (select .cse5 .cse1) .cse2 (select v_ArrVal_2928 .cse2))))))))))) (forall ((|v_ULTIMATE.start_create_#t~mem8#1.offset_33| Int)) (or (< |v_ULTIMATE.start_create_#t~mem8#1.offset_33| |c_ULTIMATE.start_create_#t~ret7#1.offset|) (forall ((v_ArrVal_2928 (Array Int Int))) (let ((.cse17 (+ 12 |v_ULTIMATE.start_create_#t~mem8#1.offset_33|))) (let ((.cse16 (store .cse10 |c_ULTIMATE.start_create_#t~ret7#1.base| (store .cse11 .cse17 |c_ULTIMATE.start_create_~now~0#1.offset|))) (.cse12 (store .cse7 |c_ULTIMATE.start_create_#t~ret7#1.base| (store .cse8 .cse17 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse14 (select (select .cse16 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (forall ((v_ArrVal_2929 (Array Int Int))) (or (not (= (store (select .cse12 .cse13) .cse14 (select v_ArrVal_2929 .cse14)) v_ArrVal_2929)) (= (let ((.cse15 (store .cse16 .cse13 v_ArrVal_2928))) (select (select .cse15 (select (select (store .cse12 .cse13 v_ArrVal_2929) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4)) (+ (select (select .cse15 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4) 4))) 0))) (not (= v_ArrVal_2928 (store (select .cse16 .cse13) .cse14 (select v_ArrVal_2928 .cse14))))))))))))))) is different from false [2024-10-14 18:05:52,378 INFO L349 Elim1Store]: treesize reduction 333, result has 32.6 percent of original size [2024-10-14 18:05:52,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 15 new quantified variables, introduced 37 case distinctions, treesize of input 91134 treesize of output 51191 [2024-10-14 18:05:54,119 INFO L349 Elim1Store]: treesize reduction 957, result has 29.2 percent of original size [2024-10-14 18:05:54,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 37 case distinctions, treesize of input 128771 treesize of output 99238 [2024-10-14 18:05:55,529 INFO L349 Elim1Store]: treesize reduction 416, result has 31.1 percent of original size [2024-10-14 18:05:55,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 14 new quantified variables, introduced 46 case distinctions, treesize of input 15936 treesize of output 12471 [2024-10-14 18:05:57,738 INFO L349 Elim1Store]: treesize reduction 8, result has 97.7 percent of original size [2024-10-14 18:05:57,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 14 new quantified variables, introduced 36 case distinctions, treesize of input 17163 treesize of output 13839 [2024-10-14 18:05:59,114 INFO L349 Elim1Store]: treesize reduction 803, result has 29.1 percent of original size [2024-10-14 18:05:59,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 46 case distinctions, treesize of input 12788 treesize of output 12106 [2024-10-14 18:06:00,806 INFO L349 Elim1Store]: treesize reduction 33, result has 95.3 percent of original size [2024-10-14 18:06:00,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 11827 treesize of output 11912