./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-nested-sll-inline.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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-nested-sll-inline.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 2a031cd83911a702ba38b9e8637ad5ead7999efd0a578b82d9c2168fee0ee72e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:49:07,617 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:49:07,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-04 07:49:07,672 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:49:07,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:49:07,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:49:07,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:49:07,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:49:07,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:49:07,693 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:49:07,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:49:07,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:49:07,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:49:07,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:49:07,694 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:49:07,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:49:07,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:49:07,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:49:07,695 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:49:07,695 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:49:07,695 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:49:07,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:49:07,695 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:49:07,695 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:49:07,695 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:49:07,695 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:49:07,695 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:49:07,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:49:07,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:49:07,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:49:07,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:49:07,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:49:07,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:49:07,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:49:07,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:49:07,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:49:07,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:49:07,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:49:07,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:49:07,697 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 2a031cd83911a702ba38b9e8637ad5ead7999efd0a578b82d9c2168fee0ee72e [2025-03-04 07:49:07,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:49:07,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:49:07,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:49:07,930 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:49:07,930 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:49:07,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-nested-sll-inline.i [2025-03-04 07:49:09,034 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01e1fe4ac/7f33e6dca0b94e6790c06881c7101490/FLAG79d343591 [2025-03-04 07:49:09,277 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:49:09,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-sll-inline.i [2025-03-04 07:49:09,299 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01e1fe4ac/7f33e6dca0b94e6790c06881c7101490/FLAG79d343591 [2025-03-04 07:49:09,593 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01e1fe4ac/7f33e6dca0b94e6790c06881c7101490 [2025-03-04 07:49:09,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:49:09,595 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:49:09,596 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:49:09,596 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:49:09,599 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:49:09,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:49:09" (1/1) ... [2025-03-04 07:49:09,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3393444c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:09, skipping insertion in model container [2025-03-04 07:49:09,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:49:09" (1/1) ... [2025-03-04 07:49:09,629 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:49:09,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:49:09,848 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:49:09,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:49:09,905 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:49:09,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:09 WrapperNode [2025-03-04 07:49:09,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:49:09,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:49:09,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:49:09,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:49:09,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:09" (1/1) ... [2025-03-04 07:49:09,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:09" (1/1) ... [2025-03-04 07:49:09,936 INFO L138 Inliner]: procedures = 119, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 105 [2025-03-04 07:49:09,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:49:09,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:49:09,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:49:09,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:49:09,942 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:09" (1/1) ... [2025-03-04 07:49:09,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:09" (1/1) ... [2025-03-04 07:49:09,944 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:09" (1/1) ... [2025-03-04 07:49:09,960 INFO L175 MemorySlicer]: Split 18 memory accesses to 1 slices as follows [18]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 8 writes are split as follows [8]. [2025-03-04 07:49:09,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:09" (1/1) ... [2025-03-04 07:49:09,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:09" (1/1) ... [2025-03-04 07:49:09,968 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:09" (1/1) ... [2025-03-04 07:49:09,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:09" (1/1) ... [2025-03-04 07:49:09,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:09" (1/1) ... [2025-03-04 07:49:09,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:09" (1/1) ... [2025-03-04 07:49:09,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:49:09,971 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:49:09,971 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:49:09,971 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:49:09,972 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:09" (1/1) ... [2025-03-04 07:49:09,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:49:09,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:09,991 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) [2025-03-04 07:49:09,993 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 [2025-03-04 07:49:10,009 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2025-03-04 07:49:10,009 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2025-03-04 07:49:10,010 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-03-04 07:49:10,010 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-03-04 07:49:10,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:49:10,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:49:10,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:49:10,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:49:10,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:49:10,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:49:10,091 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:49:10,092 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:49:10,333 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2025-03-04 07:49:10,333 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:49:10,345 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:49:10,345 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:49:10,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:49:10 BoogieIcfgContainer [2025-03-04 07:49:10,345 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:49:10,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:49:10,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:49:10,351 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:49:10,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:49:09" (1/3) ... [2025-03-04 07:49:10,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f0ef36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:49:10, skipping insertion in model container [2025-03-04 07:49:10,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:09" (2/3) ... [2025-03-04 07:49:10,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f0ef36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:49:10, skipping insertion in model container [2025-03-04 07:49:10,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:49:10" (3/3) ... [2025-03-04 07:49:10,353 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-nested-sll-inline.i [2025-03-04 07:49:10,363 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:49:10,364 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-nested-sll-inline.i that has 3 procedures, 116 locations, 1 initial locations, 7 loop locations, and 43 error locations. [2025-03-04 07:49:10,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:49:10,398 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;@63cc2183, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:49:10,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2025-03-04 07:49:10,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 64 states have (on average 1.828125) internal successors, (117), 107 states have internal predecessors, (117), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:49:10,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:49:10,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:10,406 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:49:10,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:10,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:10,409 INFO L85 PathProgramCache]: Analyzing trace with hash 140266821, now seen corresponding path program 1 times [2025-03-04 07:49:10,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:10,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175582463] [2025-03-04 07:49:10,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:10,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:10,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:49:10,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:49:10,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:10,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:10,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:10,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:10,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175582463] [2025-03-04 07:49:10,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175582463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:10,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:10,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:49:10,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440657360] [2025-03-04 07:49:10,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:10,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:49:10,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:10,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:49:10,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:49:10,584 INFO L87 Difference]: Start difference. First operand has 116 states, 64 states have (on average 1.828125) internal successors, (117), 107 states have internal predecessors, (117), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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) [2025-03-04 07:49:10,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:10,668 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2025-03-04 07:49:10,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:49:10,671 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 [2025-03-04 07:49:10,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:10,675 INFO L225 Difference]: With dead ends: 114 [2025-03-04 07:49:10,675 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 07:49:10,676 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 [2025-03-04 07:49:10,680 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 2 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:10,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 196 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:10,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 07:49:10,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-04 07:49:10,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 63 states have (on average 1.746031746031746) internal successors, (110), 103 states have internal predecessors, (110), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:49:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2025-03-04 07:49:10,706 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 5 [2025-03-04 07:49:10,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:10,707 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2025-03-04 07:49:10,707 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) [2025-03-04 07:49:10,707 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2025-03-04 07:49:10,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:49:10,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:10,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:49:10,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:49:10,707 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:10,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:10,708 INFO L85 PathProgramCache]: Analyzing trace with hash 140266822, now seen corresponding path program 1 times [2025-03-04 07:49:10,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:10,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353566435] [2025-03-04 07:49:10,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:10,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:10,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:49:10,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:49:10,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:10,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:10,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:10,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:10,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353566435] [2025-03-04 07:49:10,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353566435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:10,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:10,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:49:10,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294050890] [2025-03-04 07:49:10,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:10,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:49:10,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:10,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:49:10,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:49:10,807 INFO L87 Difference]: Start difference. First operand 112 states and 122 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) [2025-03-04 07:49:10,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:10,863 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2025-03-04 07:49:10,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:49:10,863 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 [2025-03-04 07:49:10,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:10,864 INFO L225 Difference]: With dead ends: 110 [2025-03-04 07:49:10,864 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 07:49:10,864 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 [2025-03-04 07:49:10,865 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 2 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:10,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 200 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:49:10,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 07:49:10,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-04 07:49:10,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 63 states have (on average 1.7142857142857142) internal successors, (108), 101 states have internal predecessors, (108), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:49:10,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2025-03-04 07:49:10,871 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 5 [2025-03-04 07:49:10,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:10,872 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2025-03-04 07:49:10,872 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) [2025-03-04 07:49:10,872 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2025-03-04 07:49:10,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:49:10,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:10,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:10,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:49:10,873 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zero_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:10,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:10,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1629949076, now seen corresponding path program 1 times [2025-03-04 07:49:10,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:10,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959013783] [2025-03-04 07:49:10,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:10,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:10,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:49:10,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:49:10,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:10,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:10,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:10,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:10,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959013783] [2025-03-04 07:49:10,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959013783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:10,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:10,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:49:10,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182577684] [2025-03-04 07:49:10,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:10,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:49:10,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:10,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:49:10,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:49:10,935 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:10,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:10,992 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2025-03-04 07:49:10,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:49:10,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 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 13 [2025-03-04 07:49:10,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:10,993 INFO L225 Difference]: With dead ends: 109 [2025-03-04 07:49:10,994 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 07:49:10,995 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 [2025-03-04 07:49:10,996 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 1 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:10,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 191 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:10,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 07:49:11,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-04 07:49:11,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 63 states have (on average 1.6984126984126984) internal successors, (107), 100 states have internal predecessors, (107), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:49:11,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2025-03-04 07:49:11,006 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 13 [2025-03-04 07:49:11,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:11,009 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2025-03-04 07:49:11,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:11,010 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2025-03-04 07:49:11,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:49:11,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:11,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:11,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:49:11,010 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zero_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:11,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:11,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1629949077, now seen corresponding path program 1 times [2025-03-04 07:49:11,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:11,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974520545] [2025-03-04 07:49:11,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:11,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:11,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:49:11,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:49:11,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:11,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:11,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:11,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:11,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974520545] [2025-03-04 07:49:11,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974520545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:11,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:11,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:49:11,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902526935] [2025-03-04 07:49:11,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:11,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:49:11,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:11,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:49:11,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:49:11,103 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:11,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:11,152 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2025-03-04 07:49:11,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:49:11,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 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 13 [2025-03-04 07:49:11,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:11,153 INFO L225 Difference]: With dead ends: 108 [2025-03-04 07:49:11,153 INFO L226 Difference]: Without dead ends: 108 [2025-03-04 07:49:11,154 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 [2025-03-04 07:49:11,154 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 1 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:11,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 198 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:49:11,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-04 07:49:11,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-04 07:49:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 63 states have (on average 1.6825396825396826) internal successors, (106), 99 states have internal predecessors, (106), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:49:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2025-03-04 07:49:11,160 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 13 [2025-03-04 07:49:11,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:11,160 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2025-03-04 07:49:11,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:11,162 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2025-03-04 07:49:11,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:49:11,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:11,162 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] [2025-03-04 07:49:11,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:49:11,162 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:11,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:11,163 INFO L85 PathProgramCache]: Analyzing trace with hash -74214944, now seen corresponding path program 1 times [2025-03-04 07:49:11,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:11,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218069399] [2025-03-04 07:49:11,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:11,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:11,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:49:11,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:49:11,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:11,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:11,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:11,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:11,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218069399] [2025-03-04 07:49:11,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218069399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:11,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:11,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:49:11,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925864585] [2025-03-04 07:49:11,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:11,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:49:11,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:11,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:49:11,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:49:11,402 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 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) [2025-03-04 07:49:11,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:11,667 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2025-03-04 07:49:11,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:49:11,668 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 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 20 [2025-03-04 07:49:11,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:11,668 INFO L225 Difference]: With dead ends: 111 [2025-03-04 07:49:11,669 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 07:49:11,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:49:11,669 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 37 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:11,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 405 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:49:11,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 07:49:11,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2025-03-04 07:49:11,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 99 states have internal predecessors, (108), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 07:49:11,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2025-03-04 07:49:11,680 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 20 [2025-03-04 07:49:11,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:11,681 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2025-03-04 07:49:11,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 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) [2025-03-04 07:49:11,681 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2025-03-04 07:49:11,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:49:11,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:11,681 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] [2025-03-04 07:49:11,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:49:11,682 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:11,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:11,684 INFO L85 PathProgramCache]: Analyzing trace with hash -74214943, now seen corresponding path program 1 times [2025-03-04 07:49:11,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:11,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351462506] [2025-03-04 07:49:11,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:11,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:11,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:49:11,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:49:11,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:11,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:11,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:11,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351462506] [2025-03-04 07:49:11,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351462506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:11,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:11,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:49:11,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387562065] [2025-03-04 07:49:11,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:11,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:49:11,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:11,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:49:11,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:49:11,935 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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) [2025-03-04 07:49:12,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:12,278 INFO L93 Difference]: Finished difference Result 131 states and 151 transitions. [2025-03-04 07:49:12,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:49:12,278 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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 20 [2025-03-04 07:49:12,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:12,280 INFO L225 Difference]: With dead ends: 131 [2025-03-04 07:49:12,280 INFO L226 Difference]: Without dead ends: 131 [2025-03-04 07:49:12,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:49:12,281 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 30 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:12,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 478 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:49:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-04 07:49:12,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2025-03-04 07:49:12,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 80 states have (on average 1.5875) internal successors, (127), 113 states have internal predecessors, (127), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 07:49:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2025-03-04 07:49:12,288 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 20 [2025-03-04 07:49:12,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:12,288 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2025-03-04 07:49:12,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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) [2025-03-04 07:49:12,288 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2025-03-04 07:49:12,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 07:49:12,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:12,288 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] [2025-03-04 07:49:12,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:49:12,288 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:12,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:12,289 INFO L85 PathProgramCache]: Analyzing trace with hash -373264758, now seen corresponding path program 1 times [2025-03-04 07:49:12,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:12,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350956139] [2025-03-04 07:49:12,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:12,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:12,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:49:12,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:49:12,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:12,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:12,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:12,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350956139] [2025-03-04 07:49:12,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350956139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:12,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586886598] [2025-03-04 07:49:12,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:12,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:12,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:12,452 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) [2025-03-04 07:49:12,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:49:12,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:49:12,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:49:12,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:12,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:12,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:49:12,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:12,550 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 [2025-03-04 07:49:12,577 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-03-04 07:49:12,640 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:49:12,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 07:49:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-04 07:49:12,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:12,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586886598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:12,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:12,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2025-03-04 07:49:12,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158563037] [2025-03-04 07:49:12,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:12,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:49:12,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:12,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:49:12,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2025-03-04 07:49:12,696 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:49:12,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:12,920 INFO L93 Difference]: Finished difference Result 127 states and 149 transitions. [2025-03-04 07:49:12,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:49:12,920 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2025-03-04 07:49:12,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:12,921 INFO L225 Difference]: With dead ends: 127 [2025-03-04 07:49:12,921 INFO L226 Difference]: Without dead ends: 127 [2025-03-04 07:49:12,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2025-03-04 07:49:12,922 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 15 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:12,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 449 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 311 Invalid, 0 Unknown, 129 Unchecked, 0.2s Time] [2025-03-04 07:49:12,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-04 07:49:12,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2025-03-04 07:49:12,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 81 states have (on average 1.5679012345679013) internal successors, (127), 112 states have internal predecessors, (127), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:49:12,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 147 transitions. [2025-03-04 07:49:12,926 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 147 transitions. Word has length 26 [2025-03-04 07:49:12,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:12,926 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 147 transitions. [2025-03-04 07:49:12,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:49:12,927 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 147 transitions. [2025-03-04 07:49:12,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 07:49:12,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:12,927 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] [2025-03-04 07:49:12,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:49:13,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:13,128 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:13,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:13,129 INFO L85 PathProgramCache]: Analyzing trace with hash -373264757, now seen corresponding path program 1 times [2025-03-04 07:49:13,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:13,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481407846] [2025-03-04 07:49:13,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:13,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:13,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:49:13,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:49:13,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:13,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:13,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:13,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481407846] [2025-03-04 07:49:13,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481407846] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:13,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957578676] [2025-03-04 07:49:13,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:13,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:13,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:13,355 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) [2025-03-04 07:49:13,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:49:13,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:49:13,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:49:13,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:13,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:13,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 07:49:13,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:13,427 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 [2025-03-04 07:49:13,464 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2025-03-04 07:49:13,484 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:49:13,484 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 [2025-03-04 07:49:13,494 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-04 07:49:13,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:13,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957578676] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:13,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:13,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2025-03-04 07:49:13,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127023473] [2025-03-04 07:49:13,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:13,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:49:13,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:13,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:49:13,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2025-03-04 07:49:13,552 INFO L87 Difference]: Start difference. First operand 125 states and 147 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:49:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:13,739 INFO L93 Difference]: Finished difference Result 129 states and 150 transitions. [2025-03-04 07:49:13,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:49:13,739 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2025-03-04 07:49:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:13,740 INFO L225 Difference]: With dead ends: 129 [2025-03-04 07:49:13,740 INFO L226 Difference]: Without dead ends: 129 [2025-03-04 07:49:13,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2025-03-04 07:49:13,740 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 8 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:13,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 505 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 272 Invalid, 0 Unknown, 125 Unchecked, 0.1s Time] [2025-03-04 07:49:13,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-04 07:49:13,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2025-03-04 07:49:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 83 states have (on average 1.5421686746987953) internal successors, (128), 114 states have internal predecessors, (128), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:49:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 148 transitions. [2025-03-04 07:49:13,745 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 148 transitions. Word has length 26 [2025-03-04 07:49:13,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:13,745 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 148 transitions. [2025-03-04 07:49:13,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:49:13,745 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 148 transitions. [2025-03-04 07:49:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 07:49:13,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:13,745 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] [2025-03-04 07:49:13,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:13,950 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,SelfDestructingSolverStorable7 [2025-03-04 07:49:13,950 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:13,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:13,951 INFO L85 PathProgramCache]: Analyzing trace with hash -485316134, now seen corresponding path program 1 times [2025-03-04 07:49:13,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:13,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715775778] [2025-03-04 07:49:13,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:13,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:13,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:49:13,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:49:13,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:13,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:14,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:14,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715775778] [2025-03-04 07:49:14,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715775778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:14,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:14,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:49:14,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274523010] [2025-03-04 07:49:14,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:14,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:49:14,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:14,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:49:14,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:49:14,005 INFO L87 Difference]: Start difference. First operand 127 states and 148 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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) [2025-03-04 07:49:14,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:14,117 INFO L93 Difference]: Finished difference Result 155 states and 184 transitions. [2025-03-04 07:49:14,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:49:14,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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) Word has length 26 [2025-03-04 07:49:14,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:14,118 INFO L225 Difference]: With dead ends: 155 [2025-03-04 07:49:14,118 INFO L226 Difference]: Without dead ends: 155 [2025-03-04 07:49:14,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:49:14,120 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 48 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:14,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 348 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:14,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-04 07:49:14,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 147. [2025-03-04 07:49:14,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 102 states have (on average 1.5392156862745099) internal successors, (157), 132 states have internal predecessors, (157), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 07:49:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 181 transitions. [2025-03-04 07:49:14,128 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 181 transitions. Word has length 26 [2025-03-04 07:49:14,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:14,128 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 181 transitions. [2025-03-04 07:49:14,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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) [2025-03-04 07:49:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 181 transitions. [2025-03-04 07:49:14,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 07:49:14,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:14,128 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] [2025-03-04 07:49:14,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:49:14,129 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:14,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:14,129 INFO L85 PathProgramCache]: Analyzing trace with hash -485316133, now seen corresponding path program 1 times [2025-03-04 07:49:14,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:14,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301755085] [2025-03-04 07:49:14,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:14,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:14,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:49:14,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:49:14,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:14,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:14,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:14,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:14,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301755085] [2025-03-04 07:49:14,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301755085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:14,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:14,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:49:14,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906624519] [2025-03-04 07:49:14,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:14,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:49:14,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:14,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:49:14,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:49:14,284 INFO L87 Difference]: Start difference. First operand 147 states and 181 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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) [2025-03-04 07:49:14,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:14,425 INFO L93 Difference]: Finished difference Result 163 states and 194 transitions. [2025-03-04 07:49:14,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:49:14,426 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 26 [2025-03-04 07:49:14,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:14,426 INFO L225 Difference]: With dead ends: 163 [2025-03-04 07:49:14,426 INFO L226 Difference]: Without dead ends: 163 [2025-03-04 07:49:14,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:49:14,427 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 39 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:14,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 640 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:14,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-04 07:49:14,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 156. [2025-03-04 07:49:14,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 111 states have (on average 1.5315315315315314) internal successors, (170), 141 states have internal predecessors, (170), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 07:49:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 194 transitions. [2025-03-04 07:49:14,434 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 194 transitions. Word has length 26 [2025-03-04 07:49:14,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:14,435 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 194 transitions. [2025-03-04 07:49:14,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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) [2025-03-04 07:49:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 194 transitions. [2025-03-04 07:49:14,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:49:14,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:14,437 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] [2025-03-04 07:49:14,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:49:14,438 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:14,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:14,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1762649034, now seen corresponding path program 1 times [2025-03-04 07:49:14,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:14,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023260580] [2025-03-04 07:49:14,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:14,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:14,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:49:14,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:49:14,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:14,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:14,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:14,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:14,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023260580] [2025-03-04 07:49:14,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023260580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:14,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:14,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:49:14,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173260830] [2025-03-04 07:49:14,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:14,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:49:14,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:14,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:49:14,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:49:14,511 INFO L87 Difference]: Start difference. First operand 156 states and 194 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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) [2025-03-04 07:49:14,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:14,554 INFO L93 Difference]: Finished difference Result 165 states and 205 transitions. [2025-03-04 07:49:14,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:49:14,554 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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 28 [2025-03-04 07:49:14,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:14,555 INFO L225 Difference]: With dead ends: 165 [2025-03-04 07:49:14,556 INFO L226 Difference]: Without dead ends: 165 [2025-03-04 07:49:14,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:49:14,557 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 43 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:14,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 664 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:49:14,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-04 07:49:14,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2025-03-04 07:49:14,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 112 states have (on average 1.5089285714285714) internal successors, (169), 142 states have internal predecessors, (169), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 07:49:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 193 transitions. [2025-03-04 07:49:14,561 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 193 transitions. Word has length 28 [2025-03-04 07:49:14,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:14,562 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 193 transitions. [2025-03-04 07:49:14,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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) [2025-03-04 07:49:14,562 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 193 transitions. [2025-03-04 07:49:14,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:49:14,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:14,563 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] [2025-03-04 07:49:14,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:49:14,563 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:14,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:14,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1193007879, now seen corresponding path program 1 times [2025-03-04 07:49:14,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:14,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116730668] [2025-03-04 07:49:14,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:14,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:14,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:49:14,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:49:14,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:14,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:14,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:14,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:14,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116730668] [2025-03-04 07:49:14,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116730668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:14,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:14,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 07:49:14,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366496114] [2025-03-04 07:49:14,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:14,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 07:49:14,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:14,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 07:49:14,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:49:14,857 INFO L87 Difference]: Start difference. First operand 157 states and 193 transitions. Second operand has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:15,139 INFO L93 Difference]: Finished difference Result 175 states and 209 transitions. [2025-03-04 07:49:15,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:49:15,140 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-03-04 07:49:15,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:15,141 INFO L225 Difference]: With dead ends: 175 [2025-03-04 07:49:15,141 INFO L226 Difference]: Without dead ends: 175 [2025-03-04 07:49:15,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:49:15,141 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 51 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:15,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 830 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:49:15,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-04 07:49:15,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 164. [2025-03-04 07:49:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 119 states have (on average 1.495798319327731) internal successors, (178), 149 states have internal predecessors, (178), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 07:49:15,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 202 transitions. [2025-03-04 07:49:15,154 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 202 transitions. Word has length 29 [2025-03-04 07:49:15,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:15,154 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 202 transitions. [2025-03-04 07:49:15,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:15,155 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 202 transitions. [2025-03-04 07:49:15,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:49:15,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:15,155 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] [2025-03-04 07:49:15,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:49:15,155 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:15,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:15,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1193007878, now seen corresponding path program 1 times [2025-03-04 07:49:15,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:15,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437406311] [2025-03-04 07:49:15,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:15,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:15,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:49:15,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:49:15,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:15,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:15,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:15,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:15,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437406311] [2025-03-04 07:49:15,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437406311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:15,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:15,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 07:49:15,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320034129] [2025-03-04 07:49:15,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:15,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 07:49:15,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:15,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 07:49:15,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:49:15,500 INFO L87 Difference]: Start difference. First operand 164 states and 202 transitions. Second operand has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:15,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:15,809 INFO L93 Difference]: Finished difference Result 175 states and 208 transitions. [2025-03-04 07:49:15,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:49:15,809 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-03-04 07:49:15,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:15,810 INFO L225 Difference]: With dead ends: 175 [2025-03-04 07:49:15,810 INFO L226 Difference]: Without dead ends: 175 [2025-03-04 07:49:15,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:49:15,811 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 49 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:15,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 946 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:49:15,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-04 07:49:15,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 164. [2025-03-04 07:49:15,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 119 states have (on average 1.4873949579831933) internal successors, (177), 149 states have internal predecessors, (177), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 07:49:15,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 201 transitions. [2025-03-04 07:49:15,815 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 201 transitions. Word has length 29 [2025-03-04 07:49:15,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:15,815 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 201 transitions. [2025-03-04 07:49:15,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:15,816 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 201 transitions. [2025-03-04 07:49:15,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 07:49:15,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:15,816 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] [2025-03-04 07:49:15,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:49:15,816 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:15,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:15,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1948342938, now seen corresponding path program 1 times [2025-03-04 07:49:15,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:15,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515160989] [2025-03-04 07:49:15,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:15,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:15,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:49:15,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:49:15,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:15,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:16,146 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:16,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:16,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515160989] [2025-03-04 07:49:16,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515160989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:16,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610015075] [2025-03-04 07:49:16,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:16,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:16,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:16,149 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) [2025-03-04 07:49:16,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:49:16,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:49:16,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:49:16,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:16,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:16,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 07:49:16,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:16,232 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 [2025-03-04 07:49:16,236 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 [2025-03-04 07:49:16,402 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 07:49:16,403 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 [2025-03-04 07:49:16,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:49:16,534 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-03-04 07:49:16,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:16,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:49:16,563 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-04 07:49:16,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-04 07:49:16,595 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-03-04 07:49:16,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:16,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610015075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:16,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:16,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2025-03-04 07:49:16,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916872782] [2025-03-04 07:49:16,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:16,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 07:49:16,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:16,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 07:49:16,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=432, Unknown=1, NotChecked=42, Total=552 [2025-03-04 07:49:16,706 INFO L87 Difference]: Start difference. First operand 164 states and 201 transitions. Second operand has 22 states, 20 states have (on average 2.5) internal successors, (50), 18 states have internal predecessors, (50), 4 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:49:17,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:17,263 INFO L93 Difference]: Finished difference Result 168 states and 197 transitions. [2025-03-04 07:49:17,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:49:17,263 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.5) internal successors, (50), 18 states have internal predecessors, (50), 4 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 32 [2025-03-04 07:49:17,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:17,264 INFO L225 Difference]: With dead ends: 168 [2025-03-04 07:49:17,264 INFO L226 Difference]: Without dead ends: 168 [2025-03-04 07:49:17,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=692, Unknown=1, NotChecked=54, Total=870 [2025-03-04 07:49:17,265 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 123 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:17,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 620 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 726 Invalid, 0 Unknown, 137 Unchecked, 0.4s Time] [2025-03-04 07:49:17,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-04 07:49:17,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 152. [2025-03-04 07:49:17,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 110 states have (on average 1.4636363636363636) internal successors, (161), 139 states have internal predecessors, (161), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:49:17,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 181 transitions. [2025-03-04 07:49:17,271 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 181 transitions. Word has length 32 [2025-03-04 07:49:17,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:17,271 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 181 transitions. [2025-03-04 07:49:17,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.5) internal successors, (50), 18 states have internal predecessors, (50), 4 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:49:17,271 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 181 transitions. [2025-03-04 07:49:17,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 07:49:17,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:17,273 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, 1] [2025-03-04 07:49:17,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:17,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:17,478 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:17,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:17,478 INFO L85 PathProgramCache]: Analyzing trace with hash -43332876, now seen corresponding path program 1 times [2025-03-04 07:49:17,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:17,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616022715] [2025-03-04 07:49:17,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:17,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:17,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:49:17,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:49:17,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:17,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:18,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:18,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:18,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616022715] [2025-03-04 07:49:18,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616022715] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:18,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129904867] [2025-03-04 07:49:18,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:18,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:18,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:18,038 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) [2025-03-04 07:49:18,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:49:18,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:49:18,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:49:18,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:18,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:18,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-04 07:49:18,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:18,107 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 [2025-03-04 07:49:18,195 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 [2025-03-04 07:49:18,198 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 [2025-03-04 07:49:18,247 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:49:18,247 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 [2025-03-04 07:49:18,361 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 [2025-03-04 07:49:18,369 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 [2025-03-04 07:49:18,689 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:49:18,695 INFO L349 Elim1Store]: treesize reduction 29, result has 9.4 percent of original size [2025-03-04 07:49:18,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 31 [2025-03-04 07:49:18,706 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 07:49:18,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2025-03-04 07:49:18,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:18,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:19,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:19,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1772 treesize of output 1712 [2025-03-04 07:49:19,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:19,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1887 treesize of output 1887 [2025-03-04 07:49:33,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129904867] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:33,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:33,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 32 [2025-03-04 07:49:33,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963235892] [2025-03-04 07:49:33,126 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:33,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 07:49:33,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:33,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 07:49:33,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1456, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 07:49:33,127 INFO L87 Difference]: Start difference. First operand 152 states and 181 transitions. Second operand has 32 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 27 states have internal predecessors, (49), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:49:33,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:33,805 INFO L93 Difference]: Finished difference Result 156 states and 186 transitions. [2025-03-04 07:49:33,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 07:49:33,805 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 27 states have internal predecessors, (49), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2025-03-04 07:49:33,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:33,806 INFO L225 Difference]: With dead ends: 156 [2025-03-04 07:49:33,806 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 07:49:33,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=154, Invalid=2008, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 07:49:33,807 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 24 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:33,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1704 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:49:33,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 07:49:33,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2025-03-04 07:49:33,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 112 states have (on average 1.4553571428571428) internal successors, (163), 141 states have internal predecessors, (163), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:49:33,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 183 transitions. [2025-03-04 07:49:33,810 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 183 transitions. Word has length 32 [2025-03-04 07:49:33,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:33,810 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 183 transitions. [2025-03-04 07:49:33,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 27 states have internal predecessors, (49), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:49:33,811 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 183 transitions. [2025-03-04 07:49:33,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 07:49:33,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:33,812 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, 1] [2025-03-04 07:49:33,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:34,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 07:49:34,017 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:34,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:34,017 INFO L85 PathProgramCache]: Analyzing trace with hash -42532171, now seen corresponding path program 1 times [2025-03-04 07:49:34,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:34,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330182032] [2025-03-04 07:49:34,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:34,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:34,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:49:34,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:49:34,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:34,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:34,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:34,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:34,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330182032] [2025-03-04 07:49:34,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330182032] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:34,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853466110] [2025-03-04 07:49:34,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:34,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:34,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:34,457 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) [2025-03-04 07:49:34,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:49:34,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:49:34,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:49:34,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:34,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:34,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 07:49:34,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:34,635 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 [2025-03-04 07:49:34,698 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 8 [2025-03-04 07:49:34,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:34,735 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:49:34,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853466110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:34,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:49:34,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [18] total 28 [2025-03-04 07:49:34,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844821205] [2025-03-04 07:49:34,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:34,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:49:34,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:34,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:49:34,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2025-03-04 07:49:34,736 INFO L87 Difference]: Start difference. First operand 154 states and 183 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:34,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:34,900 INFO L93 Difference]: Finished difference Result 163 states and 186 transitions. [2025-03-04 07:49:34,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:49:34,900 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2025-03-04 07:49:34,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:34,901 INFO L225 Difference]: With dead ends: 163 [2025-03-04 07:49:34,901 INFO L226 Difference]: Without dead ends: 163 [2025-03-04 07:49:34,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2025-03-04 07:49:34,902 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 52 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:34,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 837 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:34,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-04 07:49:34,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 155. [2025-03-04 07:49:34,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 113 states have (on average 1.4424778761061947) internal successors, (163), 142 states have internal predecessors, (163), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:49:34,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 183 transitions. [2025-03-04 07:49:34,905 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 183 transitions. Word has length 32 [2025-03-04 07:49:34,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:34,905 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 183 transitions. [2025-03-04 07:49:34,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:49:34,906 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 183 transitions. [2025-03-04 07:49:34,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 07:49:34,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:34,906 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, 1, 1, 1, 1] [2025-03-04 07:49:34,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:35,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 07:49:35,107 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:35,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:35,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1856263898, now seen corresponding path program 1 times [2025-03-04 07:49:35,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:35,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550657333] [2025-03-04 07:49:35,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:35,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:35,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 07:49:35,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 07:49:35,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:35,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:35,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:35,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:35,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550657333] [2025-03-04 07:49:35,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550657333] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:35,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020550669] [2025-03-04 07:49:35,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:35,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:35,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:35,522 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) [2025-03-04 07:49:35,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:49:35,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 07:49:35,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 07:49:35,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:35,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:35,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-03-04 07:49:35,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:35,601 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 [2025-03-04 07:49:35,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:49:35,627 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 [2025-03-04 07:49:35,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-04 07:49:35,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-04 07:49:35,838 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:49:35,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:49:35,843 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 16 [2025-03-04 07:49:35,854 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 16 [2025-03-04 07:49:36,000 INFO L349 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2025-03-04 07:49:36,000 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 2 case distinctions, treesize of input 34 treesize of output 31 [2025-03-04 07:49:36,022 INFO L349 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2025-03-04 07:49:36,022 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 31 [2025-03-04 07:49:36,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:36,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:36,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020550669] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:36,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:36,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 30 [2025-03-04 07:49:36,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328340738] [2025-03-04 07:49:36,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:36,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 07:49:36,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:36,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 07:49:36,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1086, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 07:49:36,624 INFO L87 Difference]: Start difference. First operand 155 states and 183 transitions. Second operand has 30 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:49:37,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:37,337 INFO L93 Difference]: Finished difference Result 159 states and 188 transitions. [2025-03-04 07:49:37,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:49:37,338 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2025-03-04 07:49:37,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:37,338 INFO L225 Difference]: With dead ends: 159 [2025-03-04 07:49:37,338 INFO L226 Difference]: Without dead ends: 159 [2025-03-04 07:49:37,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=170, Invalid=1810, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 07:49:37,339 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 13 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:37,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1582 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:49:37,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-04 07:49:37,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2025-03-04 07:49:37,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 116 states have (on average 1.4310344827586208) internal successors, (166), 145 states have internal predecessors, (166), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:49:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 186 transitions. [2025-03-04 07:49:37,343 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 186 transitions. Word has length 35 [2025-03-04 07:49:37,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:37,343 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 186 transitions. [2025-03-04 07:49:37,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:49:37,343 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 186 transitions. [2025-03-04 07:49:37,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 07:49:37,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:37,343 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] [2025-03-04 07:49:37,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:37,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 07:49:37,544 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:37,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:37,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1741556303, now seen corresponding path program 1 times [2025-03-04 07:49:37,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:37,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666323627] [2025-03-04 07:49:37,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:37,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:37,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:49:37,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:49:37,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:37,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:37,691 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:49:37,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:37,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666323627] [2025-03-04 07:49:37,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666323627] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:37,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442103213] [2025-03-04 07:49:37,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:37,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:37,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:37,696 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) [2025-03-04 07:49:37,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:49:37,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:49:37,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:49:37,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:37,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:37,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 07:49:37,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:37,780 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 [2025-03-04 07:49:37,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:49:37,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 07:49:37,804 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2025-03-04 07:49:37,816 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:49:37,816 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 [2025-03-04 07:49:37,824 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-03-04 07:49:37,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:37,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442103213] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:49:37,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:49:37,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 13 [2025-03-04 07:49:37,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882370178] [2025-03-04 07:49:37,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:37,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 07:49:37,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:37,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 07:49:37,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2025-03-04 07:49:37,914 INFO L87 Difference]: Start difference. First operand 158 states and 186 transitions. Second operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 07:49:38,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:38,167 INFO L93 Difference]: Finished difference Result 162 states and 192 transitions. [2025-03-04 07:49:38,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:49:38,168 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2025-03-04 07:49:38,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:38,168 INFO L225 Difference]: With dead ends: 162 [2025-03-04 07:49:38,168 INFO L226 Difference]: Without dead ends: 162 [2025-03-04 07:49:38,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=197, Unknown=1, NotChecked=28, Total=272 [2025-03-04 07:49:38,169 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 15 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:38,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 721 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 494 Invalid, 0 Unknown, 125 Unchecked, 0.2s Time] [2025-03-04 07:49:38,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-04 07:49:38,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 157. [2025-03-04 07:49:38,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 116 states have (on average 1.4224137931034482) internal successors, (165), 144 states have internal predecessors, (165), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:49:38,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 185 transitions. [2025-03-04 07:49:38,172 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 185 transitions. Word has length 38 [2025-03-04 07:49:38,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:38,172 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 185 transitions. [2025-03-04 07:49:38,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 07:49:38,172 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 185 transitions. [2025-03-04 07:49:38,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 07:49:38,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:38,173 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] [2025-03-04 07:49:38,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 07:49:38,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:38,373 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:38,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:38,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1741556304, now seen corresponding path program 1 times [2025-03-04 07:49:38,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:38,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254838150] [2025-03-04 07:49:38,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:38,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:38,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:49:38,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:49:38,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:38,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:38,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:38,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254838150] [2025-03-04 07:49:38,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254838150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:38,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908264353] [2025-03-04 07:49:38,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:38,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:38,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:38,599 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) [2025-03-04 07:49:38,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:49:38,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:49:38,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:49:38,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:38,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:38,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 07:49:38,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:38,674 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 [2025-03-04 07:49:38,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:49:38,708 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 [2025-03-04 07:49:38,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 07:49:38,757 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2025-03-04 07:49:38,775 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:49:38,775 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 [2025-03-04 07:49:38,790 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-03-04 07:49:38,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:38,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908264353] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:38,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:38,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2025-03-04 07:49:38,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033521945] [2025-03-04 07:49:38,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:38,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 07:49:38,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:38,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 07:49:38,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=329, Unknown=1, NotChecked=36, Total=420 [2025-03-04 07:49:38,837 INFO L87 Difference]: Start difference. First operand 157 states and 185 transitions. Second operand has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:49:39,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:39,131 INFO L93 Difference]: Finished difference Result 160 states and 190 transitions. [2025-03-04 07:49:39,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:49:39,132 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 38 [2025-03-04 07:49:39,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:39,133 INFO L225 Difference]: With dead ends: 160 [2025-03-04 07:49:39,133 INFO L226 Difference]: Without dead ends: 160 [2025-03-04 07:49:39,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=475, Unknown=1, NotChecked=44, Total=600 [2025-03-04 07:49:39,133 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 13 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:39,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 873 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 621 Invalid, 0 Unknown, 125 Unchecked, 0.2s Time] [2025-03-04 07:49:39,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-04 07:49:39,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 151. [2025-03-04 07:49:39,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 113 states have (on average 1.415929203539823) internal successors, (160), 139 states have internal predecessors, (160), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 07:49:39,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 178 transitions. [2025-03-04 07:49:39,136 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 178 transitions. Word has length 38 [2025-03-04 07:49:39,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:39,136 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 178 transitions. [2025-03-04 07:49:39,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:49:39,136 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 178 transitions. [2025-03-04 07:49:39,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:49:39,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:39,137 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, 1, 1, 1, 1, 1] [2025-03-04 07:49:39,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:39,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:39,337 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:39,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:39,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1458196682, now seen corresponding path program 1 times [2025-03-04 07:49:39,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:39,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818911320] [2025-03-04 07:49:39,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:39,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:39,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:49:39,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:49:39,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:39,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:39,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:49:39,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:39,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818911320] [2025-03-04 07:49:39,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818911320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:39,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:39,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:49:39,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332041542] [2025-03-04 07:49:39,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:39,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:49:39,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:39,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:49:39,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:49:39,390 INFO L87 Difference]: Start difference. First operand 151 states and 178 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 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) [2025-03-04 07:49:39,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:39,512 INFO L93 Difference]: Finished difference Result 187 states and 216 transitions. [2025-03-04 07:49:39,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:49:39,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 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) Word has length 37 [2025-03-04 07:49:39,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:39,513 INFO L225 Difference]: With dead ends: 187 [2025-03-04 07:49:39,513 INFO L226 Difference]: Without dead ends: 187 [2025-03-04 07:49:39,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:49:39,514 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 59 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:39,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 383 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:39,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-04 07:49:39,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 165. [2025-03-04 07:49:39,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 128 states have (on average 1.453125) internal successors, (186), 153 states have internal predecessors, (186), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 07:49:39,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 204 transitions. [2025-03-04 07:49:39,518 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 204 transitions. Word has length 37 [2025-03-04 07:49:39,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:39,518 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 204 transitions. [2025-03-04 07:49:39,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 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) [2025-03-04 07:49:39,519 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 204 transitions. [2025-03-04 07:49:39,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:49:39,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:39,519 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, 1, 1, 1, 1, 1] [2025-03-04 07:49:39,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 07:49:39,519 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:39,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:39,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1458196683, now seen corresponding path program 1 times [2025-03-04 07:49:39,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:39,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686171074] [2025-03-04 07:49:39,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:39,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:39,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:49:39,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:49:39,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:39,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:39,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:39,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:39,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686171074] [2025-03-04 07:49:39,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686171074] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:39,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59869987] [2025-03-04 07:49:39,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:39,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:39,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:39,657 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) [2025-03-04 07:49:39,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:49:39,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:49:39,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:49:39,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:39,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:39,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 07:49:39,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:49:39,883 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:49:39,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59869987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:39,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:49:39,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 18 [2025-03-04 07:49:39,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655093731] [2025-03-04 07:49:39,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:39,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:49:39,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:39,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:49:39,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:49:39,885 INFO L87 Difference]: Start difference. First operand 165 states and 204 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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) [2025-03-04 07:49:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:40,045 INFO L93 Difference]: Finished difference Result 203 states and 244 transitions. [2025-03-04 07:49:40,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:49:40,048 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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 37 [2025-03-04 07:49:40,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:40,049 INFO L225 Difference]: With dead ends: 203 [2025-03-04 07:49:40,049 INFO L226 Difference]: Without dead ends: 203 [2025-03-04 07:49:40,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:49:40,049 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 49 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:40,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 636 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:40,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-04 07:49:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 178. [2025-03-04 07:49:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 141 states have (on average 1.4680851063829787) internal successors, (207), 166 states have internal predecessors, (207), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 07:49:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 225 transitions. [2025-03-04 07:49:40,053 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 225 transitions. Word has length 37 [2025-03-04 07:49:40,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:40,053 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 225 transitions. [2025-03-04 07:49:40,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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) [2025-03-04 07:49:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 225 transitions. [2025-03-04 07:49:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 07:49:40,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:40,054 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, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:40,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:40,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:40,255 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:40,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:40,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2040542918, now seen corresponding path program 1 times [2025-03-04 07:49:40,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:40,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419692438] [2025-03-04 07:49:40,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:40,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:40,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:49:40,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:49:40,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:40,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:49:40,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:40,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419692438] [2025-03-04 07:49:40,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419692438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:40,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:40,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:49:40,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085018302] [2025-03-04 07:49:40,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:40,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:49:40,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:40,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:49:40,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:49:40,312 INFO L87 Difference]: Start difference. First operand 178 states and 225 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 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) [2025-03-04 07:49:40,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:40,367 INFO L93 Difference]: Finished difference Result 202 states and 256 transitions. [2025-03-04 07:49:40,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:49:40,367 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 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 38 [2025-03-04 07:49:40,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:40,368 INFO L225 Difference]: With dead ends: 202 [2025-03-04 07:49:40,368 INFO L226 Difference]: Without dead ends: 202 [2025-03-04 07:49:40,368 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 [2025-03-04 07:49:40,369 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 55 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:40,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 676 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:40,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-04 07:49:40,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 179. [2025-03-04 07:49:40,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 142 states have (on average 1.4507042253521127) internal successors, (206), 167 states have internal predecessors, (206), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 07:49:40,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 224 transitions. [2025-03-04 07:49:40,373 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 224 transitions. Word has length 38 [2025-03-04 07:49:40,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:40,373 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 224 transitions. [2025-03-04 07:49:40,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 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) [2025-03-04 07:49:40,374 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 224 transitions. [2025-03-04 07:49:40,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 07:49:40,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:40,374 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] [2025-03-04 07:49:40,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 07:49:40,374 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:40,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:40,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1434044652, now seen corresponding path program 1 times [2025-03-04 07:49:40,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:40,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531727552] [2025-03-04 07:49:40,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:40,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:40,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:49:40,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:49:40,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:40,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:40,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:49:40,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:40,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531727552] [2025-03-04 07:49:40,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531727552] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:40,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944099836] [2025-03-04 07:49:40,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:40,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:40,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:40,641 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) [2025-03-04 07:49:40,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:49:40,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:49:40,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:49:40,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:40,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:40,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 07:49:40,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:40,743 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 [2025-03-04 07:49:40,825 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-03-04 07:49:40,843 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:49:40,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 07:49:40,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 07:49:40,904 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 21 treesize of output 9 [2025-03-04 07:49:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2025-03-04 07:49:40,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:40,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2025-03-04 07:49:41,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944099836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:41,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:41,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2025-03-04 07:49:41,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968080925] [2025-03-04 07:49:41,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:41,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 07:49:41,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:41,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 07:49:41,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=531, Unknown=1, NotChecked=46, Total=650 [2025-03-04 07:49:41,145 INFO L87 Difference]: Start difference. First operand 179 states and 224 transitions. Second operand has 24 states, 22 states have (on average 2.727272727272727) internal successors, (60), 21 states have internal predecessors, (60), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 07:49:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:41,498 INFO L93 Difference]: Finished difference Result 203 states and 246 transitions. [2025-03-04 07:49:41,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 07:49:41,498 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.727272727272727) internal successors, (60), 21 states have internal predecessors, (60), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2025-03-04 07:49:41,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:41,499 INFO L225 Difference]: With dead ends: 203 [2025-03-04 07:49:41,499 INFO L226 Difference]: Without dead ends: 203 [2025-03-04 07:49:41,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=834, Unknown=1, NotChecked=58, Total=992 [2025-03-04 07:49:41,499 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 69 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:41,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1158 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 913 Invalid, 0 Unknown, 170 Unchecked, 0.3s Time] [2025-03-04 07:49:41,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-04 07:49:41,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 180. [2025-03-04 07:49:41,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 143 states have (on average 1.4545454545454546) internal successors, (208), 168 states have internal predecessors, (208), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 07:49:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 226 transitions. [2025-03-04 07:49:41,504 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 226 transitions. Word has length 41 [2025-03-04 07:49:41,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:41,504 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 226 transitions. [2025-03-04 07:49:41,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.727272727272727) internal successors, (60), 21 states have internal predecessors, (60), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 07:49:41,504 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 226 transitions. [2025-03-04 07:49:41,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 07:49:41,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:41,505 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] [2025-03-04 07:49:41,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:41,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 07:49:41,705 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:41,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:41,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1434044651, now seen corresponding path program 1 times [2025-03-04 07:49:41,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:41,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920540256] [2025-03-04 07:49:41,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:41,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:41,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:49:41,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:49:41,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:41,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:42,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:42,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920540256] [2025-03-04 07:49:42,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920540256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:42,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56319476] [2025-03-04 07:49:42,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:42,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:42,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:42,060 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) [2025-03-04 07:49:42,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:49:42,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:49:42,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:49:42,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:42,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:42,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-04 07:49:42,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:42,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 07:49:42,264 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 [2025-03-04 07:49:42,324 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 21 treesize of output 9 [2025-03-04 07:49:42,330 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:42,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:42,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2025-03-04 07:49:42,437 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 94 treesize of output 82 [2025-03-04 07:49:42,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:42,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:42,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:42,503 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 25 treesize of output 29 [2025-03-04 07:49:42,609 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:42,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56319476] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:49:42,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:49:42,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 33 [2025-03-04 07:49:42,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111277271] [2025-03-04 07:49:42,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:42,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 07:49:42,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:42,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 07:49:42,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1014, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 07:49:42,611 INFO L87 Difference]: Start difference. First operand 180 states and 226 transitions. Second operand has 34 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 30 states have internal predecessors, (80), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-04 07:49:43,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:43,047 INFO L93 Difference]: Finished difference Result 210 states and 257 transitions. [2025-03-04 07:49:43,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:49:43,048 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 30 states have internal predecessors, (80), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 41 [2025-03-04 07:49:43,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:43,049 INFO L225 Difference]: With dead ends: 210 [2025-03-04 07:49:43,049 INFO L226 Difference]: Without dead ends: 210 [2025-03-04 07:49:43,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=1203, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 07:49:43,049 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 60 mSDsluCounter, 1705 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:43,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1809 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:49:43,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-04 07:49:43,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 197. [2025-03-04 07:49:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 159 states have (on average 1.421383647798742) internal successors, (226), 184 states have internal predecessors, (226), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:49:43,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 246 transitions. [2025-03-04 07:49:43,053 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 246 transitions. Word has length 41 [2025-03-04 07:49:43,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:43,054 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 246 transitions. [2025-03-04 07:49:43,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 30 states have internal predecessors, (80), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-04 07:49:43,054 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 246 transitions. [2025-03-04 07:49:43,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 07:49:43,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:43,055 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:43,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 07:49:43,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 07:49:43,259 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:43,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:43,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1128791494, now seen corresponding path program 1 times [2025-03-04 07:49:43,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:43,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372400061] [2025-03-04 07:49:43,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:43,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:43,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:49:43,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:49:43,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:43,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:43,442 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:43,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:43,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372400061] [2025-03-04 07:49:43,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372400061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:43,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:43,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 07:49:43,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767487165] [2025-03-04 07:49:43,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:43,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:49:43,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:43,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:49:43,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:49:43,444 INFO L87 Difference]: Start difference. First operand 197 states and 246 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:49:43,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:43,702 INFO L93 Difference]: Finished difference Result 212 states and 269 transitions. [2025-03-04 07:49:43,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:49:43,702 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2025-03-04 07:49:43,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:43,703 INFO L225 Difference]: With dead ends: 212 [2025-03-04 07:49:43,703 INFO L226 Difference]: Without dead ends: 212 [2025-03-04 07:49:43,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:49:43,703 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:43,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 665 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:49:43,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-04 07:49:43,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 205. [2025-03-04 07:49:43,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 167 states have (on average 1.4311377245508983) internal successors, (239), 192 states have internal predecessors, (239), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:49:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 259 transitions. [2025-03-04 07:49:43,707 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 259 transitions. Word has length 42 [2025-03-04 07:49:43,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:43,707 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 259 transitions. [2025-03-04 07:49:43,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:49:43,707 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 259 transitions. [2025-03-04 07:49:43,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 07:49:43,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:43,708 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:43,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 07:49:43,708 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:43,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:43,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1128791493, now seen corresponding path program 1 times [2025-03-04 07:49:43,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:43,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887443415] [2025-03-04 07:49:43,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:43,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:43,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:49:43,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:49:43,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:43,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:44,001 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:44,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:44,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887443415] [2025-03-04 07:49:44,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887443415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:44,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:44,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 07:49:44,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528627928] [2025-03-04 07:49:44,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:44,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 07:49:44,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:44,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 07:49:44,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:49:44,004 INFO L87 Difference]: Start difference. First operand 205 states and 259 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:49:44,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:44,280 INFO L93 Difference]: Finished difference Result 207 states and 261 transitions. [2025-03-04 07:49:44,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:49:44,280 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2025-03-04 07:49:44,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:44,281 INFO L225 Difference]: With dead ends: 207 [2025-03-04 07:49:44,281 INFO L226 Difference]: Without dead ends: 207 [2025-03-04 07:49:44,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:49:44,282 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 4 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:44,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 637 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:49:44,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-04 07:49:44,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2025-03-04 07:49:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 167 states have (on average 1.4191616766467066) internal successors, (237), 192 states have internal predecessors, (237), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:49:44,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 257 transitions. [2025-03-04 07:49:44,285 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 257 transitions. Word has length 42 [2025-03-04 07:49:44,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:44,285 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 257 transitions. [2025-03-04 07:49:44,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:49:44,285 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 257 transitions. [2025-03-04 07:49:44,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 07:49:44,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:44,285 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:44,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 07:49:44,286 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:44,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:44,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1208090455, now seen corresponding path program 1 times [2025-03-04 07:49:44,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:44,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558488813] [2025-03-04 07:49:44,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:44,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:44,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:49:44,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:49:44,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:44,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:44,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:49:44,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:44,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558488813] [2025-03-04 07:49:44,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558488813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:44,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:44,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 07:49:44,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658728302] [2025-03-04 07:49:44,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:44,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 07:49:44,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:44,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 07:49:44,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:49:44,522 INFO L87 Difference]: Start difference. First operand 205 states and 257 transitions. Second operand has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 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) [2025-03-04 07:49:44,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:44,751 INFO L93 Difference]: Finished difference Result 226 states and 276 transitions. [2025-03-04 07:49:44,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:49:44,751 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 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 42 [2025-03-04 07:49:44,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:44,752 INFO L225 Difference]: With dead ends: 226 [2025-03-04 07:49:44,752 INFO L226 Difference]: Without dead ends: 226 [2025-03-04 07:49:44,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:49:44,752 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 55 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:44,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 824 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:49:44,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-04 07:49:44,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 212. [2025-03-04 07:49:44,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 175 states have (on average 1.4057142857142857) internal successors, (246), 199 states have internal predecessors, (246), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:49:44,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 266 transitions. [2025-03-04 07:49:44,756 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 266 transitions. Word has length 42 [2025-03-04 07:49:44,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:44,756 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 266 transitions. [2025-03-04 07:49:44,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 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) [2025-03-04 07:49:44,756 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 266 transitions. [2025-03-04 07:49:44,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 07:49:44,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:44,756 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:44,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 07:49:44,756 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:44,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:44,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1208090456, now seen corresponding path program 1 times [2025-03-04 07:49:44,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:44,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295879286] [2025-03-04 07:49:44,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:44,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:44,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:49:44,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:49:44,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:44,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:44,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:49:44,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:44,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295879286] [2025-03-04 07:49:44,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295879286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:44,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:44,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 07:49:44,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41264715] [2025-03-04 07:49:44,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:44,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 07:49:44,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:44,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 07:49:44,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:49:44,993 INFO L87 Difference]: Start difference. First operand 212 states and 266 transitions. Second operand has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 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) [2025-03-04 07:49:45,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:45,268 INFO L93 Difference]: Finished difference Result 232 states and 282 transitions. [2025-03-04 07:49:45,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 07:49:45,268 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 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 42 [2025-03-04 07:49:45,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:45,269 INFO L225 Difference]: With dead ends: 232 [2025-03-04 07:49:45,269 INFO L226 Difference]: Without dead ends: 232 [2025-03-04 07:49:45,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:49:45,269 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 56 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:45,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 834 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:49:45,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-04 07:49:45,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 222. [2025-03-04 07:49:45,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 185 states have (on average 1.4054054054054055) internal successors, (260), 209 states have internal predecessors, (260), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:49:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 280 transitions. [2025-03-04 07:49:45,275 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 280 transitions. Word has length 42 [2025-03-04 07:49:45,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:45,275 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 280 transitions. [2025-03-04 07:49:45,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 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) [2025-03-04 07:49:45,276 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 280 transitions. [2025-03-04 07:49:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 07:49:45,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:45,276 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:45,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 07:49:45,276 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-03-04 07:49:45,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:45,276 INFO L85 PathProgramCache]: Analyzing trace with hash 415481593, now seen corresponding path program 1 times [2025-03-04 07:49:45,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:45,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098356728] [2025-03-04 07:49:45,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:45,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:45,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:49:45,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:49:45,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:45,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:45,805 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:45,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:45,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098356728] [2025-03-04 07:49:45,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098356728] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:45,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842877503] [2025-03-04 07:49:45,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:45,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:45,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:45,807 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) [2025-03-04 07:49:45,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:49:45,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:49:45,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:49:45,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:45,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:45,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-03-04 07:49:45,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:45,899 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 [2025-03-04 07:49:45,997 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:49:45,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:49:46,066 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 [2025-03-04 07:49:46,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:49:46,162 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 35 treesize of output 19 [2025-03-04 07:49:46,166 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 [2025-03-04 07:49:46,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 07:49:46,344 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2025-03-04 07:49:46,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 16 [2025-03-04 07:49:46,347 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:46,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:46,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2025-03-04 07:49:50,631 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse2 (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|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|) |c_ULTIMATE.start_create_~nested~0#1.base|)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8)))))) (let ((.cse0 (forall ((|v_ULTIMATE.start_loop_~nested_list~0#1.offset_24| Int)) (or (= (select |c_#valid| (select .cse1 |v_ULTIMATE.start_loop_~nested_list~0#1.offset_24|)) 1) (< |v_ULTIMATE.start_loop_~nested_list~0#1.offset_24| 0))))) (and (or (= |c_ULTIMATE.start_create_~sll~0#1.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) (forall ((|v_ULTIMATE.start_loop_~nested_list~0#1.offset_24| Int)) (or (< |c_ULTIMATE.start_create_~nested~0#1.offset| |v_ULTIMATE.start_loop_~nested_list~0#1.offset_24|) (= (select |c_#valid| (select .cse1 |v_ULTIMATE.start_loop_~nested_list~0#1.offset_24|)) 1) (< |v_ULTIMATE.start_loop_~nested_list~0#1.offset_24| 0))) (or .cse0 (= |c_ULTIMATE.start_create_~sll~0#1.offset| |c_ULTIMATE.start_create_~now~0#1.offset|))))) is different from false [2025-03-04 07:49:50,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:50,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 3119 treesize of output 2930