./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-middle-data.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f 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-data.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1f089d84611e193726b0906f7c8f41bdfbd2779029235be3e70f3cbcf8b5071e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:33:13,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:33:13,341 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-12 13:33:13,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:33:13,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:33:13,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:33:13,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:33:13,361 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:33:13,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:33:13,362 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:33:13,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:33:13,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:33:13,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:33:13,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:33:13,364 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:33:13,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:33:13,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:33:13,365 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:33:13,365 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:33:13,366 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:33:13,366 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:33:13,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:33:13,370 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:33:13,370 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:33:13,370 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:33:13,370 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:33:13,371 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:33:13,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:33:13,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:33:13,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:33:13,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:33:13,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:33:13,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:33:13,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:33:13,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:33:13,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:33:13,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:33:13,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:33:13,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:33:13,372 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 -> 1f089d84611e193726b0906f7c8f41bdfbd2779029235be3e70f3cbcf8b5071e [2024-11-12 13:33:13,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:33:13,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:33:13,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:33:13,619 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:33:13,620 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:33:13,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-middle-data.i [2024-11-12 13:33:14,931 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:33:15,148 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:33:15,151 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-middle-data.i [2024-11-12 13:33:15,167 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b16f1d3e8/c668afcad5284891a4fa35ba7705ecc6/FLAG7db322751 [2024-11-12 13:33:15,503 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b16f1d3e8/c668afcad5284891a4fa35ba7705ecc6 [2024-11-12 13:33:15,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:33:15,506 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:33:15,507 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:33:15,507 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:33:15,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:33:15,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:33:15" (1/1) ... [2024-11-12 13:33:15,518 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31478c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:15, skipping insertion in model container [2024-11-12 13:33:15,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:33:15" (1/1) ... [2024-11-12 13:33:15,562 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:33:15,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:33:15,816 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:33:15,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:33:15,877 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:33:15,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:15 WrapperNode [2024-11-12 13:33:15,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:33:15,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:33:15,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:33:15,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:33:15,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:15" (1/1) ... [2024-11-12 13:33:15,897 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:15" (1/1) ... [2024-11-12 13:33:15,915 INFO L138 Inliner]: procedures = 121, calls = 21, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 76 [2024-11-12 13:33:15,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:33:15,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:33:15,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:33:15,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:33:15,925 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:15" (1/1) ... [2024-11-12 13:33:15,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:15" (1/1) ... [2024-11-12 13:33:15,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:15" (1/1) ... [2024-11-12 13:33:15,944 INFO L175 MemorySlicer]: Split 11 memory accesses to 1 slices as follows [11]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 6 writes are split as follows [6]. [2024-11-12 13:33:15,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:15" (1/1) ... [2024-11-12 13:33:15,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:15" (1/1) ... [2024-11-12 13:33:15,952 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:15" (1/1) ... [2024-11-12 13:33:15,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:15" (1/1) ... [2024-11-12 13:33:15,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:15" (1/1) ... [2024-11-12 13:33:15,960 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:15" (1/1) ... [2024-11-12 13:33:15,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:33:15,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:33:15,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:33:15,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:33:15,964 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:15" (1/1) ... [2024-11-12 13:33:15,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:33:15,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:16,008 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-12 13:33:16,012 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-12 13:33:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 13:33:16,052 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-12 13:33:16,052 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-12 13:33:16,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 13:33:16,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 13:33:16,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 13:33:16,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:33:16,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:33:16,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:33:16,172 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:33:16,174 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:33:16,450 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2024-11-12 13:33:16,450 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:33:16,467 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:33:16,467 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-12 13:33:16,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:33:16 BoogieIcfgContainer [2024-11-12 13:33:16,468 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:33:16,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:33:16,471 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:33:16,474 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:33:16,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:33:15" (1/3) ... [2024-11-12 13:33:16,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d67cbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:33:16, skipping insertion in model container [2024-11-12 13:33:16,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:15" (2/3) ... [2024-11-12 13:33:16,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d67cbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:33:16, skipping insertion in model container [2024-11-12 13:33:16,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:33:16" (3/3) ... [2024-11-12 13:33:16,477 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-middle-data.i [2024-11-12 13:33:16,492 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:33:16,493 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-11-12 13:33:16,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:33:16,535 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;@23489015, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:33:16,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-12 13:33:16,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 67 states have internal predecessors, (73), 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-12 13:33:16,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 13:33:16,544 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:16,546 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 13:33:16,547 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:16,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:16,552 INFO L85 PathProgramCache]: Analyzing trace with hash 34510473, now seen corresponding path program 1 times [2024-11-12 13:33:16,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:16,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378423179] [2024-11-12 13:33:16,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:16,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:16,770 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-12 13:33:16,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:16,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378423179] [2024-11-12 13:33:16,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378423179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:16,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:16,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:33:16,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045311171] [2024-11-12 13:33:16,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:16,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:33:16,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:16,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:33:16,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:33:16,819 INFO L87 Difference]: Start difference. First operand has 71 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 67 states have internal predecessors, (73), 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-12 13:33:16,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:16,897 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2024-11-12 13:33:16,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:33:16,902 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-12 13:33:16,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:16,908 INFO L225 Difference]: With dead ends: 70 [2024-11-12 13:33:16,909 INFO L226 Difference]: Without dead ends: 68 [2024-11-12 13:33:16,911 INFO L434 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-12 13:33:16,915 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:16,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:16,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-12 13:33:16,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-12 13:33:16,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 40 states have (on average 1.675) internal successors, (67), 64 states have internal predecessors, (67), 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-12 13:33:16,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2024-11-12 13:33:16,951 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 5 [2024-11-12 13:33:16,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:16,951 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2024-11-12 13:33:16,951 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-12 13:33:16,951 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2024-11-12 13:33:16,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 13:33:16,952 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:16,952 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 13:33:16,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 13:33:16,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:16,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:16,953 INFO L85 PathProgramCache]: Analyzing trace with hash 34510474, now seen corresponding path program 1 times [2024-11-12 13:33:16,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:16,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034099713] [2024-11-12 13:33:16,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:16,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:17,045 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-12 13:33:17,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:17,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034099713] [2024-11-12 13:33:17,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034099713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:17,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:17,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:33:17,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608216152] [2024-11-12 13:33:17,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:17,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:33:17,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:17,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:33:17,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:33:17,047 INFO L87 Difference]: Start difference. First operand 68 states and 71 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-12 13:33:17,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:17,095 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2024-11-12 13:33:17,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:33:17,095 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-12 13:33:17,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:17,096 INFO L225 Difference]: With dead ends: 67 [2024-11-12 13:33:17,096 INFO L226 Difference]: Without dead ends: 67 [2024-11-12 13:33:17,096 INFO L434 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-12 13:33:17,097 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:17,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 115 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:33:17,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-12 13:33:17,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-12 13:33:17,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.65) internal successors, (66), 63 states have internal predecessors, (66), 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-12 13:33:17,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2024-11-12 13:33:17,106 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 5 [2024-11-12 13:33:17,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:17,107 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2024-11-12 13:33:17,107 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-12 13:33:17,107 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2024-11-12 13:33:17,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-12 13:33:17,108 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:17,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:17,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 13:33:17,109 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:17,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:17,109 INFO L85 PathProgramCache]: Analyzing trace with hash -168921788, now seen corresponding path program 1 times [2024-11-12 13:33:17,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:17,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452122129] [2024-11-12 13:33:17,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:17,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:17,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:17,261 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-12 13:33:17,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:17,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452122129] [2024-11-12 13:33:17,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452122129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:17,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:17,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:33:17,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486096147] [2024-11-12 13:33:17,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:17,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:33:17,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:17,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:33:17,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:33:17,265 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-12 13:33:17,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:17,429 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2024-11-12 13:33:17,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:33:17,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-12 13:33:17,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:17,436 INFO L225 Difference]: With dead ends: 67 [2024-11-12 13:33:17,437 INFO L226 Difference]: Without dead ends: 67 [2024-11-12 13:33:17,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:33:17,438 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 21 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:17,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 192 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:17,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-12 13:33:17,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2024-11-12 13:33:17,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.525) internal successors, (61), 58 states have internal predecessors, (61), 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-12 13:33:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2024-11-12 13:33:17,448 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 10 [2024-11-12 13:33:17,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:17,448 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2024-11-12 13:33:17,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-12 13:33:17,448 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2024-11-12 13:33:17,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-12 13:33:17,449 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:17,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:17,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 13:33:17,449 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:17,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:17,450 INFO L85 PathProgramCache]: Analyzing trace with hash -168921787, now seen corresponding path program 1 times [2024-11-12 13:33:17,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:17,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869328968] [2024-11-12 13:33:17,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:17,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:17,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:17,743 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-12 13:33:17,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:17,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869328968] [2024-11-12 13:33:17,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869328968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:17,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:17,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:33:17,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641332249] [2024-11-12 13:33:17,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:17,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:33:17,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:17,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:33:17,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:33:17,748 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-12 13:33:17,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:17,860 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2024-11-12 13:33:17,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:33:17,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-12 13:33:17,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:17,861 INFO L225 Difference]: With dead ends: 66 [2024-11-12 13:33:17,861 INFO L226 Difference]: Without dead ends: 66 [2024-11-12 13:33:17,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:33:17,862 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 8 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:17,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 227 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:17,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-12 13:33:17,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2024-11-12 13:33:17,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.5) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:33:17,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2024-11-12 13:33:17,867 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 10 [2024-11-12 13:33:17,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:17,867 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2024-11-12 13:33:17,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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-12 13:33:17,867 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2024-11-12 13:33:17,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 13:33:17,868 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:17,868 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:17,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 13:33:17,868 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:17,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:17,869 INFO L85 PathProgramCache]: Analyzing trace with hash 874918470, now seen corresponding path program 1 times [2024-11-12 13:33:17,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:17,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384718026] [2024-11-12 13:33:17,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:17,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:17,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:18,074 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-12 13:33:18,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:18,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384718026] [2024-11-12 13:33:18,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384718026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:18,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:18,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:33:18,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841919308] [2024-11-12 13:33:18,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:18,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:33:18,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:18,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:33:18,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:33:18,078 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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-12 13:33:18,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:18,171 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2024-11-12 13:33:18,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:33:18,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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-12 13:33:18,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:18,172 INFO L225 Difference]: With dead ends: 65 [2024-11-12 13:33:18,173 INFO L226 Difference]: Without dead ends: 65 [2024-11-12 13:33:18,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:33:18,174 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 6 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:18,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 227 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:18,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-12 13:33:18,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2024-11-12 13:33:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.475) internal successors, (59), 56 states have internal predecessors, (59), 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-12 13:33:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2024-11-12 13:33:18,183 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 12 [2024-11-12 13:33:18,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:18,184 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2024-11-12 13:33:18,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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-12 13:33:18,184 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2024-11-12 13:33:18,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 13:33:18,184 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:18,185 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:18,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 13:33:18,185 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:18,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:18,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1406976365, now seen corresponding path program 1 times [2024-11-12 13:33:18,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:18,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443292523] [2024-11-12 13:33:18,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:18,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:18,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:18,344 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-12 13:33:18,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:18,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443292523] [2024-11-12 13:33:18,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443292523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:18,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:18,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:33:18,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556228797] [2024-11-12 13:33:18,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:18,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:33:18,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:18,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:33:18,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:33:18,349 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:33:18,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:18,491 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2024-11-12 13:33:18,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:33:18,492 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-12 13:33:18,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:18,493 INFO L225 Difference]: With dead ends: 68 [2024-11-12 13:33:18,494 INFO L226 Difference]: Without dead ends: 68 [2024-11-12 13:33:18,494 INFO L434 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-12 13:33:18,495 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:18,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 255 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:18,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-12 13:33:18,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2024-11-12 13:33:18,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 63 states have internal predecessors, (69), 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-12 13:33:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2024-11-12 13:33:18,500 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 20 [2024-11-12 13:33:18,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:18,500 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2024-11-12 13:33:18,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:33:18,500 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2024-11-12 13:33:18,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 13:33:18,501 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:18,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:18,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 13:33:18,501 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:18,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:18,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1406976364, now seen corresponding path program 1 times [2024-11-12 13:33:18,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:18,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395009869] [2024-11-12 13:33:18,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:18,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:18,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:18,688 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-12 13:33:18,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:18,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395009869] [2024-11-12 13:33:18,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395009869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:18,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:18,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:33:18,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350232281] [2024-11-12 13:33:18,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:18,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:33:18,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:18,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:33:18,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:33:18,691 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:33:18,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:18,818 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2024-11-12 13:33:18,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:33:18,818 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-12 13:33:18,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:18,819 INFO L225 Difference]: With dead ends: 68 [2024-11-12 13:33:18,819 INFO L226 Difference]: Without dead ends: 68 [2024-11-12 13:33:18,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:33:18,821 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:18,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 270 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:18,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-12 13:33:18,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2024-11-12 13:33:18,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.446808510638298) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:33:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2024-11-12 13:33:18,827 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 20 [2024-11-12 13:33:18,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:18,829 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2024-11-12 13:33:18,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:33:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2024-11-12 13:33:18,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:33:18,829 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:18,830 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:18,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 13:33:18,830 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:18,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:18,831 INFO L85 PathProgramCache]: Analyzing trace with hash -666645695, now seen corresponding path program 1 times [2024-11-12 13:33:18,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:18,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56087640] [2024-11-12 13:33:18,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:18,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:18,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:18,981 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-12 13:33:18,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:18,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56087640] [2024-11-12 13:33:18,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56087640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:18,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:18,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:33:18,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307795730] [2024-11-12 13:33:18,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:18,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:33:18,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:18,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:33:18,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:33:18,983 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 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-12 13:33:19,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:19,065 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2024-11-12 13:33:19,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:33:19,065 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 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 21 [2024-11-12 13:33:19,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:19,066 INFO L225 Difference]: With dead ends: 70 [2024-11-12 13:33:19,066 INFO L226 Difference]: Without dead ends: 70 [2024-11-12 13:33:19,067 INFO L434 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-12 13:33:19,068 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 24 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:19,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 372 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:19,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-12 13:33:19,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-11-12 13:33:19,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:33:19,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2024-11-12 13:33:19,073 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 21 [2024-11-12 13:33:19,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:19,073 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2024-11-12 13:33:19,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 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-12 13:33:19,073 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2024-11-12 13:33:19,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:33:19,074 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:19,074 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:19,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 13:33:19,074 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:19,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:19,074 INFO L85 PathProgramCache]: Analyzing trace with hash 561056622, now seen corresponding path program 1 times [2024-11-12 13:33:19,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:19,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585390072] [2024-11-12 13:33:19,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:19,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:19,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:19,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:33:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:19,444 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-12 13:33:19,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:19,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585390072] [2024-11-12 13:33:19,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585390072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:19,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527526845] [2024-11-12 13:33:19,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:19,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:19,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:19,450 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-12 13:33:19,460 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-12 13:33:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:19,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 13:33:19,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:19,679 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-12 13:33:19,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:33:19,722 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-12 13:33:19,736 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:33:19,736 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-12 13:33:19,761 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-12 13:33:19,762 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:33:19,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527526845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:19,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:33:19,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2024-11-12 13:33:19,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421083502] [2024-11-12 13:33:19,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:19,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:33:19,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:19,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:33:19,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2024-11-12 13:33:19,763 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:33:19,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:19,844 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2024-11-12 13:33:19,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:33:19,845 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-11-12 13:33:19,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:19,845 INFO L225 Difference]: With dead ends: 84 [2024-11-12 13:33:19,845 INFO L226 Difference]: Without dead ends: 84 [2024-11-12 13:33:19,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2024-11-12 13:33:19,846 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 46 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:19,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 137 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 103 Unchecked, 0.1s Time] [2024-11-12 13:33:19,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-12 13:33:19,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2024-11-12 13:33:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.423728813559322) internal successors, (84), 75 states have internal predecessors, (84), 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-12 13:33:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2024-11-12 13:33:19,850 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 22 [2024-11-12 13:33:19,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:19,850 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2024-11-12 13:33:19,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-12 13:33:19,850 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2024-11-12 13:33:19,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:33:19,851 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:19,851 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:19,865 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-12 13:33:20,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:20,056 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:20,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:20,056 INFO L85 PathProgramCache]: Analyzing trace with hash 561056621, now seen corresponding path program 1 times [2024-11-12 13:33:20,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:20,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393417340] [2024-11-12 13:33:20,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:20,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:20,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:20,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:33:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:20,191 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-12 13:33:20,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:20,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393417340] [2024-11-12 13:33:20,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393417340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:20,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:20,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:33:20,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758733101] [2024-11-12 13:33:20,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:20,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:33:20,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:20,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:33:20,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:33:20,193 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:33:20,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:20,274 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2024-11-12 13:33:20,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:33:20,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-11-12 13:33:20,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:20,276 INFO L225 Difference]: With dead ends: 80 [2024-11-12 13:33:20,276 INFO L226 Difference]: Without dead ends: 80 [2024-11-12 13:33:20,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:33:20,279 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 16 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:20,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 134 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:20,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-12 13:33:20,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-12 13:33:20,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 75 states have internal predecessors, (83), 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-12 13:33:20,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2024-11-12 13:33:20,286 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 22 [2024-11-12 13:33:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:20,287 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2024-11-12 13:33:20,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:33:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2024-11-12 13:33:20,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 13:33:20,287 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:20,287 INFO L218 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] [2024-11-12 13:33:20,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 13:33:20,287 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:20,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:20,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1417695502, now seen corresponding path program 1 times [2024-11-12 13:33:20,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:20,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042877748] [2024-11-12 13:33:20,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:20,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:20,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:20,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:33:20,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:20,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042877748] [2024-11-12 13:33:20,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042877748] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:20,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959919285] [2024-11-12 13:33:20,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:20,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:20,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:20,756 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-12 13:33:20,757 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-12 13:33:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:20,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-12 13:33:20,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:20,847 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-12 13:33:20,853 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-12 13:33:20,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-12 13:33:20,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-12 13:33:21,012 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-12 13:33:21,021 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-12 13:33:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:33:21,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:21,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:33:21,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959919285] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:33:21,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:33:21,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 22 [2024-11-12 13:33:21,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773389876] [2024-11-12 13:33:21,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:21,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 13:33:21,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:21,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 13:33:21,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2024-11-12 13:33:21,358 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 19 states have internal predecessors, (42), 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-12 13:33:21,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:21,532 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2024-11-12 13:33:21,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:33:21,533 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 19 states have internal predecessors, (42), 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 24 [2024-11-12 13:33:21,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:21,533 INFO L225 Difference]: With dead ends: 82 [2024-11-12 13:33:21,533 INFO L226 Difference]: Without dead ends: 82 [2024-11-12 13:33:21,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2024-11-12 13:33:21,534 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 9 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:21,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 609 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:33:21,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-12 13:33:21,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-12 13:33:21,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 77 states have internal predecessors, (85), 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-12 13:33:21,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2024-11-12 13:33:21,537 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 24 [2024-11-12 13:33:21,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:21,537 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2024-11-12 13:33:21,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 19 states have internal predecessors, (42), 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-12 13:33:21,537 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2024-11-12 13:33:21,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 13:33:21,538 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:21,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:21,551 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-12 13:33:21,738 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,SelfDestructingSolverStorable10 [2024-11-12 13:33:21,739 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:21,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:21,740 INFO L85 PathProgramCache]: Analyzing trace with hash 998836262, now seen corresponding path program 1 times [2024-11-12 13:33:21,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:21,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134471478] [2024-11-12 13:33:21,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:21,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:21,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:21,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:21,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134471478] [2024-11-12 13:33:21,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134471478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:21,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:21,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:33:21,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941760883] [2024-11-12 13:33:21,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:21,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:33:21,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:21,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:33:21,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:33:21,864 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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-12 13:33:22,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:22,006 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2024-11-12 13:33:22,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:33:22,006 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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 25 [2024-11-12 13:33:22,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:22,007 INFO L225 Difference]: With dead ends: 84 [2024-11-12 13:33:22,007 INFO L226 Difference]: Without dead ends: 84 [2024-11-12 13:33:22,007 INFO L434 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-12 13:33:22,008 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:22,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 254 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:22,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-12 13:33:22,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-12 13:33:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.390625) internal successors, (89), 79 states have internal predecessors, (89), 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-12 13:33:22,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2024-11-12 13:33:22,011 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 25 [2024-11-12 13:33:22,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:22,011 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2024-11-12 13:33:22,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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-12 13:33:22,011 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2024-11-12 13:33:22,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-12 13:33:22,012 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:22,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:22,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 13:33:22,012 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:22,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:22,012 INFO L85 PathProgramCache]: Analyzing trace with hash 998836263, now seen corresponding path program 1 times [2024-11-12 13:33:22,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:22,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316316725] [2024-11-12 13:33:22,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:22,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:22,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:22,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:22,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316316725] [2024-11-12 13:33:22,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316316725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:22,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:22,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:33:22,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897132813] [2024-11-12 13:33:22,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:22,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:33:22,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:22,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:33:22,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:33:22,201 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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-12 13:33:22,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:22,355 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2024-11-12 13:33:22,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:33:22,356 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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 25 [2024-11-12 13:33:22,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:22,356 INFO L225 Difference]: With dead ends: 86 [2024-11-12 13:33:22,356 INFO L226 Difference]: Without dead ends: 86 [2024-11-12 13:33:22,356 INFO L434 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-12 13:33:22,357 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 3 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:22,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 273 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:22,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-12 13:33:22,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-12 13:33:22,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 81 states have internal predecessors, (90), 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-12 13:33:22,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2024-11-12 13:33:22,359 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 25 [2024-11-12 13:33:22,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:22,359 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2024-11-12 13:33:22,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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-12 13:33:22,360 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2024-11-12 13:33:22,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:33:22,360 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:22,360 INFO L218 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] [2024-11-12 13:33:22,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 13:33:22,360 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:22,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:22,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1577780753, now seen corresponding path program 1 times [2024-11-12 13:33:22,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:22,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011687581] [2024-11-12 13:33:22,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:22,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:22,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:22,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:33:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:22,459 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-12 13:33:22,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:22,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011687581] [2024-11-12 13:33:22,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011687581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:22,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:22,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:33:22,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546087935] [2024-11-12 13:33:22,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:22,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:33:22,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:22,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:33:22,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:33:22,462 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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-12 13:33:22,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:22,599 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2024-11-12 13:33:22,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:33:22,599 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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 26 [2024-11-12 13:33:22,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:22,600 INFO L225 Difference]: With dead ends: 85 [2024-11-12 13:33:22,600 INFO L226 Difference]: Without dead ends: 85 [2024-11-12 13:33:22,600 INFO L434 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-12 13:33:22,601 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 5 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:22,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 245 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:22,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-12 13:33:22,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-12 13:33:22,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 80 states have internal predecessors, (88), 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-12 13:33:22,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2024-11-12 13:33:22,604 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 26 [2024-11-12 13:33:22,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:22,605 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2024-11-12 13:33:22,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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-12 13:33:22,606 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2024-11-12 13:33:22,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:33:22,606 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:22,606 INFO L218 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] [2024-11-12 13:33:22,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 13:33:22,607 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:22,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:22,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1577780752, now seen corresponding path program 1 times [2024-11-12 13:33:22,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:22,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745985104] [2024-11-12 13:33:22,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:22,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:22,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:22,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:33:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:22,806 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-12 13:33:22,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:22,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745985104] [2024-11-12 13:33:22,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745985104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:22,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:22,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:33:22,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70257765] [2024-11-12 13:33:22,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:22,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:33:22,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:22,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:33:22,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:33:22,807 INFO L87 Difference]: Start difference. First operand 85 states and 94 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-12 13:33:22,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:22,908 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2024-11-12 13:33:22,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:33:22,908 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 26 [2024-11-12 13:33:22,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:22,908 INFO L225 Difference]: With dead ends: 84 [2024-11-12 13:33:22,909 INFO L226 Difference]: Without dead ends: 84 [2024-11-12 13:33:22,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:33:22,909 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 4 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:22,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 254 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:22,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-12 13:33:22,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-12 13:33:22,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 66 states have (on average 1.303030303030303) internal successors, (86), 79 states have internal predecessors, (86), 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-12 13:33:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2024-11-12 13:33:22,914 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 26 [2024-11-12 13:33:22,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:22,915 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2024-11-12 13:33:22,915 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-12 13:33:22,915 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2024-11-12 13:33:22,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:33:22,915 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:22,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:22,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 13:33:22,915 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:22,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:22,916 INFO L85 PathProgramCache]: Analyzing trace with hash 899151603, now seen corresponding path program 1 times [2024-11-12 13:33:22,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:22,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100670156] [2024-11-12 13:33:22,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:22,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:22,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:23,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:23,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:23,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100670156] [2024-11-12 13:33:23,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100670156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:23,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:23,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 13:33:23,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913988032] [2024-11-12 13:33:23,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:23,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:33:23,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:23,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:33:23,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:33:23,007 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 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-12 13:33:23,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:23,096 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2024-11-12 13:33:23,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:33:23,097 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 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 26 [2024-11-12 13:33:23,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:23,097 INFO L225 Difference]: With dead ends: 91 [2024-11-12 13:33:23,097 INFO L226 Difference]: Without dead ends: 91 [2024-11-12 13:33:23,098 INFO L434 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-12 13:33:23,098 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 28 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:23,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 371 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:23,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-12 13:33:23,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2024-11-12 13:33:23,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 80 states have internal predecessors, (86), 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-12 13:33:23,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2024-11-12 13:33:23,101 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 26 [2024-11-12 13:33:23,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:23,101 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2024-11-12 13:33:23,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 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-12 13:33:23,101 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2024-11-12 13:33:23,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 13:33:23,102 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:23,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:23,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 13:33:23,103 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:23,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:23,103 INFO L85 PathProgramCache]: Analyzing trace with hash 797715191, now seen corresponding path program 1 times [2024-11-12 13:33:23,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:23,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36569534] [2024-11-12 13:33:23,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:23,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:23,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:23,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:23,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36569534] [2024-11-12 13:33:23,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36569534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:23,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:23,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:33:23,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333672537] [2024-11-12 13:33:23,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:23,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:33:23,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:23,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:33:23,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:33:23,264 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:33:23,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:23,377 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2024-11-12 13:33:23,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:33:23,377 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-12 13:33:23,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:23,378 INFO L225 Difference]: With dead ends: 90 [2024-11-12 13:33:23,378 INFO L226 Difference]: Without dead ends: 90 [2024-11-12 13:33:23,378 INFO L434 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-12 13:33:23,378 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:23,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 345 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:23,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-12 13:33:23,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-11-12 13:33:23,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 84 states have internal predecessors, (93), 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-12 13:33:23,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2024-11-12 13:33:23,381 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 28 [2024-11-12 13:33:23,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:23,381 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2024-11-12 13:33:23,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:33:23,381 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2024-11-12 13:33:23,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-12 13:33:23,381 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:23,381 INFO L218 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-12 13:33:23,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 13:33:23,382 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:23,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:23,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1241356658, now seen corresponding path program 1 times [2024-11-12 13:33:23,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:23,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022738297] [2024-11-12 13:33:23,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:23,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:23,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:23,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:33:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:23,734 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:23,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:23,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022738297] [2024-11-12 13:33:23,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022738297] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:23,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562719246] [2024-11-12 13:33:23,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:23,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:23,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:23,748 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-12 13:33:23,749 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-12 13:33:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:23,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-12 13:33:23,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:23,876 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-12 13:33:23,935 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:33:23,936 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-12 13:33:23,963 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-12 13:33:23,966 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-12 13:33:24,050 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 13:33:24,050 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-12 13:33:24,055 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-12 13:33:24,070 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-12 13:33:24,074 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-12 13:33:24,094 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-12 13:33:24,094 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:33:24,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562719246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:24,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:33:24,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2024-11-12 13:33:24,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145604042] [2024-11-12 13:33:24,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:24,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:33:24,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:24,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:33:24,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2024-11-12 13:33:24,095 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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-12 13:33:24,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:24,258 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2024-11-12 13:33:24,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:33:24,259 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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 30 [2024-11-12 13:33:24,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:24,259 INFO L225 Difference]: With dead ends: 90 [2024-11-12 13:33:24,259 INFO L226 Difference]: Without dead ends: 90 [2024-11-12 13:33:24,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2024-11-12 13:33:24,260 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 25 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:24,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 268 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:24,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-12 13:33:24,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-11-12 13:33:24,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 71 states have (on average 1.295774647887324) internal successors, (92), 84 states have internal predecessors, (92), 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-12 13:33:24,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2024-11-12 13:33:24,263 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 30 [2024-11-12 13:33:24,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:24,263 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2024-11-12 13:33:24,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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-12 13:33:24,263 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2024-11-12 13:33:24,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-12 13:33:24,263 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:24,263 INFO L218 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-12 13:33:24,281 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-12 13:33:24,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-12 13:33:24,464 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:24,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:24,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1241356657, now seen corresponding path program 1 times [2024-11-12 13:33:24,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:24,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696141928] [2024-11-12 13:33:24,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:24,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:24,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:24,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:33:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:24,717 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-12 13:33:24,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:24,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696141928] [2024-11-12 13:33:24,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696141928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:24,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:24,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 13:33:24,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990373198] [2024-11-12 13:33:24,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:24,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 13:33:24,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:24,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 13:33:24,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-12 13:33:24,718 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 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-12 13:33:24,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:24,883 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2024-11-12 13:33:24,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:33:24,884 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 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-12 13:33:24,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:24,884 INFO L225 Difference]: With dead ends: 89 [2024-11-12 13:33:24,884 INFO L226 Difference]: Without dead ends: 89 [2024-11-12 13:33:24,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-11-12 13:33:24,885 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 28 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:24,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 340 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:24,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-12 13:33:24,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-12 13:33:24,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 84 states have internal predecessors, (91), 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-12 13:33:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2024-11-12 13:33:24,887 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 30 [2024-11-12 13:33:24,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:24,887 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2024-11-12 13:33:24,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 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-12 13:33:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2024-11-12 13:33:24,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-12 13:33:24,887 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:24,887 INFO L218 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] [2024-11-12 13:33:24,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 13:33:24,887 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:24,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:24,888 INFO L85 PathProgramCache]: Analyzing trace with hash 679332107, now seen corresponding path program 1 times [2024-11-12 13:33:24,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:24,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079561392] [2024-11-12 13:33:24,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:24,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:25,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:25,203 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-12 13:33:25,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:25,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079561392] [2024-11-12 13:33:25,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079561392] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:25,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049540340] [2024-11-12 13:33:25,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:25,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:25,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:25,205 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-12 13:33:25,207 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-12 13:33:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:25,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-12 13:33:25,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:25,303 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-12 13:33:25,306 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-12 13:33:25,418 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-12 13:33:25,422 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-12 13:33:25,435 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-12 13:33:25,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 13:33:25,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:25,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-11-12 13:33:25,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:25,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-11-12 13:33:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:25,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:26,033 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 20 treesize of output 18 [2024-11-12 13:33:26,036 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 214 [2024-11-12 13:33:26,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:26,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049540340] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:33:26,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:33:26,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 32 [2024-11-12 13:33:26,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373254229] [2024-11-12 13:33:26,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:26,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-12 13:33:26,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:26,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-12 13:33:26,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=913, Unknown=0, NotChecked=0, Total=992 [2024-11-12 13:33:26,048 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 32 states, 32 states have (on average 1.84375) internal successors, (59), 28 states have internal predecessors, (59), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:33:26,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:26,608 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2024-11-12 13:33:26,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-12 13:33:26,608 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.84375) internal successors, (59), 28 states have internal predecessors, (59), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2024-11-12 13:33:26,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:26,609 INFO L225 Difference]: With dead ends: 103 [2024-11-12 13:33:26,609 INFO L226 Difference]: Without dead ends: 103 [2024-11-12 13:33:26,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=1436, Unknown=0, NotChecked=0, Total=1560 [2024-11-12 13:33:26,610 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 41 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:26,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 677 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:33:26,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-12 13:33:26,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2024-11-12 13:33:26,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.308641975308642) internal successors, (106), 94 states have internal predecessors, (106), 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-12 13:33:26,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2024-11-12 13:33:26,614 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 31 [2024-11-12 13:33:26,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:26,615 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2024-11-12 13:33:26,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.84375) internal successors, (59), 28 states have internal predecessors, (59), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 13:33:26,615 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2024-11-12 13:33:26,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-12 13:33:26,615 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:26,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:26,630 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-12 13:33:26,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:26,816 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:26,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:26,817 INFO L85 PathProgramCache]: Analyzing trace with hash -415542610, now seen corresponding path program 1 times [2024-11-12 13:33:26,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:26,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938770104] [2024-11-12 13:33:26,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:26,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:26,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:26,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:26,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:26,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938770104] [2024-11-12 13:33:26,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938770104] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:26,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413314531] [2024-11-12 13:33:26,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:26,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:26,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:26,986 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-12 13:33:26,987 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-12 13:33:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:27,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 13:33:27,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:27,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-12 13:33:27,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:27,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:27,197 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_#t~ret4#1.base_18| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_18|) 0)) (= (store |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_18| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2024-11-12 13:33:27,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413314531] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:27,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:33:27,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 12 [2024-11-12 13:33:27,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321322094] [2024-11-12 13:33:27,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:27,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 13:33:27,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:27,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 13:33:27,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=132, Unknown=1, NotChecked=22, Total=182 [2024-11-12 13:33:27,200 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:33:27,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:27,360 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2024-11-12 13:33:27,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:33:27,361 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-11-12 13:33:27,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:27,361 INFO L225 Difference]: With dead ends: 106 [2024-11-12 13:33:27,361 INFO L226 Difference]: Without dead ends: 89 [2024-11-12 13:33:27,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=132, Unknown=1, NotChecked=22, Total=182 [2024-11-12 13:33:27,362 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:27,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 327 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:33:27,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-12 13:33:27,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-12 13:33:27,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 84 states have internal predecessors, (95), 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-12 13:33:27,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2024-11-12 13:33:27,364 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 32 [2024-11-12 13:33:27,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:27,365 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2024-11-12 13:33:27,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:33:27,365 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2024-11-12 13:33:27,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-12 13:33:27,365 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:27,365 INFO L218 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-12 13:33:27,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-12 13:33:27,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:27,569 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:27,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:27,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1376283299, now seen corresponding path program 1 times [2024-11-12 13:33:27,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:27,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669123235] [2024-11-12 13:33:27,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:27,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:27,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:27,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:33:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 13:33:27,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:27,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669123235] [2024-11-12 13:33:27,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669123235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:27,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152596138] [2024-11-12 13:33:27,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:27,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:27,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:27,670 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-12 13:33:27,671 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-12 13:33:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:27,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-12 13:33:27,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 13:33:27,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:27,849 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-12 13:33:27,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2024-11-12 13:33:27,876 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 13:33:27,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152596138] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:33:27,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:33:27,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2024-11-12 13:33:27,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264413583] [2024-11-12 13:33:27,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:27,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:33:27,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:27,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:33:27,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:33:27,878 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:33:27,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:27,974 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2024-11-12 13:33:27,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:33:27,974 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2024-11-12 13:33:27,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:27,975 INFO L225 Difference]: With dead ends: 98 [2024-11-12 13:33:27,975 INFO L226 Difference]: Without dead ends: 98 [2024-11-12 13:33:27,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 82 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-12 13:33:27,976 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:27,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 235 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:27,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-12 13:33:27,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-12 13:33:27,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 92 states have internal predecessors, (105), 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-12 13:33:27,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2024-11-12 13:33:27,979 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 40 [2024-11-12 13:33:27,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:27,979 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2024-11-12 13:33:27,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:33:27,979 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2024-11-12 13:33:27,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-12 13:33:27,980 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:27,980 INFO L218 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-12 13:33:27,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-12 13:33:28,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:28,181 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:28,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:28,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1376283298, now seen corresponding path program 1 times [2024-11-12 13:33:28,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:28,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069140851] [2024-11-12 13:33:28,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:28,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:28,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:28,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:33:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:28,378 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-12 13:33:28,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:28,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069140851] [2024-11-12 13:33:28,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069140851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:28,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860693978] [2024-11-12 13:33:28,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:28,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:28,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:28,380 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-12 13:33:28,382 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-12 13:33:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:28,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-12 13:33:28,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:28,656 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-12 13:33:28,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:28,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:28,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-11-12 13:33:28,881 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-12 13:33:28,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860693978] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:33:28,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:33:28,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2024-11-12 13:33:28,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072249157] [2024-11-12 13:33:28,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:28,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-12 13:33:28,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:28,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-12 13:33:28,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2024-11-12 13:33:28,883 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand has 25 states, 24 states have (on average 4.041666666666667) internal successors, (97), 21 states have internal predecessors, (97), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:33:29,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:29,055 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2024-11-12 13:33:29,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:33:29,056 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.041666666666667) internal successors, (97), 21 states have internal predecessors, (97), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2024-11-12 13:33:29,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:29,056 INFO L225 Difference]: With dead ends: 98 [2024-11-12 13:33:29,056 INFO L226 Difference]: Without dead ends: 98 [2024-11-12 13:33:29,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2024-11-12 13:33:29,057 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:29,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 517 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:33:29,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-12 13:33:29,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-12 13:33:29,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 92 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:33:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2024-11-12 13:33:29,060 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 40 [2024-11-12 13:33:29,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:29,060 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2024-11-12 13:33:29,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.041666666666667) internal successors, (97), 21 states have internal predecessors, (97), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:33:29,061 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2024-11-12 13:33:29,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-12 13:33:29,061 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:29,061 INFO L218 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-12 13:33:29,074 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-12 13:33:29,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:29,266 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:29,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:29,266 INFO L85 PathProgramCache]: Analyzing trace with hash -7678024, now seen corresponding path program 1 times [2024-11-12 13:33:29,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:29,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372686988] [2024-11-12 13:33:29,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:29,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:29,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:29,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:33:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:29,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 13:33:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:33:29,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:29,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372686988] [2024-11-12 13:33:29,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372686988] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:29,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729840839] [2024-11-12 13:33:29,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:29,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:29,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:29,920 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-12 13:33:29,921 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-12 13:33:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:30,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-12 13:33:30,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:30,072 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-12 13:33:30,132 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:33:30,132 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-12 13:33:30,159 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-12 13:33:30,163 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-12 13:33:30,246 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 13:33:30,247 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-12 13:33:30,252 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-12 13:33:30,317 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 13:33:30,318 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-12 13:33:30,326 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-12 13:33:30,337 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-12 13:33:30,339 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-12 13:33:30,420 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (= |c_#length| (store |c_old(#length)| alloc_and_zero_~pi~0.base 16))) is different from true [2024-11-12 13:33:30,435 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-12 13:33:30,435 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-12 13:33:30,466 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-12 13:33:30,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:30,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729840839] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:30,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:33:30,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 30 [2024-11-12 13:33:30,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795006740] [2024-11-12 13:33:30,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:30,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-12 13:33:30,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:30,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-12 13:33:30,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=907, Unknown=1, NotChecked=60, Total=1056 [2024-11-12 13:33:30,541 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 24 states have internal predecessors, (65), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:33:31,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:31,088 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2024-11-12 13:33:31,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 13:33:31,088 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 24 states have internal predecessors, (65), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 42 [2024-11-12 13:33:31,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:31,088 INFO L225 Difference]: With dead ends: 92 [2024-11-12 13:33:31,088 INFO L226 Difference]: Without dead ends: 92 [2024-11-12 13:33:31,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=198, Invalid=1697, Unknown=1, NotChecked=84, Total=1980 [2024-11-12 13:33:31,089 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 52 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:31,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 791 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 702 Invalid, 0 Unknown, 66 Unchecked, 0.3s Time] [2024-11-12 13:33:31,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-12 13:33:31,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-12 13:33:31,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 87 states have internal predecessors, (99), 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-12 13:33:31,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2024-11-12 13:33:31,093 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 42 [2024-11-12 13:33:31,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:31,093 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2024-11-12 13:33:31,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 24 states have internal predecessors, (65), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:33:31,093 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2024-11-12 13:33:31,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-12 13:33:31,093 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:31,093 INFO L218 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-12 13:33:31,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-12 13:33:31,297 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,SelfDestructingSolverStorable23 [2024-11-12 13:33:31,298 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:31,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:31,298 INFO L85 PathProgramCache]: Analyzing trace with hash -7678025, now seen corresponding path program 1 times [2024-11-12 13:33:31,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:31,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402116159] [2024-11-12 13:33:31,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:31,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:31,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:31,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:33:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:31,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 13:33:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:31,702 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 13:33:31,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:31,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402116159] [2024-11-12 13:33:31,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402116159] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:31,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913541707] [2024-11-12 13:33:31,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:31,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:31,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:31,705 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-12 13:33:31,705 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-12 13:33:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:31,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-12 13:33:31,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:31,882 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:33:31,882 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-12 13:33:31,898 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-12 13:33:31,956 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 13:33:31,956 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-12 13:33:32,002 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 13:33:32,003 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-12 13:33:32,011 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-12 13:33:32,022 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-12 13:33:32,036 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-12 13:33:32,036 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-12 13:33:32,045 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-12 13:33:32,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:32,153 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) v_ArrVal_1300) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) 1)) is different from false [2024-11-12 13:33:32,163 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-12 13:33:32,163 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-12 13:33:32,169 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~mem9#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1299))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_1300)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)))) is different from false [2024-11-12 13:33:32,184 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1299))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_1300)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))))) is different from false [2024-11-12 13:33:32,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:32,190 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-12 13:33:32,196 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-12 13:33:32,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-12 13:33:32,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-11-12 13:33:32,278 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-12 13:33:32,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913541707] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:33:32,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:33:32,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 14] total 31 [2024-11-12 13:33:32,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167866006] [2024-11-12 13:33:32,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:32,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-12 13:33:32,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:32,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-12 13:33:32,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=16, NotChecked=220, Total=992 [2024-11-12 13:33:32,280 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 26 states have internal predecessors, (78), 3 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-12 13:33:32,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:32,546 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2024-11-12 13:33:32,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:33:32,546 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 26 states have internal predecessors, (78), 3 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 42 [2024-11-12 13:33:32,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:32,547 INFO L225 Difference]: With dead ends: 91 [2024-11-12 13:33:32,547 INFO L226 Difference]: Without dead ends: 91 [2024-11-12 13:33:32,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=978, Unknown=16, NotChecked=268, Total=1406 [2024-11-12 13:33:32,548 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:32,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 574 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 381 Invalid, 0 Unknown, 144 Unchecked, 0.1s Time] [2024-11-12 13:33:32,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-12 13:33:32,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-12 13:33:32,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.240506329113924) internal successors, (98), 86 states have internal predecessors, (98), 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-12 13:33:32,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2024-11-12 13:33:32,550 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 42 [2024-11-12 13:33:32,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:32,550 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2024-11-12 13:33:32,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 26 states have internal predecessors, (78), 3 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-12 13:33:32,550 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2024-11-12 13:33:32,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-12 13:33:32,550 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:32,550 INFO L218 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] [2024-11-12 13:33:32,565 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-12 13:33:32,754 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,SelfDestructingSolverStorable24 [2024-11-12 13:33:32,754 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:32,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:32,755 INFO L85 PathProgramCache]: Analyzing trace with hash 324547288, now seen corresponding path program 1 times [2024-11-12 13:33:32,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:32,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212553366] [2024-11-12 13:33:32,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:32,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:33,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:33,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:33:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:33,322 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-12 13:33:33,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:33,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212553366] [2024-11-12 13:33:33,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212553366] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:33,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968567678] [2024-11-12 13:33:33,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:33,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:33,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:33,324 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-12 13:33:33,326 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-12 13:33:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:33,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-12 13:33:33,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:33,575 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-12 13:33:33,575 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-12 13:33:33,615 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-12 13:33:33,713 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 13:33:33,713 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-12 13:33:33,768 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 13:33:33,768 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-12 13:33:33,867 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-12 13:33:33,936 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-12 13:33:33,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:34,007 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1414 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1414) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))) 1)) is different from false [2024-11-12 13:33:34,053 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1413 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1413))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)) v_ArrVal_1414)) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))) 1)) is different from false [2024-11-12 13:33:34,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:34,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 37 [2024-11-12 13:33:34,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:34,113 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 170 treesize of output 145 [2024-11-12 13:33:34,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:34,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 94 treesize of output 82 [2024-11-12 13:33:34,131 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 74 treesize of output 66 [2024-11-12 13:33:35,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968567678] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:35,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:33:35,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 34 [2024-11-12 13:33:35,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912689839] [2024-11-12 13:33:35,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:35,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-12 13:33:35,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:35,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-12 13:33:35,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1555, Unknown=26, NotChecked=162, Total=1892 [2024-11-12 13:33:35,260 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand has 35 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 30 states have internal predecessors, (78), 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-12 13:33:35,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:35,774 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2024-11-12 13:33:35,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 13:33:35,774 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 30 states have internal predecessors, (78), 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 44 [2024-11-12 13:33:35,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:35,775 INFO L225 Difference]: With dead ends: 96 [2024-11-12 13:33:35,775 INFO L226 Difference]: Without dead ends: 96 [2024-11-12 13:33:35,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=238, Invalid=2292, Unknown=28, NotChecked=198, Total=2756 [2024-11-12 13:33:35,776 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 22 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:35,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 643 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:33:35,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-12 13:33:35,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-12 13:33:35,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 90 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:33:35,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2024-11-12 13:33:35,778 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 44 [2024-11-12 13:33:35,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:35,779 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2024-11-12 13:33:35,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 30 states have internal predecessors, (78), 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-12 13:33:35,779 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2024-11-12 13:33:35,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-12 13:33:35,779 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:35,779 INFO L218 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] [2024-11-12 13:33:35,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-12 13:33:35,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-12 13:33:35,980 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:35,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:35,980 INFO L85 PathProgramCache]: Analyzing trace with hash 324547289, now seen corresponding path program 1 times [2024-11-12 13:33:35,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:35,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386579073] [2024-11-12 13:33:35,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:35,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:36,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:36,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:33:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:36,903 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:36,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:36,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386579073] [2024-11-12 13:33:36,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386579073] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:36,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451158971] [2024-11-12 13:33:36,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:36,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:36,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:36,905 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-12 13:33:36,905 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-12 13:33:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:37,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-12 13:33:37,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:37,161 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-12 13:33:37,219 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:33:37,220 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-12 13:33:37,267 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-12 13:33:37,273 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-12 13:33:37,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:33:37,385 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 75 treesize of output 41 [2024-11-12 13:33:37,391 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-12 13:33:37,460 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 13:33:37,461 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-12 13:33:37,466 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-12 13:33:37,599 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-12 13:33:37,603 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-12 13:33:37,613 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-12 13:33:37,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:37,842 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))) (and (forall ((v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1531 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1532) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1531) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0)))) (forall ((v_ArrVal_1532 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1532) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0) 4))))) is different from false [2024-11-12 13:33:37,855 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))) (and (forall ((v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1531 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1532) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1531) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)))) (forall ((v_ArrVal_1532 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1532) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 4))))) is different from false [2024-11-12 13:33:37,880 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base|)) (.cse3 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))) (and (forall ((v_ArrVal_1529 Int) (v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1531 (Array Int Int)) (v_ArrVal_1528 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse4 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1529)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1528) .cse0 v_ArrVal_1532) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1531) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1529 Int) (v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1528 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1528) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse4 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1529)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse3) v_ArrVal_1532) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 4))))) is different from false [2024-11-12 13:33:37,922 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse4))) (let ((.cse5 (select |c_#memory_$Pointer$#0.base| .cse0)) (.cse2 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse6 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse4))) (and (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_24| Int)) (or (forall ((v_ArrVal_1529 Int) (v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1531 (Array Int Int)) (v_ArrVal_1528 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 (store .cse5 |v_ULTIMATE.start_create_#t~mem9#1.offset_24| v_ArrVal_1529)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse4))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1528) .cse1 v_ArrVal_1532) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1531) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2)))))) (< .cse6 |v_ULTIMATE.start_create_#t~mem9#1.offset_24|))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_24| Int)) (or (forall ((v_ArrVal_1529 Int) (v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1528 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1528) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 (store .cse5 |v_ULTIMATE.start_create_#t~mem9#1.offset_24| v_ArrVal_1529)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse4) v_ArrVal_1532) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) 4))) (< .cse6 |v_ULTIMATE.start_create_#t~mem9#1.offset_24|))))))) is different from false [2024-11-12 13:33:37,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:37,964 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 61 treesize of output 62 [2024-11-12 13:33:37,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:37,978 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 208 treesize of output 195 [2024-11-12 13:33:37,985 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 71 treesize of output 67 [2024-11-12 13:33:37,990 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 104 treesize of output 92 [2024-11-12 13:33:38,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:38,057 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 134 treesize of output 135 [2024-11-12 13:33:38,060 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:33:38,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:38,066 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 35 treesize of output 36 [2024-11-12 13:33:38,068 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:33:38,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:33:38,073 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 33 treesize of output 21 [2024-11-12 13:33:38,075 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:33:38,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:33:38,078 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 24 treesize of output 12 [2024-11-12 13:33:38,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451158971] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:38,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:33:38,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2024-11-12 13:33:38,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721282415] [2024-11-12 13:33:38,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:38,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-12 13:33:38,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:38,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-12 13:33:38,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1585, Unknown=4, NotChecked=332, Total=2070 [2024-11-12 13:33:38,204 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand has 35 states, 34 states have (on average 2.176470588235294) internal successors, (74), 29 states have internal predecessors, (74), 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-12 13:33:38,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:38,662 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2024-11-12 13:33:38,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 13:33:38,662 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.176470588235294) internal successors, (74), 29 states have internal predecessors, (74), 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 44 [2024-11-12 13:33:38,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:38,663 INFO L225 Difference]: With dead ends: 96 [2024-11-12 13:33:38,663 INFO L226 Difference]: Without dead ends: 96 [2024-11-12 13:33:38,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=223, Invalid=2239, Unknown=4, NotChecked=396, Total=2862 [2024-11-12 13:33:38,664 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 17 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:38,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 623 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:33:38,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-12 13:33:38,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-12 13:33:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 90 states have internal predecessors, (103), 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-12 13:33:38,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2024-11-12 13:33:38,668 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 44 [2024-11-12 13:33:38,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:38,668 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2024-11-12 13:33:38,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.176470588235294) internal successors, (74), 29 states have internal predecessors, (74), 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-12 13:33:38,668 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2024-11-12 13:33:38,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-12 13:33:38,669 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:38,669 INFO L218 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, 1, 1, 1, 1] [2024-11-12 13:33:38,682 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-12 13:33:38,872 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,SelfDestructingSolverStorable26 [2024-11-12 13:33:38,873 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:38,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:38,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1470979996, now seen corresponding path program 1 times [2024-11-12 13:33:38,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:38,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17606643] [2024-11-12 13:33:38,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:38,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:38,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:38,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:33:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:38,963 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 13:33:38,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:38,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17606643] [2024-11-12 13:33:38,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17606643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:38,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693248184] [2024-11-12 13:33:38,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:38,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:38,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:38,966 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-12 13:33:38,967 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-12 13:33:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:39,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-12 13:33:39,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 13:33:39,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:39,181 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-12 13:33:39,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2024-11-12 13:33:39,197 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 13:33:39,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693248184] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:33:39,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:33:39,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2024-11-12 13:33:39,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721381469] [2024-11-12 13:33:39,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:39,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:33:39,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:39,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:33:39,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:33:39,203 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:33:39,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:39,297 INFO L93 Difference]: Finished difference Result 108 states and 126 transitions. [2024-11-12 13:33:39,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:33:39,298 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-12 13:33:39,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:39,299 INFO L225 Difference]: With dead ends: 108 [2024-11-12 13:33:39,299 INFO L226 Difference]: Without dead ends: 108 [2024-11-12 13:33:39,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 92 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-12 13:33:39,299 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:39,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 192 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:39,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-12 13:33:39,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2024-11-12 13:33:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 93 states have (on average 1.2688172043010753) internal successors, (118), 100 states have internal predecessors, (118), 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-12 13:33:39,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2024-11-12 13:33:39,304 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 45 [2024-11-12 13:33:39,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:39,304 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2024-11-12 13:33:39,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:33:39,304 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2024-11-12 13:33:39,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-12 13:33:39,304 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:39,304 INFO L218 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, 1, 1, 1, 1] [2024-11-12 13:33:39,318 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-12 13:33:39,505 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,SelfDestructingSolverStorable27 [2024-11-12 13:33:39,505 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:39,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:39,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1470979997, now seen corresponding path program 1 times [2024-11-12 13:33:39,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:39,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138432856] [2024-11-12 13:33:39,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:39,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:39,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:39,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:33:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:39,668 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:33:39,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:39,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138432856] [2024-11-12 13:33:39,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138432856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:39,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994096039] [2024-11-12 13:33:39,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:39,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:39,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:39,670 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-12 13:33:39,671 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-12 13:33:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:39,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-12 13:33:39,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:40,033 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:40,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:40,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:40,201 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-12 13:33:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:40,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994096039] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:33:40,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:33:40,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 27 [2024-11-12 13:33:40,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584248434] [2024-11-12 13:33:40,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:40,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-12 13:33:40,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:40,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-12 13:33:40,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2024-11-12 13:33:40,327 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand has 28 states, 27 states have (on average 3.962962962962963) internal successors, (107), 25 states have internal predecessors, (107), 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-12 13:33:40,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:40,636 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2024-11-12 13:33:40,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 13:33:40,637 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.962962962962963) internal successors, (107), 25 states have internal predecessors, (107), 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 45 [2024-11-12 13:33:40,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:40,637 INFO L225 Difference]: With dead ends: 108 [2024-11-12 13:33:40,637 INFO L226 Difference]: Without dead ends: 108 [2024-11-12 13:33:40,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=948, Unknown=0, NotChecked=0, Total=1056 [2024-11-12 13:33:40,638 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 49 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:40,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 543 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:33:40,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-12 13:33:40,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2024-11-12 13:33:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 93 states have (on average 1.2150537634408602) internal successors, (113), 100 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:33:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2024-11-12 13:33:40,640 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 45 [2024-11-12 13:33:40,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:40,640 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2024-11-12 13:33:40,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.962962962962963) internal successors, (107), 25 states have internal predecessors, (107), 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-12 13:33:40,640 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2024-11-12 13:33:40,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 13:33:40,641 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:40,641 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:40,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-12 13:33:40,844 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,SelfDestructingSolverStorable28 [2024-11-12 13:33:40,845 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-12 13:33:40,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:40,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1944558291, now seen corresponding path program 2 times [2024-11-12 13:33:40,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:40,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854051425] [2024-11-12 13:33:40,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:40,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:41,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 13:33:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:41,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 13:33:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:41,917 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:41,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:41,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854051425] [2024-11-12 13:33:41,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854051425] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:41,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126123877] [2024-11-12 13:33:41,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:33:41,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:41,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:41,919 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-12 13:33:41,920 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-12 13:33:42,066 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:33:42,067 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:33:42,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-12 13:33:42,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:42,074 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-12 13:33:42,173 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-12 13:33:42,176 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-12 13:33:42,196 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:33:42,196 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-12 13:33:42,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-12 13:33:42,233 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 26 [2024-11-12 13:33:42,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:33:42,398 INFO L349 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2024-11-12 13:33:42,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 60 [2024-11-12 13:33:42,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:33:42,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 29 [2024-11-12 13:33:42,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:33:42,508 INFO L349 Elim1Store]: treesize reduction 49, result has 15.5 percent of original size [2024-11-12 13:33:42,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 68 [2024-11-12 13:33:42,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:33:42,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 29 [2024-11-12 13:33:42,804 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:33:42,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:42,974 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base|)) (.cse1 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base|)) (.cse2 (+ |c_ULTIMATE.start_create_#t~mem11#1.offset| 12)) (.cse3 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))) (and (forall ((v_ArrVal_1871 (Array Int Int))) (or (forall ((v_ArrVal_1872 Int)) (= (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1871))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| (store .cse1 .cse2 v_ArrVal_1872)) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3)) (+ (select (select .cse0 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3) 4))) 0)) (not (= v_ArrVal_1871 (store .cse4 .cse2 (select v_ArrVal_1871 .cse2)))))) (forall ((v_ArrVal_1871 (Array Int Int))) (or (not (= v_ArrVal_1871 (store .cse4 .cse2 (select v_ArrVal_1871 .cse2)))) (forall ((v_ArrVal_1872 Int)) (= (select (let ((.cse5 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| (store .cse1 .cse2 v_ArrVal_1872)))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3))) (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1871) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3) 4)) 0)))))) is different from false [2024-11-12 13:33:43,011 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse9))) (let ((.cse4 (select |c_#memory_$Pointer$#0.base| .cse3)) (.cse2 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse6 (select |c_#memory_$Pointer$#0.offset| .cse3)) (.cse0 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse9))) (and (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_33| Int)) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_33| .cse0) (forall ((v_ArrVal_1871 (Array Int Int))) (let ((.cse5 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_33| 12))) (or (forall ((v_ArrVal_1872 Int)) (= 0 (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| .cse3 (store .cse4 .cse5 v_ArrVal_1872)))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2))) (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse3 v_ArrVal_1871) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) 4)))) (not (= v_ArrVal_1871 (store .cse6 .cse5 (select v_ArrVal_1871 .cse5))))))))) (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_33| Int)) (or (forall ((v_ArrVal_1871 (Array Int Int))) (let ((.cse8 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_33| 12))) (or (forall ((v_ArrVal_1872 Int)) (= (let ((.cse7 (store |c_#memory_$Pointer$#0.offset| .cse3 v_ArrVal_1871))) (select (select .cse7 (select (select (store |c_#memory_$Pointer$#0.base| .cse3 (store .cse4 .cse8 v_ArrVal_1872)) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2)) (+ (select (select .cse7 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) 4))) 0)) (not (= v_ArrVal_1871 (store .cse6 .cse8 (select v_ArrVal_1871 .cse8))))))) (< |v_ULTIMATE.start_create_#t~mem11#1.offset_33| .cse0))))))) is different from false [2024-11-12 13:33:43,062 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)) (.cse7 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base|)) (.cse8 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base|))) (and (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_33| Int) (v_ArrVal_1870 Int) (v_ArrVal_1867 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse8 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1870)))) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_33| (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (forall ((v_ArrVal_1871 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse7 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1867)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse5 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_33| 12))) (or (forall ((v_ArrVal_1872 Int)) (= (let ((.cse2 (store .cse0 .cse4 v_ArrVal_1871))) (select (select .cse2 (select (select (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_1872)) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6)) (+ 4 (select (select .cse2 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6)))) 0)) (not (= v_ArrVal_1871 (store (select .cse0 .cse4) .cse5 (select v_ArrVal_1871 .cse5))))))))))) (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_33| Int) (v_ArrVal_1870 Int) (v_ArrVal_1867 Int)) (let ((.cse9 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse8 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1870)))) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_33| (select (select .cse9 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (forall ((v_ArrVal_1871 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse7 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_1867)))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse13 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_33| 12))) (or (forall ((v_ArrVal_1872 Int)) (= (select (let ((.cse10 (store .cse11 .cse12 (store (select .cse11 .cse12) .cse13 v_ArrVal_1872)))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6))) (+ 4 (select (select (store .cse9 .cse12 v_ArrVal_1871) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6))) 0)) (not (= v_ArrVal_1871 (store (select .cse9 .cse12) .cse13 (select v_ArrVal_1871 .cse13))))))))))))) is different from false [2024-11-12 13:33:43,138 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (let ((.cse10 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse4 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse8 (select |c_#memory_$Pointer$#0.base| .cse7)) (.cse9 (select |c_#memory_$Pointer$#0.offset| .cse7))) (and (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_34| Int)) (or (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_33| Int) (v_ArrVal_1870 Int) (v_ArrVal_1867 Int)) (let ((.cse5 (store |c_#memory_$Pointer$#0.offset| .cse7 (store .cse9 |v_ULTIMATE.start_create_#t~mem9#1.offset_34| v_ArrVal_1870)))) (or (forall ((v_ArrVal_1871 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#0.base| .cse7 (store .cse8 |v_ULTIMATE.start_create_#t~mem9#1.offset_34| v_ArrVal_1867)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse3 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_33| 12))) (or (forall ((v_ArrVal_1872 Int)) (= (let ((.cse0 (store .cse5 .cse2 v_ArrVal_1871))) (select (select .cse0 (select (select (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_1872)) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse4)) (+ (select (select .cse0 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse4) 4))) 0)) (not (= (store (select .cse5 .cse2) .cse3 (select v_ArrVal_1871 .cse3)) v_ArrVal_1871)))))) (< |v_ULTIMATE.start_create_#t~mem11#1.offset_33| (select (select .cse5 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))))) (< .cse10 |v_ULTIMATE.start_create_#t~mem9#1.offset_34|))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_34| Int)) (or (< .cse10 |v_ULTIMATE.start_create_#t~mem9#1.offset_34|) (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_33| Int) (v_ArrVal_1870 Int) (v_ArrVal_1867 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#0.offset| .cse7 (store .cse9 |v_ULTIMATE.start_create_#t~mem9#1.offset_34| v_ArrVal_1870)))) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_33| (select (select .cse11 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (forall ((v_ArrVal_1871 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#0.base| .cse7 (store .cse8 |v_ULTIMATE.start_create_#t~mem9#1.offset_34| v_ArrVal_1867)))) (let ((.cse13 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_33| 12)) (.cse12 (select (select .cse15 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (not (= (store (select .cse11 .cse12) .cse13 (select v_ArrVal_1871 .cse13)) v_ArrVal_1871)) (forall ((v_ArrVal_1872 Int)) (= (select (let ((.cse14 (store .cse15 .cse12 (store (select .cse15 .cse12) .cse13 v_ArrVal_1872)))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse4))) (+ (select (select (store .cse11 .cse12 v_ArrVal_1871) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse4) 4)) 0))))))))))))))) is different from false [2024-11-12 13:33:43,230 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse9 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1 |c_ULTIMATE.start_create_#t~ret8#1.offset|))) (.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1 |c_ULTIMATE.start_create_#t~ret8#1.base|)))) (let ((.cse3 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse8 (select .cse7 |c_ULTIMATE.start_create_#t~ret8#1.base|)) (.cse10 (select .cse9 |c_ULTIMATE.start_create_#t~ret8#1.base|))) (and (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_34| Int)) (or (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_33| Int) (v_ArrVal_1870 Int) (v_ArrVal_1867 Int)) (let ((.cse0 (store .cse9 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse10 |v_ULTIMATE.start_create_#t~mem9#1.offset_34| v_ArrVal_1870)))) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_33| (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (forall ((v_ArrVal_1871 (Array Int Int))) (let ((.cse4 (store .cse7 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse8 |v_ULTIMATE.start_create_#t~mem9#1.offset_34| v_ArrVal_1867)))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse6 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_33| 12))) (or (forall ((v_ArrVal_1872 Int)) (= (select (let ((.cse2 (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_ArrVal_1872)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3))) (+ (select (select (store .cse0 .cse5 v_ArrVal_1871) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3) 4)) 0)) (not (= v_ArrVal_1871 (store (select .cse0 .cse5) .cse6 (select v_ArrVal_1871 .cse6))))))))))) (< |c_ULTIMATE.start_create_#t~ret8#1.offset| |v_ULTIMATE.start_create_#t~mem9#1.offset_34|))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_34| Int)) (or (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_33| Int) (v_ArrVal_1870 Int) (v_ArrVal_1867 Int)) (let ((.cse11 (store .cse9 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse10 |v_ULTIMATE.start_create_#t~mem9#1.offset_34| v_ArrVal_1870)))) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_33| (select (select .cse11 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (forall ((v_ArrVal_1871 (Array Int Int))) (let ((.cse13 (store .cse7 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse8 |v_ULTIMATE.start_create_#t~mem9#1.offset_34| v_ArrVal_1867)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse15 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_33| 12))) (or (forall ((v_ArrVal_1872 Int)) (= (let ((.cse12 (store .cse11 .cse14 v_ArrVal_1871))) (select (select .cse12 (select (select (store .cse13 .cse14 (store (select .cse13 .cse14) .cse15 v_ArrVal_1872)) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3)) (+ (select (select .cse12 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse3) 4))) 0)) (not (= v_ArrVal_1871 (store (select .cse11 .cse14) .cse15 (select v_ArrVal_1871 .cse15))))))))))) (< |c_ULTIMATE.start_create_#t~ret8#1.offset| |v_ULTIMATE.start_create_#t~mem9#1.offset_34|))))))) is different from false [2024-11-12 13:33:44,086 INFO L349 Elim1Store]: treesize reduction 1860, result has 38.0 percent of original size [2024-11-12 13:33:44,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 292753 treesize of output 273041 [2024-11-12 13:33:46,041 INFO L349 Elim1Store]: treesize reduction 408, result has 30.4 percent of original size [2024-11-12 13:33:46,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 20 new quantified variables, introduced 56 case distinctions, treesize of input 7993532 treesize of output 4670810 [2024-11-12 13:33:56,276 WARN L286 SmtUtils]: Spent 10.22s on a formula simplification. DAG size of input: 4019 DAG size of output: 1553 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 13:33:57,749 INFO L349 Elim1Store]: treesize reduction 547, result has 29.4 percent of original size [2024-11-12 13:33:57,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 16 new quantified variables, introduced 56 case distinctions, treesize of input 98747 treesize of output 64569 [2024-11-12 13:34:00,791 INFO L349 Elim1Store]: treesize reduction 34, result has 91.3 percent of original size [2024-11-12 13:34:00,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 14 new quantified variables, introduced 36 case distinctions, treesize of input 97323 treesize of output 66616 [2024-11-12 13:34:03,991 INFO L349 Elim1Store]: treesize reduction 1400, result has 24.2 percent of original size [2024-11-12 13:34:03,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 67 case distinctions, treesize of input 64194 treesize of output 63018 [2024-11-12 13:34:07,646 INFO L349 Elim1Store]: treesize reduction 229, result has 75.3 percent of original size [2024-11-12 13:34:07,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 60694 treesize of output 60697