./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-middle-shared.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/sll-middle-shared.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 003ead3201cb38ecc17dca4c0dd7fb7b12eace11010ba9f6077aefef97bddb9b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:21:27,177 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:21:27,257 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-10 15:21:27,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:21:27,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:21:27,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:21:27,295 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:21:27,296 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:21:27,296 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:21:27,300 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:21:27,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:21:27,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:21:27,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:21:27,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:21:27,302 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:21:27,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:21:27,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:21:27,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:21:27,303 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:21:27,303 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:21:27,303 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:21:27,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:21:27,305 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:21:27,306 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:21:27,306 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:21:27,306 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:21:27,306 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:21:27,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:21:27,307 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:21:27,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:21:27,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:21:27,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:21:27,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:21:27,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:21:27,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:21:27,309 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:21:27,309 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:21:27,310 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:21:27,310 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:21:27,310 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 -> 003ead3201cb38ecc17dca4c0dd7fb7b12eace11010ba9f6077aefef97bddb9b [2024-11-10 15:21:27,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:21:27,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:21:27,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:21:27,589 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:21:27,590 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:21:27,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-middle-shared.i [2024-11-10 15:21:29,049 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:21:29,303 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:21:29,304 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-middle-shared.i [2024-11-10 15:21:29,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67fd568a1/9f0fd9e7ecaa49869c934f712e548347/FLAG594964150 [2024-11-10 15:21:29,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67fd568a1/9f0fd9e7ecaa49869c934f712e548347 [2024-11-10 15:21:29,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:21:29,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:21:29,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:21:29,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:21:29,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:21:29,351 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:21:29" (1/1) ... [2024-11-10 15:21:29,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@744b0cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:29, skipping insertion in model container [2024-11-10 15:21:29,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:21:29" (1/1) ... [2024-11-10 15:21:29,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:21:29,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:21:29,744 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:21:29,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:21:29,870 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:21:29,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:29 WrapperNode [2024-11-10 15:21:29,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:21:29,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:21:29,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:21:29,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:21:29,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:29" (1/1) ... [2024-11-10 15:21:29,893 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:29" (1/1) ... [2024-11-10 15:21:29,917 INFO L138 Inliner]: procedures = 121, calls = 31, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 92 [2024-11-10 15:21:29,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:21:29,918 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:21:29,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:21:29,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:21:29,929 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:29" (1/1) ... [2024-11-10 15:21:29,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:29" (1/1) ... [2024-11-10 15:21:29,933 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:29" (1/1) ... [2024-11-10 15:21:29,967 INFO L175 MemorySlicer]: Split 17 memory accesses to 1 slices as follows [17]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 8 writes are split as follows [8]. [2024-11-10 15:21:29,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:29" (1/1) ... [2024-11-10 15:21:29,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:29" (1/1) ... [2024-11-10 15:21:29,976 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:29" (1/1) ... [2024-11-10 15:21:29,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:29" (1/1) ... [2024-11-10 15:21:29,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:29" (1/1) ... [2024-11-10 15:21:29,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:29" (1/1) ... [2024-11-10 15:21:29,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:21:29,983 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:21:29,983 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:21:29,983 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:21:29,984 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:29" (1/1) ... [2024-11-10 15:21:29,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:21:30,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:30,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 15:21:30,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 15:21:30,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 15:21:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-10 15:21:30,083 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-10 15:21:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:21:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:21:30,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:21:30,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:21:30,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:21:30,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:21:30,236 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:21:30,239 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:21:30,598 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-10 15:21:30,598 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:21:30,611 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:21:30,612 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:21:30,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:21:30 BoogieIcfgContainer [2024-11-10 15:21:30,612 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:21:30,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:21:30,615 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:21:30,617 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:21:30,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:21:29" (1/3) ... [2024-11-10 15:21:30,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc15baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:21:30, skipping insertion in model container [2024-11-10 15:21:30,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:29" (2/3) ... [2024-11-10 15:21:30,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc15baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:21:30, skipping insertion in model container [2024-11-10 15:21:30,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:21:30" (3/3) ... [2024-11-10 15:21:30,619 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-middle-shared.i [2024-11-10 15:21:30,632 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:21:30,633 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-11-10 15:21:30,679 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:21:30,685 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;@693927ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:21:30,686 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-11-10 15:21:30,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 60 states have (on average 1.85) internal successors, (111), 104 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:30,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:21:30,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:30,699 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:21:30,700 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:30,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:30,706 INFO L85 PathProgramCache]: Analyzing trace with hash 136436179, now seen corresponding path program 1 times [2024-11-10 15:21:30,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:30,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427983060] [2024-11-10 15:21:30,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:30,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:30,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:30,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:30,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427983060] [2024-11-10 15:21:30,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427983060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:30,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:30,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:21:30,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213076500] [2024-11-10 15:21:30,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:30,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:21:30,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:30,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:21:30,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:21:30,966 INFO L87 Difference]: Start difference. First operand has 108 states, 60 states have (on average 1.85) internal successors, (111), 104 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:21:31,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:31,084 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2024-11-10 15:21:31,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:21:31,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-10 15:21:31,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:31,092 INFO L225 Difference]: With dead ends: 107 [2024-11-10 15:21:31,092 INFO L226 Difference]: Without dead ends: 104 [2024-11-10 15:21:31,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:21:31,097 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:31,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 167 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:31,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-10 15:21:31,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-10 15:21:31,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 58 states have (on average 1.793103448275862) internal successors, (104), 100 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:31,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2024-11-10 15:21:31,129 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 5 [2024-11-10 15:21:31,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:31,129 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2024-11-10 15:21:31,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:21:31,129 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2024-11-10 15:21:31,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:21:31,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:31,130 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:21:31,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:21:31,130 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:31,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:31,131 INFO L85 PathProgramCache]: Analyzing trace with hash 136436180, now seen corresponding path program 1 times [2024-11-10 15:21:31,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:31,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507058248] [2024-11-10 15:21:31,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:31,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:31,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:31,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507058248] [2024-11-10 15:21:31,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507058248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:31,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:31,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:21:31,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216476304] [2024-11-10 15:21:31,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:31,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:21:31,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:31,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:21:31,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:21:31,261 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:21:31,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:31,325 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2024-11-10 15:21:31,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:21:31,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-10 15:21:31,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:31,327 INFO L225 Difference]: With dead ends: 103 [2024-11-10 15:21:31,327 INFO L226 Difference]: Without dead ends: 103 [2024-11-10 15:21:31,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:21:31,328 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:31,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 175 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:31,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-10 15:21:31,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-10 15:21:31,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 99 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:31,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2024-11-10 15:21:31,342 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 5 [2024-11-10 15:21:31,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:31,344 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2024-11-10 15:21:31,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:21:31,344 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2024-11-10 15:21:31,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 15:21:31,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:31,345 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:31,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:21:31,346 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:31,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:31,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1770289155, now seen corresponding path program 1 times [2024-11-10 15:21:31,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:31,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434054512] [2024-11-10 15:21:31,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:31,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:31,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:31,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:31,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:31,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434054512] [2024-11-10 15:21:31,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434054512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:31,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:31,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:21:31,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106806077] [2024-11-10 15:21:31,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:31,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:21:31,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:31,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:21:31,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:21:31,485 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:31,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:31,642 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2024-11-10 15:21:31,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:21:31,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2024-11-10 15:21:31,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:31,646 INFO L225 Difference]: With dead ends: 107 [2024-11-10 15:21:31,647 INFO L226 Difference]: Without dead ends: 107 [2024-11-10 15:21:31,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:21:31,650 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 15 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:31,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 188 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:31,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-10 15:21:31,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2024-11-10 15:21:31,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 98 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:31,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2024-11-10 15:21:31,670 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 10 [2024-11-10 15:21:31,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:31,670 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2024-11-10 15:21:31,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:31,671 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2024-11-10 15:21:31,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 15:21:31,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:31,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:31,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:21:31,672 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:31,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:31,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1770289154, now seen corresponding path program 1 times [2024-11-10 15:21:31,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:31,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151698552] [2024-11-10 15:21:31,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:31,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:31,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:31,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:31,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:31,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151698552] [2024-11-10 15:21:31,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151698552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:31,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:31,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:21:31,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802177816] [2024-11-10 15:21:31,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:31,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:21:31,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:31,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:21:31,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:21:31,802 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:31,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:31,930 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2024-11-10 15:21:31,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:21:31,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2024-11-10 15:21:31,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:31,933 INFO L225 Difference]: With dead ends: 106 [2024-11-10 15:21:31,933 INFO L226 Difference]: Without dead ends: 106 [2024-11-10 15:21:31,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:21:31,934 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 15 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:31,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 199 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:31,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-10 15:21:31,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2024-11-10 15:21:31,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 97 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:31,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2024-11-10 15:21:31,947 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 10 [2024-11-10 15:21:31,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:31,948 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2024-11-10 15:21:31,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:31,948 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2024-11-10 15:21:31,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 15:21:31,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:31,949 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:31,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:21:31,949 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:31,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:31,949 INFO L85 PathProgramCache]: Analyzing trace with hash -440826310, now seen corresponding path program 1 times [2024-11-10 15:21:31,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:31,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696355662] [2024-11-10 15:21:31,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:31,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:32,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:32,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:32,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:32,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696355662] [2024-11-10 15:21:32,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696355662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:32,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:32,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:21:32,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866094762] [2024-11-10 15:21:32,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:32,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:21:32,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:32,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:21:32,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:21:32,052 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:32,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:32,183 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2024-11-10 15:21:32,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:21:32,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2024-11-10 15:21:32,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:32,185 INFO L225 Difference]: With dead ends: 105 [2024-11-10 15:21:32,185 INFO L226 Difference]: Without dead ends: 105 [2024-11-10 15:21:32,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:21:32,188 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 12 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:32,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 189 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:32,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-10 15:21:32,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2024-11-10 15:21:32,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 58 states have (on average 1.7241379310344827) internal successors, (100), 96 states have internal predecessors, (100), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2024-11-10 15:21:32,199 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 12 [2024-11-10 15:21:32,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:32,200 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2024-11-10 15:21:32,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:32,200 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2024-11-10 15:21:32,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 15:21:32,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:32,202 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:32,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:21:32,203 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:32,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:32,203 INFO L85 PathProgramCache]: Analyzing trace with hash -440826309, now seen corresponding path program 1 times [2024-11-10 15:21:32,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:32,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901670474] [2024-11-10 15:21:32,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:32,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:32,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:32,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:32,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:32,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901670474] [2024-11-10 15:21:32,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901670474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:32,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:32,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:21:32,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130512626] [2024-11-10 15:21:32,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:32,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:21:32,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:32,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:21:32,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:21:32,322 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:32,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:32,424 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2024-11-10 15:21:32,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:21:32,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2024-11-10 15:21:32,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:32,425 INFO L225 Difference]: With dead ends: 104 [2024-11-10 15:21:32,429 INFO L226 Difference]: Without dead ends: 104 [2024-11-10 15:21:32,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:21:32,430 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 12 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:32,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 200 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:32,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-10 15:21:32,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2024-11-10 15:21:32,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 58 states have (on average 1.706896551724138) internal successors, (99), 95 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2024-11-10 15:21:32,435 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 12 [2024-11-10 15:21:32,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:32,435 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2024-11-10 15:21:32,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:32,436 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2024-11-10 15:21:32,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 15:21:32,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:32,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:32,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 15:21:32,437 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:32,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:32,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1567680695, now seen corresponding path program 1 times [2024-11-10 15:21:32,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:32,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821321799] [2024-11-10 15:21:32,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:32,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:32,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:32,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:32,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:32,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821321799] [2024-11-10 15:21:32,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821321799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:32,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:32,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:21:32,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674699112] [2024-11-10 15:21:32,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:32,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:21:32,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:32,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:21:32,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:21:32,645 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) 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-11-10 15:21:32,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:32,835 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2024-11-10 15:21:32,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:21:32,835 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) 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-11-10 15:21:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:32,836 INFO L225 Difference]: With dead ends: 99 [2024-11-10 15:21:32,836 INFO L226 Difference]: Without dead ends: 99 [2024-11-10 15:21:32,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:21:32,838 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 34 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:32,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 296 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:32,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-10 15:21:32,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2024-11-10 15:21:32,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 90 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:32,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2024-11-10 15:21:32,849 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 14 [2024-11-10 15:21:32,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:32,849 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2024-11-10 15:21:32,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) 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-11-10 15:21:32,849 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2024-11-10 15:21:32,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 15:21:32,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:32,850 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:32,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 15:21:32,850 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:32,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:32,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1567680696, now seen corresponding path program 1 times [2024-11-10 15:21:32,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:32,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249859574] [2024-11-10 15:21:32,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:32,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:33,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:33,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:33,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:33,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249859574] [2024-11-10 15:21:33,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249859574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:33,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:33,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:21:33,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280485274] [2024-11-10 15:21:33,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:33,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:21:33,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:33,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:21:33,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:21:33,201 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 7 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-11-10 15:21:33,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:33,370 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2024-11-10 15:21:33,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:21:33,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 7 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-11-10 15:21:33,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:33,372 INFO L225 Difference]: With dead ends: 97 [2024-11-10 15:21:33,372 INFO L226 Difference]: Without dead ends: 97 [2024-11-10 15:21:33,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:21:33,373 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 14 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:33,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 316 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:33,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-10 15:21:33,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2024-11-10 15:21:33,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 88 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2024-11-10 15:21:33,381 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 14 [2024-11-10 15:21:33,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:33,381 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2024-11-10 15:21:33,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 7 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-11-10 15:21:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2024-11-10 15:21:33,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 15:21:33,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:33,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:33,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 15:21:33,383 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:33,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:33,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1552250935, now seen corresponding path program 1 times [2024-11-10 15:21:33,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:33,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75852934] [2024-11-10 15:21:33,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:33,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:33,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:33,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:33,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:33,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75852934] [2024-11-10 15:21:33,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75852934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:33,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:33,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:21:33,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106472967] [2024-11-10 15:21:33,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:33,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:21:33,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:33,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:21:33,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:21:33,512 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:33,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:33,707 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2024-11-10 15:21:33,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:21:33,707 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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 22 [2024-11-10 15:21:33,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:33,708 INFO L225 Difference]: With dead ends: 119 [2024-11-10 15:21:33,708 INFO L226 Difference]: Without dead ends: 119 [2024-11-10 15:21:33,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:21:33,710 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 53 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:33,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 296 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:33,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-10 15:21:33,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2024-11-10 15:21:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 77 states have (on average 1.5844155844155845) internal successors, (122), 105 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:33,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 128 transitions. [2024-11-10 15:21:33,719 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 128 transitions. Word has length 22 [2024-11-10 15:21:33,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:33,723 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 128 transitions. [2024-11-10 15:21:33,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:33,724 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2024-11-10 15:21:33,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 15:21:33,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:33,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:33,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 15:21:33,725 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:33,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:33,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1552250936, now seen corresponding path program 1 times [2024-11-10 15:21:33,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:33,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353590537] [2024-11-10 15:21:33,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:33,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:33,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:34,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:34,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:34,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353590537] [2024-11-10 15:21:34,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353590537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:34,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:34,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:21:34,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019705718] [2024-11-10 15:21:34,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:34,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:21:34,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:34,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:21:34,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:21:34,034 INFO L87 Difference]: Start difference. First operand 110 states and 128 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:34,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:34,252 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2024-11-10 15:21:34,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:21:34,253 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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 22 [2024-11-10 15:21:34,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:34,254 INFO L225 Difference]: With dead ends: 123 [2024-11-10 15:21:34,254 INFO L226 Difference]: Without dead ends: 123 [2024-11-10 15:21:34,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:21:34,255 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 21 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:34,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 546 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:34,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-10 15:21:34,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2024-11-10 15:21:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 86 states have (on average 1.5348837209302326) internal successors, (132), 114 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:34,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 138 transitions. [2024-11-10 15:21:34,263 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 138 transitions. Word has length 22 [2024-11-10 15:21:34,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:34,263 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 138 transitions. [2024-11-10 15:21:34,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:34,263 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 138 transitions. [2024-11-10 15:21:34,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 15:21:34,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:34,264 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:34,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 15:21:34,265 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:34,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:34,265 INFO L85 PathProgramCache]: Analyzing trace with hash 30192017, now seen corresponding path program 1 times [2024-11-10 15:21:34,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:34,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272000750] [2024-11-10 15:21:34,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:34,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:34,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:34,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:21:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:34,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:21:34,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:34,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272000750] [2024-11-10 15:21:34,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272000750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:34,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:34,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:21:34,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87717628] [2024-11-10 15:21:34,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:34,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:21:34,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:34,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:21:34,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:21:34,471 INFO L87 Difference]: Start difference. First operand 119 states and 138 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:34,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:34,656 INFO L93 Difference]: Finished difference Result 119 states and 137 transitions. [2024-11-10 15:21:34,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:21:34,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 24 [2024-11-10 15:21:34,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:34,657 INFO L225 Difference]: With dead ends: 119 [2024-11-10 15:21:34,657 INFO L226 Difference]: Without dead ends: 119 [2024-11-10 15:21:34,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:21:34,658 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 14 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:34,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 246 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:34,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-10 15:21:34,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-10 15:21:34,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 86 states have (on average 1.5232558139534884) internal successors, (131), 114 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:34,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 137 transitions. [2024-11-10 15:21:34,667 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 137 transitions. Word has length 24 [2024-11-10 15:21:34,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:34,667 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 137 transitions. [2024-11-10 15:21:34,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:34,668 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 137 transitions. [2024-11-10 15:21:34,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 15:21:34,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:34,669 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:34,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 15:21:34,670 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:34,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:34,670 INFO L85 PathProgramCache]: Analyzing trace with hash 30192018, now seen corresponding path program 1 times [2024-11-10 15:21:34,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:34,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818519977] [2024-11-10 15:21:34,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:34,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:34,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:34,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:21:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:35,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-11-10 15:21:35,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:35,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818519977] [2024-11-10 15:21:35,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818519977] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:35,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568216745] [2024-11-10 15:21:35,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:35,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:35,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:35,031 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:21:35,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 15:21:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:35,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 15:21:35,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:35,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-11-10 15:21:35,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:21:35,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:21:35,329 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:21:35,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:21:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:35,349 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:21:35,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568216745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:35,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:21:35,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2024-11-10 15:21:35,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877396386] [2024-11-10 15:21:35,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:35,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:21:35,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:35,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:21:35,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=196, Unknown=1, NotChecked=28, Total=272 [2024-11-10 15:21:35,350 INFO L87 Difference]: Start difference. First operand 119 states and 137 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:35,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:35,485 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2024-11-10 15:21:35,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:21:35,485 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 24 [2024-11-10 15:21:35,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:35,486 INFO L225 Difference]: With dead ends: 123 [2024-11-10 15:21:35,486 INFO L226 Difference]: Without dead ends: 123 [2024-11-10 15:21:35,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=196, Unknown=1, NotChecked=28, Total=272 [2024-11-10 15:21:35,487 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 27 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:35,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 217 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 133 Unchecked, 0.1s Time] [2024-11-10 15:21:35,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-10 15:21:35,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2024-11-10 15:21:35,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 86 states have (on average 1.4767441860465116) internal successors, (127), 114 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:35,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2024-11-10 15:21:35,490 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 24 [2024-11-10 15:21:35,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:35,490 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2024-11-10 15:21:35,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:35,490 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2024-11-10 15:21:35,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 15:21:35,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:35,491 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:35,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 15:21:35,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-10 15:21:35,696 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:35,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:35,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1359457963, now seen corresponding path program 1 times [2024-11-10 15:21:35,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:35,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652485644] [2024-11-10 15:21:35,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:35,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:35,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:35,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:35,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:35,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652485644] [2024-11-10 15:21:35,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652485644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:35,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:35,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:21:35,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221243165] [2024-11-10 15:21:35,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:35,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:21:35,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:35,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:21:35,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:21:35,820 INFO L87 Difference]: Start difference. First operand 119 states and 133 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:35,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:35,945 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2024-11-10 15:21:35,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:21:35,946 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-10 15:21:35,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:35,947 INFO L225 Difference]: With dead ends: 126 [2024-11-10 15:21:35,947 INFO L226 Difference]: Without dead ends: 126 [2024-11-10 15:21:35,947 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-11-10 15:21:35,948 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 25 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:35,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 584 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:35,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-10 15:21:35,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 121. [2024-11-10 15:21:35,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 116 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:35,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 133 transitions. [2024-11-10 15:21:35,951 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 133 transitions. Word has length 24 [2024-11-10 15:21:35,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:35,951 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 133 transitions. [2024-11-10 15:21:35,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:35,952 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 133 transitions. [2024-11-10 15:21:35,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:21:35,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:35,952 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:35,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 15:21:35,953 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:35,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:35,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1802270085, now seen corresponding path program 1 times [2024-11-10 15:21:35,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:35,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612385420] [2024-11-10 15:21:35,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:35,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:36,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:36,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:21:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:21:36,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:36,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612385420] [2024-11-10 15:21:36,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612385420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:36,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:36,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:21:36,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168873121] [2024-11-10 15:21:36,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:36,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:21:36,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:36,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:21:36,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:21:36,135 INFO L87 Difference]: Start difference. First operand 121 states and 133 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:21:36,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:36,347 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2024-11-10 15:21:36,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:21:36,347 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 27 [2024-11-10 15:21:36,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:36,349 INFO L225 Difference]: With dead ends: 120 [2024-11-10 15:21:36,349 INFO L226 Difference]: Without dead ends: 120 [2024-11-10 15:21:36,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:21:36,349 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 4 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:36,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 360 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:36,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-10 15:21:36,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-10 15:21:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 115 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:36,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2024-11-10 15:21:36,353 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 27 [2024-11-10 15:21:36,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:36,353 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2024-11-10 15:21:36,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:21:36,353 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2024-11-10 15:21:36,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:21:36,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:36,354 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:36,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 15:21:36,354 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:36,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:36,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1802270086, now seen corresponding path program 1 times [2024-11-10 15:21:36,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:36,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546501601] [2024-11-10 15:21:36,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:36,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:36,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:36,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:21:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:21:36,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:36,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546501601] [2024-11-10 15:21:36,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546501601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:36,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:36,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:21:36,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105089567] [2024-11-10 15:21:36,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:36,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:21:36,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:36,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:21:36,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:21:36,628 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:21:36,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:36,812 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2024-11-10 15:21:36,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:21:36,812 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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 27 [2024-11-10 15:21:36,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:36,813 INFO L225 Difference]: With dead ends: 119 [2024-11-10 15:21:36,813 INFO L226 Difference]: Without dead ends: 119 [2024-11-10 15:21:36,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:21:36,814 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 3 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:36,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 399 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:36,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-10 15:21:36,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-10 15:21:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 88 states have (on average 1.3977272727272727) internal successors, (123), 114 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2024-11-10 15:21:36,820 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 27 [2024-11-10 15:21:36,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:36,820 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2024-11-10 15:21:36,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:21:36,821 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2024-11-10 15:21:36,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:21:36,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:36,822 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:36,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 15:21:36,822 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:36,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:36,822 INFO L85 PathProgramCache]: Analyzing trace with hash 41984490, now seen corresponding path program 1 times [2024-11-10 15:21:36,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:36,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569424942] [2024-11-10 15:21:36,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:36,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:37,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:37,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:21:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:37,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:21:37,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:37,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569424942] [2024-11-10 15:21:37,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569424942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:37,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:37,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 15:21:37,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617738832] [2024-11-10 15:21:37,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:37,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:21:37,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:37,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:21:37,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:21:37,105 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:37,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:37,340 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2024-11-10 15:21:37,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:21:37,340 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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 30 [2024-11-10 15:21:37,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:37,341 INFO L225 Difference]: With dead ends: 120 [2024-11-10 15:21:37,341 INFO L226 Difference]: Without dead ends: 120 [2024-11-10 15:21:37,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-10 15:21:37,342 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 23 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:37,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 524 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:37,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-10 15:21:37,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-11-10 15:21:37,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 114 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:37,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2024-11-10 15:21:37,345 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 30 [2024-11-10 15:21:37,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:37,345 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2024-11-10 15:21:37,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:37,346 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2024-11-10 15:21:37,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:21:37,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:37,346 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:37,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 15:21:37,346 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:37,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:37,347 INFO L85 PathProgramCache]: Analyzing trace with hash 41984491, now seen corresponding path program 1 times [2024-11-10 15:21:37,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:37,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951418384] [2024-11-10 15:21:37,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:37,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:37,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:37,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:21:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:37,810 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:21:37,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:37,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951418384] [2024-11-10 15:21:37,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951418384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:37,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:37,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 15:21:37,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802874073] [2024-11-10 15:21:37,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:37,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:21:37,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:37,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:21:37,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:21:37,812 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:38,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:38,074 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2024-11-10 15:21:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:21:38,074 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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 30 [2024-11-10 15:21:38,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:38,075 INFO L225 Difference]: With dead ends: 119 [2024-11-10 15:21:38,075 INFO L226 Difference]: Without dead ends: 119 [2024-11-10 15:21:38,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-10 15:21:38,076 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 21 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:38,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 425 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:38,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-10 15:21:38,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-10 15:21:38,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 88 states have (on average 1.375) internal successors, (121), 114 states have internal predecessors, (121), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:38,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2024-11-10 15:21:38,080 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 30 [2024-11-10 15:21:38,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:38,081 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2024-11-10 15:21:38,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:38,081 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2024-11-10 15:21:38,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:21:38,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:38,082 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:38,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 15:21:38,082 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:38,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:38,082 INFO L85 PathProgramCache]: Analyzing trace with hash -675184419, now seen corresponding path program 1 times [2024-11-10 15:21:38,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:38,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029128556] [2024-11-10 15:21:38,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:38,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:38,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:38,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:38,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:38,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029128556] [2024-11-10 15:21:38,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029128556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:38,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300314410] [2024-11-10 15:21:38,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:38,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:38,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:38,963 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:21:38,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 15:21:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:39,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-10 15:21:39,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:39,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:21:39,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 15:21:39,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 15:21:39,248 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-10 15:21:39,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-10 15:21:39,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-10 15:21:39,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-10 15:21:39,383 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-10 15:21:39,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-10 15:21:39,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-10 15:21:39,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-10 15:21:39,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-10 15:21:39,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-10 15:21:39,518 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 29 treesize of output 13 [2024-11-10 15:21:39,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-10 15:21:39,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-10 15:21:39,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:39,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:41,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:41,317 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 25 treesize of output 26 [2024-11-10 15:21:41,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2024-11-10 15:21:41,331 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 24 [2024-11-10 15:21:41,337 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 42 treesize of output 34 [2024-11-10 15:21:41,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:41,396 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 25 treesize of output 26 [2024-11-10 15:21:41,401 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 140 treesize of output 122 [2024-11-10 15:21:41,409 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 20 [2024-11-10 15:21:41,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-10 15:21:41,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:41,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300314410] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:21:41,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:21:41,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 17] total 40 [2024-11-10 15:21:41,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336544228] [2024-11-10 15:21:41,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:41,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-10 15:21:41,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:41,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-10 15:21:41,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1420, Unknown=4, NotChecked=0, Total=1560 [2024-11-10 15:21:41,558 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand has 40 states, 40 states have (on average 1.8) internal successors, (72), 36 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:21:42,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:42,745 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2024-11-10 15:21:42,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 15:21:42,746 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.8) internal successors, (72), 36 states have internal predecessors, (72), 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 30 [2024-11-10 15:21:42,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:42,747 INFO L225 Difference]: With dead ends: 122 [2024-11-10 15:21:42,747 INFO L226 Difference]: Without dead ends: 122 [2024-11-10 15:21:42,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=203, Invalid=1863, Unknown=4, NotChecked=0, Total=2070 [2024-11-10 15:21:42,748 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 33 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:42,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1178 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 15:21:42,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-10 15:21:42,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-10 15:21:42,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 91 states have (on average 1.3626373626373627) internal successors, (124), 117 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:42,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2024-11-10 15:21:42,753 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 30 [2024-11-10 15:21:42,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:42,753 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2024-11-10 15:21:42,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.8) internal successors, (72), 36 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:21:42,754 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2024-11-10 15:21:42,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:21:42,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:42,754 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:42,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 15:21:42,958 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,SelfDestructingSolverStorable17 [2024-11-10 15:21:42,959 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:42,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:42,960 INFO L85 PathProgramCache]: Analyzing trace with hash -312203823, now seen corresponding path program 1 times [2024-11-10 15:21:42,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:42,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300434595] [2024-11-10 15:21:42,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:42,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:43,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:21:43,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:43,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300434595] [2024-11-10 15:21:43,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300434595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:43,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:43,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:21:43,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961642076] [2024-11-10 15:21:43,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:43,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:21:43,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:43,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:21:43,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:21:43,085 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:43,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:43,285 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2024-11-10 15:21:43,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:21:43,286 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-11-10 15:21:43,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:43,287 INFO L225 Difference]: With dead ends: 140 [2024-11-10 15:21:43,287 INFO L226 Difference]: Without dead ends: 140 [2024-11-10 15:21:43,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:21:43,287 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 60 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:43,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 289 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:43,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-10 15:21:43,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 135. [2024-11-10 15:21:43,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 105 states have (on average 1.3904761904761904) internal successors, (146), 130 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:43,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 152 transitions. [2024-11-10 15:21:43,291 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 152 transitions. Word has length 32 [2024-11-10 15:21:43,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:43,291 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 152 transitions. [2024-11-10 15:21:43,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:43,292 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 152 transitions. [2024-11-10 15:21:43,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:21:43,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:43,292 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:43,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 15:21:43,293 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:43,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:43,293 INFO L85 PathProgramCache]: Analyzing trace with hash -312203822, now seen corresponding path program 1 times [2024-11-10 15:21:43,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:43,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36861201] [2024-11-10 15:21:43,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:43,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:43,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:43,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:43,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36861201] [2024-11-10 15:21:43,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36861201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:43,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313192834] [2024-11-10 15:21:43,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:43,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:43,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:43,563 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:21:43,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 15:21:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:43,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-10 15:21:43,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:43,901 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:44,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:44,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-11-10 15:21:44,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:44,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313192834] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:44,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:21:44,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 10] total 20 [2024-11-10 15:21:44,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147817209] [2024-11-10 15:21:44,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:44,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:21:44,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:44,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:21:44,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-11-10 15:21:44,165 INFO L87 Difference]: Start difference. First operand 135 states and 152 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:44,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:44,364 INFO L93 Difference]: Finished difference Result 146 states and 170 transitions. [2024-11-10 15:21:44,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:21:44,365 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 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 32 [2024-11-10 15:21:44,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:44,366 INFO L225 Difference]: With dead ends: 146 [2024-11-10 15:21:44,366 INFO L226 Difference]: Without dead ends: 146 [2024-11-10 15:21:44,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2024-11-10 15:21:44,367 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 34 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:44,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 291 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:44,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-10 15:21:44,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 138. [2024-11-10 15:21:44,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 108 states have (on average 1.3888888888888888) internal successors, (150), 133 states have internal predecessors, (150), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:44,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 156 transitions. [2024-11-10 15:21:44,371 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 156 transitions. Word has length 32 [2024-11-10 15:21:44,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:44,372 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 156 transitions. [2024-11-10 15:21:44,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:44,372 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 156 transitions. [2024-11-10 15:21:44,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 15:21:44,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:44,373 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:44,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 15:21:44,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:44,574 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:44,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:44,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1088383909, now seen corresponding path program 1 times [2024-11-10 15:21:44,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:44,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338805898] [2024-11-10 15:21:44,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:44,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:44,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:44,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:44,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:44,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338805898] [2024-11-10 15:21:44,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338805898] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:44,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077465626] [2024-11-10 15:21:44,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:44,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:44,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:44,862 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:21:44,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 15:21:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:44,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-10 15:21:45,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:45,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:21:45,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-10 15:21:45,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:45,326 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:45,553 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 170 treesize of output 162 [2024-11-10 15:21:45,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:45,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077465626] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:45,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:21:45,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 12] total 27 [2024-11-10 15:21:45,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529165686] [2024-11-10 15:21:45,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:45,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:21:45,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:45,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:21:45,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2024-11-10 15:21:45,644 INFO L87 Difference]: Start difference. First operand 138 states and 156 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:45,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:45,864 INFO L93 Difference]: Finished difference Result 160 states and 186 transitions. [2024-11-10 15:21:45,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:21:45,865 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 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 33 [2024-11-10 15:21:45,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:45,866 INFO L225 Difference]: With dead ends: 160 [2024-11-10 15:21:45,866 INFO L226 Difference]: Without dead ends: 160 [2024-11-10 15:21:45,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2024-11-10 15:21:45,867 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 38 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:45,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 400 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:45,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-10 15:21:45,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 139. [2024-11-10 15:21:45,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 109 states have (on average 1.385321100917431) internal successors, (151), 134 states have internal predecessors, (151), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:45,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 157 transitions. [2024-11-10 15:21:45,870 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 157 transitions. Word has length 33 [2024-11-10 15:21:45,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:45,871 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 157 transitions. [2024-11-10 15:21:45,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:45,871 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 157 transitions. [2024-11-10 15:21:45,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-10 15:21:45,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:45,871 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:45,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 15:21:46,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:46,076 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:46,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:46,077 INFO L85 PathProgramCache]: Analyzing trace with hash 619848154, now seen corresponding path program 1 times [2024-11-10 15:21:46,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:46,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803555307] [2024-11-10 15:21:46,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:46,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:46,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:46,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:21:46,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:46,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803555307] [2024-11-10 15:21:46,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803555307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:46,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:46,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 15:21:46,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969678292] [2024-11-10 15:21:46,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:46,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:21:46,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:46,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:21:46,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:21:46,211 INFO L87 Difference]: Start difference. First operand 139 states and 157 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:46,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:46,357 INFO L93 Difference]: Finished difference Result 145 states and 161 transitions. [2024-11-10 15:21:46,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:21:46,358 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 8 states have internal predecessors, (31), 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 34 [2024-11-10 15:21:46,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:46,359 INFO L225 Difference]: With dead ends: 145 [2024-11-10 15:21:46,360 INFO L226 Difference]: Without dead ends: 145 [2024-11-10 15:21:46,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:21:46,361 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 47 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:46,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 514 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:46,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-10 15:21:46,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 138. [2024-11-10 15:21:46,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 108 states have (on average 1.3425925925925926) internal successors, (145), 133 states have internal predecessors, (145), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:46,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 151 transitions. [2024-11-10 15:21:46,367 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 151 transitions. Word has length 34 [2024-11-10 15:21:46,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:46,367 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 151 transitions. [2024-11-10 15:21:46,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:46,367 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 151 transitions. [2024-11-10 15:21:46,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-10 15:21:46,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:46,368 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:46,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 15:21:46,368 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:46,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:46,369 INFO L85 PathProgramCache]: Analyzing trace with hash 619837199, now seen corresponding path program 1 times [2024-11-10 15:21:46,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:46,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174468973] [2024-11-10 15:21:46,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:46,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:46,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:46,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:46,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:46,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174468973] [2024-11-10 15:21:46,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174468973] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:46,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733638777] [2024-11-10 15:21:46,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:46,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:46,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:46,695 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:21:46,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 15:21:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:46,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-10 15:21:46,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:46,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:21:46,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-10 15:21:46,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-10 15:21:46,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:21:46,950 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:21:46,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733638777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:46,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:21:46,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 10 [2024-11-10 15:21:46,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317913883] [2024-11-10 15:21:46,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:46,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:21:46,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:46,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:21:46,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:21:46,953 INFO L87 Difference]: Start difference. First operand 138 states and 151 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:47,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:47,208 INFO L93 Difference]: Finished difference Result 155 states and 173 transitions. [2024-11-10 15:21:47,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:21:47,208 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 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 34 [2024-11-10 15:21:47,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:47,209 INFO L225 Difference]: With dead ends: 155 [2024-11-10 15:21:47,209 INFO L226 Difference]: Without dead ends: 155 [2024-11-10 15:21:47,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:21:47,210 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 37 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:47,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 368 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:47,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-10 15:21:47,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 139. [2024-11-10 15:21:47,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 134 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 152 transitions. [2024-11-10 15:21:47,214 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 152 transitions. Word has length 34 [2024-11-10 15:21:47,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:47,215 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 152 transitions. [2024-11-10 15:21:47,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:47,215 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 152 transitions. [2024-11-10 15:21:47,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-10 15:21:47,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:47,216 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:47,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 15:21:47,419 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,SelfDestructingSolverStorable22 [2024-11-10 15:21:47,420 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:47,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:47,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2035083993, now seen corresponding path program 1 times [2024-11-10 15:21:47,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:47,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911197548] [2024-11-10 15:21:47,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:47,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:47,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:47,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:47,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:47,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911197548] [2024-11-10 15:21:47,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911197548] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:47,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332258716] [2024-11-10 15:21:47,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:47,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:47,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:47,788 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:21:47,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 15:21:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:47,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-10 15:21:47,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:48,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:21:48,090 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:21:48,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-10 15:21:48,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:21:48,209 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 29 treesize of output 13 [2024-11-10 15:21:48,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:48,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2024-11-10 15:21:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:21:48,411 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:21:48,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332258716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:48,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:21:48,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 22 [2024-11-10 15:21:48,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310374633] [2024-11-10 15:21:48,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:48,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 15:21:48,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:48,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 15:21:48,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-11-10 15:21:48,413 INFO L87 Difference]: Start difference. First operand 139 states and 152 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:48,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:48,731 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2024-11-10 15:21:48,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:21:48,732 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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 35 [2024-11-10 15:21:48,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:48,732 INFO L225 Difference]: With dead ends: 141 [2024-11-10 15:21:48,732 INFO L226 Difference]: Without dead ends: 141 [2024-11-10 15:21:48,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2024-11-10 15:21:48,733 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 19 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:48,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 577 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:21:48,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-10 15:21:48,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2024-11-10 15:21:48,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 110 states have (on average 1.3363636363636364) internal successors, (147), 135 states have internal predecessors, (147), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:48,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 153 transitions. [2024-11-10 15:21:48,738 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 153 transitions. Word has length 35 [2024-11-10 15:21:48,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:48,738 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 153 transitions. [2024-11-10 15:21:48,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:48,738 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 153 transitions. [2024-11-10 15:21:48,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 15:21:48,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:48,739 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:48,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-10 15:21:48,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:48,943 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:48,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:48,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1505597814, now seen corresponding path program 1 times [2024-11-10 15:21:48,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:48,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197432821] [2024-11-10 15:21:48,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:48,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:49,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:49,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:49,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:49,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197432821] [2024-11-10 15:21:49,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197432821] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:49,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507947378] [2024-11-10 15:21:49,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:49,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:49,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:49,340 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:21:49,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 15:21:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:49,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-10 15:21:49,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:49,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:21:49,519 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:21:49,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:21:49,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:21:49,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-10 15:21:49,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-10 15:21:49,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:21:49,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:21:49,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:21:49,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507947378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:49,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:21:49,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14] total 19 [2024-11-10 15:21:49,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715488376] [2024-11-10 15:21:49,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:49,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 15:21:49,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:49,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 15:21:49,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-11-10 15:21:49,692 INFO L87 Difference]: Start difference. First operand 140 states and 153 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:49,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:49,964 INFO L93 Difference]: Finished difference Result 154 states and 171 transitions. [2024-11-10 15:21:49,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:21:49,964 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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 37 [2024-11-10 15:21:49,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:49,965 INFO L225 Difference]: With dead ends: 154 [2024-11-10 15:21:49,965 INFO L226 Difference]: Without dead ends: 154 [2024-11-10 15:21:49,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-11-10 15:21:49,966 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 60 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:49,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 470 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:49,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-10 15:21:49,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 142. [2024-11-10 15:21:49,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 137 states have internal predecessors, (150), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:49,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 156 transitions. [2024-11-10 15:21:49,970 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 156 transitions. Word has length 37 [2024-11-10 15:21:49,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:49,970 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 156 transitions. [2024-11-10 15:21:49,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:49,970 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 156 transitions. [2024-11-10 15:21:49,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 15:21:49,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:49,971 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:49,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 15:21:50,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:50,172 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:50,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:50,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1505597815, now seen corresponding path program 1 times [2024-11-10 15:21:50,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:50,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885715524] [2024-11-10 15:21:50,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:50,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:50,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:50,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:50,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:50,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885715524] [2024-11-10 15:21:50,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885715524] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:50,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966145709] [2024-11-10 15:21:50,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:50,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:50,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:50,432 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:21:50,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 15:21:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:50,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 15:21:50,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:21:50,829 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:21:50,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966145709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:50,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:21:50,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2024-11-10 15:21:50,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493524653] [2024-11-10 15:21:50,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:50,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:21:50,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:50,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:21:50,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2024-11-10 15:21:50,832 INFO L87 Difference]: Start difference. First operand 142 states and 156 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:51,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:51,026 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2024-11-10 15:21:51,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:21:51,027 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 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 37 [2024-11-10 15:21:51,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:51,028 INFO L225 Difference]: With dead ends: 154 [2024-11-10 15:21:51,028 INFO L226 Difference]: Without dead ends: 154 [2024-11-10 15:21:51,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2024-11-10 15:21:51,029 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 25 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:51,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 614 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:51,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-10 15:21:51,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2024-11-10 15:21:51,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 121 states have (on average 1.3388429752066116) internal successors, (162), 146 states have internal predecessors, (162), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:51,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 168 transitions. [2024-11-10 15:21:51,032 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 168 transitions. Word has length 37 [2024-11-10 15:21:51,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:51,033 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 168 transitions. [2024-11-10 15:21:51,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:51,033 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 168 transitions. [2024-11-10 15:21:51,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 15:21:51,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:51,033 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:51,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-10 15:21:51,237 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,SelfDestructingSolverStorable25 [2024-11-10 15:21:51,237 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:51,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:51,238 INFO L85 PathProgramCache]: Analyzing trace with hash -571108020, now seen corresponding path program 1 times [2024-11-10 15:21:51,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:51,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612936339] [2024-11-10 15:21:51,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:51,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:51,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:51,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:21:51,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:51,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612936339] [2024-11-10 15:21:51,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612936339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:51,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:51,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 15:21:51,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881063093] [2024-11-10 15:21:51,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:51,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 15:21:51,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:51,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 15:21:51,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:21:51,563 INFO L87 Difference]: Start difference. First operand 151 states and 168 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:51,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:51,774 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2024-11-10 15:21:51,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:21:51,775 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 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 38 [2024-11-10 15:21:51,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:51,775 INFO L225 Difference]: With dead ends: 153 [2024-11-10 15:21:51,776 INFO L226 Difference]: Without dead ends: 153 [2024-11-10 15:21:51,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-10 15:21:51,776 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 24 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:51,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 685 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:51,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-10 15:21:51,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2024-11-10 15:21:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 121 states have (on average 1.3305785123966942) internal successors, (161), 146 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:51,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 167 transitions. [2024-11-10 15:21:51,780 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 167 transitions. Word has length 38 [2024-11-10 15:21:51,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:51,780 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 167 transitions. [2024-11-10 15:21:51,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:51,781 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 167 transitions. [2024-11-10 15:21:51,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 15:21:51,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:51,781 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:51,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 15:21:51,782 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:51,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:51,782 INFO L85 PathProgramCache]: Analyzing trace with hash -524479436, now seen corresponding path program 1 times [2024-11-10 15:21:51,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:51,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145697111] [2024-11-10 15:21:51,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:51,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:52,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:21:52,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:52,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145697111] [2024-11-10 15:21:52,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145697111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:52,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:52,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 15:21:52,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573520162] [2024-11-10 15:21:52,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:52,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 15:21:52,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:52,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 15:21:52,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:21:52,096 INFO L87 Difference]: Start difference. First operand 151 states and 167 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:52,357 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2024-11-10 15:21:52,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 15:21:52,357 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 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 39 [2024-11-10 15:21:52,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:52,358 INFO L225 Difference]: With dead ends: 152 [2024-11-10 15:21:52,358 INFO L226 Difference]: Without dead ends: 152 [2024-11-10 15:21:52,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-10 15:21:52,359 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 26 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:52,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 602 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:52,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-10 15:21:52,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2024-11-10 15:21:52,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 121 states have (on average 1.322314049586777) internal successors, (160), 146 states have internal predecessors, (160), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 166 transitions. [2024-11-10 15:21:52,363 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 166 transitions. Word has length 39 [2024-11-10 15:21:52,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:52,363 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 166 transitions. [2024-11-10 15:21:52,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:52,364 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 166 transitions. [2024-11-10 15:21:52,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 15:21:52,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:52,364 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:52,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 15:21:52,365 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:52,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:52,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2077202627, now seen corresponding path program 1 times [2024-11-10 15:21:52,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:52,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3000622] [2024-11-10 15:21:52,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:52,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:52,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:52,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:21:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:21:52,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:52,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3000622] [2024-11-10 15:21:52,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3000622] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:52,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021728275] [2024-11-10 15:21:52,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:52,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:52,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:52,628 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:21:52,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 15:21:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:52,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 15:21:52,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:53,008 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:21:53,008 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:53,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:53,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2024-11-10 15:21:53,247 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:21:53,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021728275] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:21:53,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:21:53,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2024-11-10 15:21:53,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848130968] [2024-11-10 15:21:53,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:53,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 15:21:53,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:53,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 15:21:53,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-11-10 15:21:53,249 INFO L87 Difference]: Start difference. First operand 151 states and 166 transitions. Second operand has 22 states, 21 states have (on average 4.428571428571429) internal successors, (93), 19 states have internal predecessors, (93), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-10 15:21:53,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:53,456 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2024-11-10 15:21:53,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 15:21:53,457 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.428571428571429) internal successors, (93), 19 states have internal predecessors, (93), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 40 [2024-11-10 15:21:53,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:53,458 INFO L225 Difference]: With dead ends: 155 [2024-11-10 15:21:53,458 INFO L226 Difference]: Without dead ends: 155 [2024-11-10 15:21:53,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2024-11-10 15:21:53,459 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 23 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:53,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 764 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:53,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-10 15:21:53,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 150. [2024-11-10 15:21:53,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 145 states have internal predecessors, (157), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:53,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2024-11-10 15:21:53,462 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 40 [2024-11-10 15:21:53,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:53,463 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2024-11-10 15:21:53,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.428571428571429) internal successors, (93), 19 states have internal predecessors, (93), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-10 15:21:53,463 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2024-11-10 15:21:53,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 15:21:53,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:53,464 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:53,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-10 15:21:53,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-10 15:21:53,668 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:53,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:53,668 INFO L85 PathProgramCache]: Analyzing trace with hash 921006666, now seen corresponding path program 1 times [2024-11-10 15:21:53,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:53,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754603039] [2024-11-10 15:21:53,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:53,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:54,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:54,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:54,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754603039] [2024-11-10 15:21:54,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754603039] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:54,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033210898] [2024-11-10 15:21:54,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:54,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:54,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:54,254 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:21:54,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-10 15:21:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:54,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-10 15:21:54,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:54,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:21:54,484 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 15:21:54,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-10 15:21:54,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:21:54,577 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 43 treesize of output 23 [2024-11-10 15:21:54,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 18 [2024-11-10 15:21:54,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:54,852 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 35 treesize of output 13 [2024-11-10 15:21:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:21:54,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:21:54,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033210898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:54,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:21:54,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 26 [2024-11-10 15:21:54,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950507151] [2024-11-10 15:21:54,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:54,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:21:54,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:54,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:21:54,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2024-11-10 15:21:54,859 INFO L87 Difference]: Start difference. First operand 150 states and 163 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:55,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:55,189 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2024-11-10 15:21:55,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:21:55,190 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 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 40 [2024-11-10 15:21:55,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:55,191 INFO L225 Difference]: With dead ends: 150 [2024-11-10 15:21:55,191 INFO L226 Difference]: Without dead ends: 150 [2024-11-10 15:21:55,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2024-11-10 15:21:55,192 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 19 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:55,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 430 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:55,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-10 15:21:55,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-10 15:21:55,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 121 states have (on average 1.2892561983471074) internal successors, (156), 145 states have internal predecessors, (156), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:55,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2024-11-10 15:21:55,196 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 40 [2024-11-10 15:21:55,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:55,196 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2024-11-10 15:21:55,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:55,197 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2024-11-10 15:21:55,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 15:21:55,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:55,197 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:55,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-10 15:21:55,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:55,402 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:55,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:55,402 INFO L85 PathProgramCache]: Analyzing trace with hash -31228007, now seen corresponding path program 1 times [2024-11-10 15:21:55,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:55,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098424013] [2024-11-10 15:21:55,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:55,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:55,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:55,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:21:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:21:55,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:55,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098424013] [2024-11-10 15:21:55,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098424013] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:55,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12625909] [2024-11-10 15:21:55,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:55,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:55,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:55,818 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:21:55,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-10 15:21:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:56,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-10 15:21:56,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:56,181 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:21:56,181 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 16 treesize of output 15 [2024-11-10 15:21:56,194 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:21:56,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:21:56,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:21:56,267 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 10 treesize of output 4 [2024-11-10 15:21:56,367 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:56,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:56,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12625909] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:56,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:21:56,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2024-11-10 15:21:56,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300163986] [2024-11-10 15:21:56,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:56,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-10 15:21:56,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:56,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-10 15:21:56,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=939, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 15:21:56,591 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 24 states have internal predecessors, (72), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:21:56,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:56,892 INFO L93 Difference]: Finished difference Result 155 states and 168 transitions. [2024-11-10 15:21:56,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 15:21:56,893 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 24 states have internal predecessors, (72), 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 41 [2024-11-10 15:21:56,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:56,893 INFO L225 Difference]: With dead ends: 155 [2024-11-10 15:21:56,893 INFO L226 Difference]: Without dead ends: 155 [2024-11-10 15:21:56,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=1180, Unknown=0, NotChecked=0, Total=1332 [2024-11-10 15:21:56,894 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 37 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:56,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 787 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:56,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-10 15:21:56,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2024-11-10 15:21:56,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 146 states have internal predecessors, (157), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:56,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2024-11-10 15:21:56,899 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 41 [2024-11-10 15:21:56,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:56,899 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2024-11-10 15:21:56,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.6666666666666665) internal successors, (72), 24 states have internal predecessors, (72), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:21:56,899 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2024-11-10 15:21:56,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 15:21:56,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:56,900 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:56,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-10 15:21:57,104 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,SelfDestructingSolverStorable30 [2024-11-10 15:21:57,105 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:57,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:57,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1997593436, now seen corresponding path program 1 times [2024-11-10 15:21:57,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:57,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983620448] [2024-11-10 15:21:57,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:57,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:57,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:57,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:21:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:57,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 15:21:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:21:57,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:57,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983620448] [2024-11-10 15:21:57,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983620448] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:57,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788178643] [2024-11-10 15:21:57,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:57,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:57,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:57,513 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:21:57,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-10 15:21:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:57,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 15:21:57,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:57,749 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:21:57,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:21:57,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:21:57,810 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:21:57,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 15:21:57,859 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:21:57,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 15:21:57,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 15:21:57,883 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-11-10 15:21:57,896 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:21:57,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-10 15:21:57,900 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-10 15:21:57,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:58,008 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2045 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (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_2045) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) 1)) is different from false [2024-11-10 15:21:58,020 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-10 15:21:58,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 33 treesize of output 32 [2024-11-10 15:21:58,026 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2045 (Array Int Int)) (v_ArrVal_2044 (Array Int Int))) (= (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2044))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2045)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) |c_ULTIMATE.start_create_#t~mem11#1.base|)) is different from false [2024-11-10 15:21:58,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:58,061 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-11-10 15:21:58,063 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-11-10 15:21:58,069 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 32 treesize of output 20 [2024-11-10 15:21:58,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:21:58,138 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:58,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788178643] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:21:58,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:21:58,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 14] total 28 [2024-11-10 15:21:58,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730484933] [2024-11-10 15:21:58,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:58,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-10 15:21:58,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:58,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-10 15:21:58,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=559, Unknown=13, NotChecked=150, Total=812 [2024-11-10 15:21:58,141 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 24 states have internal predecessors, (67), 3 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-10 15:21:58,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:58,564 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2024-11-10 15:21:58,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:21:58,564 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 24 states have internal predecessors, (67), 3 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 42 [2024-11-10 15:21:58,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:58,565 INFO L225 Difference]: With dead ends: 149 [2024-11-10 15:21:58,565 INFO L226 Difference]: Without dead ends: 149 [2024-11-10 15:21:58,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=849, Unknown=13, NotChecked=186, Total=1190 [2024-11-10 15:21:58,566 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 12 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:58,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 920 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 661 Invalid, 0 Unknown, 171 Unchecked, 0.3s Time] [2024-11-10 15:21:58,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-10 15:21:58,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-10 15:21:58,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 122 states have (on average 1.2704918032786885) internal successors, (155), 144 states have internal predecessors, (155), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2024-11-10 15:21:58,569 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 42 [2024-11-10 15:21:58,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:58,570 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2024-11-10 15:21:58,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.392857142857143) internal successors, (67), 24 states have internal predecessors, (67), 3 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-10 15:21:58,570 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2024-11-10 15:21:58,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 15:21:58,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:58,571 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:58,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-10 15:21:58,771 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,SelfDestructingSolverStorable31 [2024-11-10 15:21:58,771 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:21:58,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:58,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1997593437, now seen corresponding path program 1 times [2024-11-10 15:21:58,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:58,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608391136] [2024-11-10 15:21:58,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:58,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:59,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:59,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:21:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:59,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 15:21:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:21:59,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:59,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608391136] [2024-11-10 15:21:59,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608391136] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:59,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484433494] [2024-11-10 15:21:59,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:59,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:59,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:59,433 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:21:59,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-10 15:21:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:59,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-10 15:21:59,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:59,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:21:59,742 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:21:59,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:21:59,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 15:21:59,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:21:59,795 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:21:59,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-10 15:21:59,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:21:59,887 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:21:59,888 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-11-10 15:21:59,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:21:59,913 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-11-10 15:21:59,919 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-11-10 15:21:59,965 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-10 15:21:59,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:21:59,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:21:59,992 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:21:59,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:21:59,995 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-10 15:21:59,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:00,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484433494] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:00,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:22:00,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 22 [2024-11-10 15:22:00,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390580008] [2024-11-10 15:22:00,095 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:00,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-10 15:22:00,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:00,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-10 15:22:00,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=487, Unknown=1, NotChecked=44, Total=600 [2024-11-10 15:22:00,096 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 18 states have internal predecessors, (49), 3 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 15:22:00,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:00,728 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2024-11-10 15:22:00,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 15:22:00,729 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 18 states have internal predecessors, (49), 3 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2024-11-10 15:22:00,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:00,729 INFO L225 Difference]: With dead ends: 145 [2024-11-10 15:22:00,729 INFO L226 Difference]: Without dead ends: 145 [2024-11-10 15:22:00,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=1031, Unknown=1, NotChecked=66, Total=1260 [2024-11-10 15:22:00,730 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 22 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:00,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 783 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 616 Invalid, 0 Unknown, 95 Unchecked, 0.4s Time] [2024-11-10 15:22:00,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-10 15:22:00,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-10 15:22:00,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 122 states have (on average 1.2377049180327868) internal successors, (151), 140 states have internal predecessors, (151), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:22:00,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2024-11-10 15:22:00,734 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 42 [2024-11-10 15:22:00,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:00,734 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2024-11-10 15:22:00,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 18 states have internal predecessors, (49), 3 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 15:22:00,735 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2024-11-10 15:22:00,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-10 15:22:00,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:00,735 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:00,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-10 15:22:00,939 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,SelfDestructingSolverStorable32 [2024-11-10 15:22:00,940 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:22:00,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:00,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2031235932, now seen corresponding path program 1 times [2024-11-10 15:22:00,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:00,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106539878] [2024-11-10 15:22:00,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:00,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:01,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:01,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:22:01,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:01,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106539878] [2024-11-10 15:22:01,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106539878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:01,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:01,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 15:22:01,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174879692] [2024-11-10 15:22:01,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:01,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 15:22:01,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:01,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 15:22:01,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-11-10 15:22:01,343 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:22:01,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:01,661 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2024-11-10 15:22:01,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 15:22:01,661 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 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 44 [2024-11-10 15:22:01,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:01,662 INFO L225 Difference]: With dead ends: 145 [2024-11-10 15:22:01,662 INFO L226 Difference]: Without dead ends: 145 [2024-11-10 15:22:01,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-10 15:22:01,663 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 46 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:01,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 557 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:22:01,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-10 15:22:01,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-10 15:22:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 122 states have (on average 1.2295081967213115) internal successors, (150), 140 states have internal predecessors, (150), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:22:01,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 156 transitions. [2024-11-10 15:22:01,666 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 156 transitions. Word has length 44 [2024-11-10 15:22:01,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:01,667 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 156 transitions. [2024-11-10 15:22:01,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:22:01,667 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 156 transitions. [2024-11-10 15:22:01,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 15:22:01,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:01,668 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:01,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-10 15:22:01,668 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:22:01,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:01,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1188235126, now seen corresponding path program 1 times [2024-11-10 15:22:01,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:01,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52713932] [2024-11-10 15:22:01,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:01,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:02,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:02,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:22:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:02,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 15:22:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:02,352 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:22:02,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:02,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52713932] [2024-11-10 15:22:02,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52713932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:02,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773376506] [2024-11-10 15:22:02,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:02,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:02,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:02,354 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:02,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-10 15:22:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:02,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-10 15:22:02,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:02,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:22:02,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:22:02,757 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2024-11-10 15:22:02,758 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 44 treesize of output 45 [2024-11-10 15:22:02,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:02,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2024-11-10 15:22:02,782 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 7 treesize of output 3 [2024-11-10 15:22:02,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:02,821 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2024-11-10 15:22:02,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-10 15:22:02,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:22:03,052 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:22:03,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:22:03,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 15:22:03,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:22:03,212 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:22:03,212 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 88 treesize of output 79 [2024-11-10 15:22:03,219 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 43 treesize of output 13 [2024-11-10 15:22:03,296 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 44 treesize of output 20 [2024-11-10 15:22:03,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2024-11-10 15:22:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 15:22:03,332 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:03,438 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((v_ArrVal_2467 Int)) (or (< v_ArrVal_2467 |c_ULTIMATE.start_create_~data1~0#1.offset|) (forall ((v_ArrVal_2468 (Array Int Int)) (|ULTIMATE.start_create_#t~mem11#1.offset| Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| (store .cse0 |ULTIMATE.start_create_#t~mem11#1.offset| v_ArrVal_2467)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2468) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2467 Int)) (or (forall ((|ULTIMATE.start_create_#t~mem11#1.offset| Int)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| (store .cse0 |ULTIMATE.start_create_#t~mem11#1.offset| v_ArrVal_2467)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) 16))) (< v_ArrVal_2467 |c_ULTIMATE.start_create_~data1~0#1.offset|))))) is different from false [2024-11-10 15:22:03,458 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (let ((.cse1 (select |c_#memory_$Pointer$#0.offset| .cse0))) (and (forall ((v_ArrVal_2467 Int)) (or (< v_ArrVal_2467 |c_ULTIMATE.start_create_~data1~0#1.offset|) (forall ((|ULTIMATE.start_create_#t~mem11#1.offset| Int)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 (store .cse1 |ULTIMATE.start_create_#t~mem11#1.offset| v_ArrVal_2467)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) 16))))) (forall ((v_ArrVal_2467 Int)) (or (forall ((v_ArrVal_2468 (Array Int Int)) (|ULTIMATE.start_create_#t~mem11#1.offset| Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 (store .cse1 |ULTIMATE.start_create_#t~mem11#1.offset| v_ArrVal_2467)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2468) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2)))) (< v_ArrVal_2467 |c_ULTIMATE.start_create_~data1~0#1.offset|))))))) is different from false [2024-11-10 15:22:03,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:03,503 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 74 treesize of output 64 [2024-11-10 15:22:03,508 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 100 treesize of output 82 [2024-11-10 15:22:03,513 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 61 treesize of output 53 [2024-11-10 15:22:03,911 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2024-11-10 15:22:03,912 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 29 treesize of output 28 [2024-11-10 15:22:08,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:08,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:08,233 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 102 treesize of output 63 [2024-11-10 15:22:08,252 INFO L349 Elim1Store]: treesize reduction 24, result has 27.3 percent of original size [2024-11-10 15:22:08,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 884 treesize of output 782 [2024-11-10 15:22:08,265 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 126 treesize of output 110 [2024-11-10 15:22:08,274 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 68 treesize of output 44 [2024-11-10 15:22:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2024-11-10 15:22:08,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773376506] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:22:08,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:22:08,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 23] total 59 [2024-11-10 15:22:08,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688657776] [2024-11-10 15:22:08,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:08,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-11-10 15:22:08,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:08,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-11-10 15:22:08,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=3086, Unknown=4, NotChecked=226, Total=3540 [2024-11-10 15:22:08,566 INFO L87 Difference]: Start difference. First operand 145 states and 156 transitions. Second operand has 60 states, 59 states have (on average 1.8983050847457628) internal successors, (112), 49 states have internal predecessors, (112), 6 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-10 15:22:13,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:22:17,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:22:21,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:22:25,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:22:25,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:25,775 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2024-11-10 15:22:25,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 15:22:25,776 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.8983050847457628) internal successors, (112), 49 states have internal predecessors, (112), 6 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) Word has length 48 [2024-11-10 15:22:25,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:25,776 INFO L225 Difference]: With dead ends: 144 [2024-11-10 15:22:25,776 INFO L226 Difference]: Without dead ends: 144 [2024-11-10 15:22:25,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=481, Invalid=4779, Unknown=4, NotChecked=286, Total=5550 [2024-11-10 15:22:25,778 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 67 mSDsluCounter, 1439 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 21 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:25,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1506 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 734 Invalid, 4 Unknown, 104 Unchecked, 16.5s Time] [2024-11-10 15:22:25,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-10 15:22:25,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-10 15:22:25,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 122 states have (on average 1.221311475409836) internal successors, (149), 139 states have internal predecessors, (149), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:22:25,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2024-11-10 15:22:25,781 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 48 [2024-11-10 15:22:25,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:25,782 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2024-11-10 15:22:25,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 1.8983050847457628) internal successors, (112), 49 states have internal predecessors, (112), 6 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-10 15:22:25,782 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2024-11-10 15:22:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-10 15:22:25,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:25,783 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:25,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-10 15:22:25,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:25,984 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:22:25,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:25,984 INFO L85 PathProgramCache]: Analyzing trace with hash -755427857, now seen corresponding path program 1 times [2024-11-10 15:22:25,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:25,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095923626] [2024-11-10 15:22:25,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:25,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:26,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:26,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:22:26,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:26,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095923626] [2024-11-10 15:22:26,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095923626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:26,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:26,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:22:26,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655306408] [2024-11-10 15:22:26,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:26,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:22:26,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:26,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:22:26,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:22:26,173 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:22:26,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:26,400 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2024-11-10 15:22:26,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:22:26,401 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 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 47 [2024-11-10 15:22:26,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:26,401 INFO L225 Difference]: With dead ends: 149 [2024-11-10 15:22:26,402 INFO L226 Difference]: Without dead ends: 149 [2024-11-10 15:22:26,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:22:26,402 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 23 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:26,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 415 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:22:26,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-10 15:22:26,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2024-11-10 15:22:26,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 126 states have (on average 1.2380952380952381) internal successors, (156), 143 states have internal predecessors, (156), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:22:26,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2024-11-10 15:22:26,406 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 47 [2024-11-10 15:22:26,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:26,406 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2024-11-10 15:22:26,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:22:26,407 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2024-11-10 15:22:26,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 15:22:26,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:26,407 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:26,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-10 15:22:26,408 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:22:26,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:26,408 INFO L85 PathProgramCache]: Analyzing trace with hash 471066216, now seen corresponding path program 1 times [2024-11-10 15:22:26,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:26,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955910253] [2024-11-10 15:22:26,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:26,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:27,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:27,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:22:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:27,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:22:27,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:27,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955910253] [2024-11-10 15:22:27,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955910253] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:27,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175222483] [2024-11-10 15:22:27,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:27,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:27,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:27,194 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:27,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-10 15:22:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:27,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-10 15:22:27,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:27,635 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:22:27,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:22:27,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:22:27,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:22:27,735 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 19 treesize of output 7 [2024-11-10 15:22:27,802 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2024-11-10 15:22:27,803 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 55 treesize of output 33 [2024-11-10 15:22:27,912 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:22:27,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 15:22:28,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-10 15:22:28,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:22:28,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:28,474 INFO L349 Elim1Store]: treesize reduction 5, result has 87.2 percent of original size [2024-11-10 15:22:28,474 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 43 treesize of output 42 [2024-11-10 15:22:28,713 INFO L349 Elim1Store]: treesize reduction 19, result has 68.3 percent of original size [2024-11-10 15:22:28,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 100 [2024-11-10 15:22:28,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:28,742 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 398 treesize of output 385 [2024-11-10 15:22:28,762 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 172 treesize of output 152 [2024-11-10 15:22:28,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:28,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 161 [2024-11-10 15:22:29,032 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-10 15:22:29,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175222483] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:29,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:22:29,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2024-11-10 15:22:29,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356367532] [2024-11-10 15:22:29,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:29,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-10 15:22:29,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:29,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-10 15:22:29,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2080, Unknown=8, NotChecked=0, Total=2256 [2024-11-10 15:22:29,236 INFO L87 Difference]: Start difference. First operand 148 states and 162 transitions. Second operand has 38 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 32 states have internal predecessors, (82), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:22:30,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:30,041 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2024-11-10 15:22:30,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 15:22:30,041 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 32 states have internal predecessors, (82), 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 48 [2024-11-10 15:22:30,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:30,042 INFO L225 Difference]: With dead ends: 156 [2024-11-10 15:22:30,042 INFO L226 Difference]: Without dead ends: 156 [2024-11-10 15:22:30,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=266, Invalid=2918, Unknown=8, NotChecked=0, Total=3192 [2024-11-10 15:22:30,043 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 30 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:30,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1358 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 15:22:30,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-10 15:22:30,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2024-11-10 15:22:30,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 133 states have (on average 1.2406015037593985) internal successors, (165), 150 states have internal predecessors, (165), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:22:30,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 171 transitions. [2024-11-10 15:22:30,047 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 171 transitions. Word has length 48 [2024-11-10 15:22:30,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:30,047 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 171 transitions. [2024-11-10 15:22:30,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 32 states have internal predecessors, (82), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:22:30,047 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2024-11-10 15:22:30,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 15:22:30,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:30,047 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:30,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-10 15:22:30,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-10 15:22:30,248 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:22:30,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:30,249 INFO L85 PathProgramCache]: Analyzing trace with hash 471066217, now seen corresponding path program 1 times [2024-11-10 15:22:30,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:30,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308115242] [2024-11-10 15:22:30,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:30,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:31,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:31,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:22:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:31,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:22:31,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:31,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308115242] [2024-11-10 15:22:31,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308115242] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:31,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790716806] [2024-11-10 15:22:31,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:31,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:31,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:31,157 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:31,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-10 15:22:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:31,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-10 15:22:31,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:31,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:22:31,522 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:22:31,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:22:31,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:22:31,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 15:22:31,668 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:22:31,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:22:31,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:22:31,731 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:22:31,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:22:31,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:22:31,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 15:22:31,886 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-11-10 15:22:31,940 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:22:31,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:32,163 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8))) (and (forall ((v_ArrVal_2810 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2810) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0))) (forall ((v_ArrVal_2810 (Array Int Int)) (v_ArrVal_2809 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2810) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2809) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0)))))) is different from false [2024-11-10 15:22:32,171 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8))) (and (forall ((v_ArrVal_2810 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2810) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1))) (forall ((v_ArrVal_2810 (Array Int Int)) (v_ArrVal_2809 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2810) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2809) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)))))) is different from false [2024-11-10 15:22:32,185 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8)) (.cse0 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((v_ArrVal_2810 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2807 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2808) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2807) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) v_ArrVal_2810) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1))) (forall ((v_ArrVal_2810 (Array Int Int)) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2807 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2807))) (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~mem11#1.base| v_ArrVal_2808) .cse2 v_ArrVal_2810) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2809) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)))))))) is different from false [2024-11-10 15:22:32,197 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse2 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8)) (.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2810 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2807 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2808) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2807) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2810) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2))) (forall ((v_ArrVal_2810 (Array Int Int)) (v_ArrVal_2809 (Array Int Int)) (v_ArrVal_2808 (Array Int Int)) (v_ArrVal_2807 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2807))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2808) .cse3 v_ArrVal_2810) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) 8) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_2809) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2))))))))) is different from false [2024-11-10 15:22:32,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:32,211 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-11-10 15:22:32,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:32,220 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-11-10 15:22:32,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:32,236 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 400 treesize of output 345 [2024-11-10 15:22:32,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:32,267 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 584 treesize of output 553 [2024-11-10 15:22:32,280 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 218 treesize of output 202 [2024-11-10 15:22:32,287 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 202 treesize of output 186 [2024-11-10 15:22:32,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:32,305 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 186 treesize of output 158 [2024-11-10 15:22:32,314 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 78 treesize of output 70 [2024-11-10 15:22:32,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:32,472 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 44 treesize of output 45 [2024-11-10 15:22:32,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:32,480 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-11-10 15:22:32,483 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:22:32,486 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 34 treesize of output 22 [2024-11-10 15:22:32,488 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:22:32,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:32,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-10 15:22:32,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790716806] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:32,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:22:32,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 33 [2024-11-10 15:22:32,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424369815] [2024-11-10 15:22:32,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:32,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-10 15:22:32,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:32,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-10 15:22:32,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1499, Unknown=4, NotChecked=324, Total=1980 [2024-11-10 15:22:32,618 INFO L87 Difference]: Start difference. First operand 155 states and 171 transitions. Second operand has 34 states, 33 states have (on average 2.606060606060606) internal successors, (86), 29 states have internal predecessors, (86), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:22:33,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:33,419 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2024-11-10 15:22:33,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 15:22:33,419 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.606060606060606) internal successors, (86), 29 states have internal predecessors, (86), 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 48 [2024-11-10 15:22:33,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:33,420 INFO L225 Difference]: With dead ends: 160 [2024-11-10 15:22:33,421 INFO L226 Difference]: Without dead ends: 160 [2024-11-10 15:22:33,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=226, Invalid=2042, Unknown=4, NotChecked=380, Total=2652 [2024-11-10 15:22:33,422 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 18 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:33,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1516 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 15:22:33,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-10 15:22:33,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2024-11-10 15:22:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 134 states have (on average 1.2313432835820894) internal successors, (165), 151 states have internal predecessors, (165), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:22:33,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 171 transitions. [2024-11-10 15:22:33,425 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 171 transitions. Word has length 48 [2024-11-10 15:22:33,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:33,426 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 171 transitions. [2024-11-10 15:22:33,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.606060606060606) internal successors, (86), 29 states have internal predecessors, (86), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:22:33,426 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 171 transitions. [2024-11-10 15:22:33,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 15:22:33,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:33,427 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:33,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-10 15:22:33,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-10 15:22:33,627 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:22:33,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:33,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1723028637, now seen corresponding path program 1 times [2024-11-10 15:22:33,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:33,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963733779] [2024-11-10 15:22:33,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:33,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:33,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:33,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 15:22:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:22:33,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:33,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963733779] [2024-11-10 15:22:33,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963733779] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:33,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480465629] [2024-11-10 15:22:33,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:33,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:33,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:33,911 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:33,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-10 15:22:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:34,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-10 15:22:34,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:34,273 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:22:34,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:22:34,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:22:34,382 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:22:34,382 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 41 treesize of output 40 [2024-11-10 15:22:34,428 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:22:34,428 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 41 treesize of output 40 [2024-11-10 15:22:34,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2024-11-10 15:22:34,603 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:22:34,603 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:34,828 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2956 (Array Int Int)) (v_ArrVal_2955 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2955))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) v_ArrVal_2956)) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8)) 0))) is different from false [2024-11-10 15:22:34,834 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2956 (Array Int Int)) (v_ArrVal_2955 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2955))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2956))) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8)) 0))) is different from false [2024-11-10 15:22:34,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:34,841 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 45 treesize of output 36 [2024-11-10 15:22:34,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:34,850 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 167 treesize of output 142 [2024-11-10 15:22:34,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:34,860 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 90 treesize of output 79 [2024-11-10 15:22:34,864 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 70 treesize of output 62 [2024-11-10 15:22:35,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480465629] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:35,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:22:35,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 26 [2024-11-10 15:22:35,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948968663] [2024-11-10 15:22:35,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:35,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 15:22:35,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:35,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 15:22:35,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1013, Unknown=25, NotChecked=130, Total=1260 [2024-11-10 15:22:35,006 INFO L87 Difference]: Start difference. First operand 156 states and 171 transitions. Second operand has 26 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 22 states have internal predecessors, (86), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:22:35,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:35,843 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2024-11-10 15:22:35,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 15:22:35,844 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 22 states have internal predecessors, (86), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 50 [2024-11-10 15:22:35,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:35,845 INFO L225 Difference]: With dead ends: 166 [2024-11-10 15:22:35,845 INFO L226 Difference]: Without dead ends: 166 [2024-11-10 15:22:35,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=194, Invalid=2044, Unknown=26, NotChecked=186, Total=2450 [2024-11-10 15:22:35,846 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 52 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:35,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1141 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 15:22:35,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-10 15:22:35,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 152. [2024-11-10 15:22:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 132 states have (on average 1.1893939393939394) internal successors, (157), 147 states have internal predecessors, (157), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:22:35,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 163 transitions. [2024-11-10 15:22:35,850 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 163 transitions. Word has length 50 [2024-11-10 15:22:35,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:35,850 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 163 transitions. [2024-11-10 15:22:35,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 22 states have internal predecessors, (86), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:22:35,850 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 163 transitions. [2024-11-10 15:22:35,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 15:22:35,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:35,851 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:35,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-10 15:22:36,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-10 15:22:36,052 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:22:36,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:36,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1924500055, now seen corresponding path program 1 times [2024-11-10 15:22:36,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:36,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240550135] [2024-11-10 15:22:36,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:36,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:36,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:36,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:22:36,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:36,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240550135] [2024-11-10 15:22:36,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240550135] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:36,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905049097] [2024-11-10 15:22:36,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:36,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:36,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:36,807 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:36,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-10 15:22:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:37,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-10 15:22:37,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:37,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:22:37,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:22:37,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:22:37,108 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-10 15:22:37,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-10 15:22:37,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:22:37,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:22:37,196 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:22:37,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:22:37,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:22:37,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:22:37,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:22:37,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:22:37,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:22:37,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:22:37,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:37,592 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 2 case distinctions, treesize of input 25 treesize of output 27 [2024-11-10 15:22:37,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:37,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-11-10 15:22:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:22:37,692 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:38,191 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 16 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((|ULTIMATE.start_create_~data1~0#1.offset| Int) (|ULTIMATE.start_create_~data2~0#1.offset| Int) (v_ArrVal_3049 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~data2~0#1.base| v_ArrVal_3049))) (store .cse0 |c_ULTIMATE.start_create_~now~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |ULTIMATE.start_create_~data1~0#1.offset|) .cse1 |ULTIMATE.start_create_~data2~0#1.offset|))) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) 0)) (forall ((v_ArrVal_3050 (Array Int Int)) (v_ArrVal_3053 Int)) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~data2~0#1.base| v_ArrVal_3050))) (store .cse2 |c_ULTIMATE.start_create_~now~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| v_ArrVal_3053) .cse1 |c_ULTIMATE.start_create_~data2~0#1.base|))) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) 0)))) is different from false [2024-11-10 15:22:39,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:39,050 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 31 treesize of output 32 [2024-11-10 15:22:39,054 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 188 treesize of output 182 [2024-11-10 15:22:39,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:39,073 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 89 treesize of output 91 [2024-11-10 15:22:39,084 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 158 treesize of output 154 [2024-11-10 15:22:39,095 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 118 treesize of output 114 [2024-11-10 15:22:39,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:39,328 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 31 treesize of output 32 [2024-11-10 15:22:39,332 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 188 treesize of output 182 [2024-11-10 15:22:39,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:39,348 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 89 treesize of output 91 [2024-11-10 15:22:39,360 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 158 treesize of output 154 [2024-11-10 15:22:39,371 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 118 treesize of output 114 [2024-11-10 15:22:39,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:22:39,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905049097] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:22:39,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:22:39,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 20] total 46 [2024-11-10 15:22:39,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586904415] [2024-11-10 15:22:39,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:39,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-10 15:22:39,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:39,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-10 15:22:39,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1834, Unknown=5, NotChecked=86, Total=2070 [2024-11-10 15:22:39,729 INFO L87 Difference]: Start difference. First operand 152 states and 163 transitions. Second operand has 46 states, 46 states have (on average 2.8043478260869565) internal successors, (129), 43 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:22:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:40,800 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2024-11-10 15:22:40,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 15:22:40,801 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.8043478260869565) internal successors, (129), 43 states have internal predecessors, (129), 1 states have call successors, (2), 2 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 52 [2024-11-10 15:22:40,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:40,802 INFO L225 Difference]: With dead ends: 159 [2024-11-10 15:22:40,802 INFO L226 Difference]: Without dead ends: 159 [2024-11-10 15:22:40,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=239, Invalid=2622, Unknown=5, NotChecked=104, Total=2970 [2024-11-10 15:22:40,803 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 31 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:40,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1092 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 943 Invalid, 0 Unknown, 66 Unchecked, 0.7s Time] [2024-11-10 15:22:40,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-10 15:22:40,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-11-10 15:22:40,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 139 states have (on average 1.1798561151079137) internal successors, (164), 154 states have internal predecessors, (164), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:22:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 170 transitions. [2024-11-10 15:22:40,806 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 170 transitions. Word has length 52 [2024-11-10 15:22:40,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:40,807 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 170 transitions. [2024-11-10 15:22:40,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.8043478260869565) internal successors, (129), 43 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:22:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2024-11-10 15:22:40,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 15:22:40,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:40,808 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:40,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-10 15:22:41,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-10 15:22:41,009 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 41 more)] === [2024-11-10 15:22:41,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:41,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1686312607, now seen corresponding path program 1 times [2024-11-10 15:22:41,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:41,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124611753] [2024-11-10 15:22:41,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:41,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:42,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:42,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:22:42,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:42,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124611753] [2024-11-10 15:22:42,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124611753] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:42,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614478736] [2024-11-10 15:22:42,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:42,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:42,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:42,308 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:42,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-10 15:22:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:42,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-10 15:22:42,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:42,605 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2024-11-10 15:22:42,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 44 [2024-11-10 15:22:42,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:22:42,835 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 78 treesize of output 54 [2024-11-10 15:22:43,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:43,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:43,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 65