./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-nested-sll.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.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 89b7500933072598b3ae86cb9a0697a1fc30e47e1dd961db3afeb42e68cfc79e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:49:13,490 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:49:13,550 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:13,559 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:49:13,559 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:49:13,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:49:13,580 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:49:13,580 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:49:13,580 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:49:13,580 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:49:13,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:49:13,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:49:13,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:49:13,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:49:13,582 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:49:13,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:49:13,582 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:49:13,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:49:13,582 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:49:13,582 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:49:13,583 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:49:13,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:49:13,583 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:49:13,583 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:49:13,583 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:49:13,583 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:49:13,583 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:49:13,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:49:13,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:49:13,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:49:13,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:49:13,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:49:13,584 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:49:13,584 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:49:13,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:49:13,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:49:13,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:49:13,584 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:49:13,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:49:13,584 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 -> 89b7500933072598b3ae86cb9a0697a1fc30e47e1dd961db3afeb42e68cfc79e [2025-03-04 07:49:13,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:49:13,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:49:13,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:49:13,812 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:49:13,812 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:49:13,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-nested-sll.i [2025-03-04 07:49:14,949 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c804c6fcf/dcee2f08efb04b6d97a8b31b907539e5/FLAGe63b7478e [2025-03-04 07:49:15,238 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:49:15,239 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-sll.i [2025-03-04 07:49:15,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c804c6fcf/dcee2f08efb04b6d97a8b31b907539e5/FLAGe63b7478e [2025-03-04 07:49:15,522 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c804c6fcf/dcee2f08efb04b6d97a8b31b907539e5 [2025-03-04 07:49:15,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:49:15,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:49:15,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:49:15,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:49:15,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:49:15,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:49:15" (1/1) ... [2025-03-04 07:49:15,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@730289be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:15, skipping insertion in model container [2025-03-04 07:49:15,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:49:15" (1/1) ... [2025-03-04 07:49:15,562 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:49:15,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:49:15,785 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:49:15,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:49:15,847 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:49:15,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:15 WrapperNode [2025-03-04 07:49:15,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:49:15,849 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:49:15,849 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:49:15,849 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:49:15,854 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:15" (1/1) ... [2025-03-04 07:49:15,869 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:15" (1/1) ... [2025-03-04 07:49:15,884 INFO L138 Inliner]: procedures = 122, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 76 [2025-03-04 07:49:15,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:49:15,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:49:15,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:49:15,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:49:15,892 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:15" (1/1) ... [2025-03-04 07:49:15,892 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:15" (1/1) ... [2025-03-04 07:49:15,894 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:15" (1/1) ... [2025-03-04 07:49:15,911 INFO L175 MemorySlicer]: Split 16 memory accesses to 1 slices as follows [16]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 7 writes are split as follows [7]. [2025-03-04 07:49:15,911 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:15" (1/1) ... [2025-03-04 07:49:15,911 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:15" (1/1) ... [2025-03-04 07:49:15,921 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:15" (1/1) ... [2025-03-04 07:49:15,922 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:15" (1/1) ... [2025-03-04 07:49:15,923 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:15" (1/1) ... [2025-03-04 07:49:15,924 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:15" (1/1) ... [2025-03-04 07:49:15,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:49:15,926 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:49:15,926 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:49:15,926 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:49:15,927 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:15" (1/1) ... [2025-03-04 07:49:15,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:49:15,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:15,952 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:15,954 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:15,973 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2025-03-04 07:49:15,973 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2025-03-04 07:49:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure create_internal [2025-03-04 07:49:15,974 INFO L138 BoogieDeclarations]: Found implementation of procedure create_internal [2025-03-04 07:49:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-03-04 07:49:15,974 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-03-04 07:49:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:49:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:49:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:49:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:49:15,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:49:15,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:49:16,049 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:49:16,050 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:49:16,307 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2025-03-04 07:49:16,311 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:49:16,319 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:49:16,319 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:49:16,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:49:16 BoogieIcfgContainer [2025-03-04 07:49:16,319 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:49:16,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:49:16,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:49:16,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:49:16,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:49:15" (1/3) ... [2025-03-04 07:49:16,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b600e13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:49:16, skipping insertion in model container [2025-03-04 07:49:16,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:49:15" (2/3) ... [2025-03-04 07:49:16,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b600e13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:49:16, skipping insertion in model container [2025-03-04 07:49:16,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:49:16" (3/3) ... [2025-03-04 07:49:16,325 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-nested-sll.i [2025-03-04 07:49:16,336 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:49:16,337 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-nested-sll.i that has 4 procedures, 111 locations, 1 initial locations, 6 loop locations, and 39 error locations. [2025-03-04 07:49:16,370 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:49:16,378 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;@2d649eea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:49:16,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-03-04 07:49:16,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 101 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:49:16,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:49:16,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:16,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:49:16,390 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 36 more)] === [2025-03-04 07:49:16,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:16,395 INFO L85 PathProgramCache]: Analyzing trace with hash 116422489, now seen corresponding path program 1 times [2025-03-04 07:49:16,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:16,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124384698] [2025-03-04 07:49:16,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:16,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:16,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:49:16,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:49:16,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:16,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:16,537 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:16,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:16,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124384698] [2025-03-04 07:49:16,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124384698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:16,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:16,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:49:16,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115654803] [2025-03-04 07:49:16,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:16,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:49:16,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:16,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:49:16,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:49:16,561 INFO L87 Difference]: Start difference. First operand has 111 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 101 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 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:16,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:16,631 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2025-03-04 07:49:16,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:49:16,633 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:16,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:16,637 INFO L225 Difference]: With dead ends: 109 [2025-03-04 07:49:16,637 INFO L226 Difference]: Without dead ends: 107 [2025-03-04 07:49:16,639 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:16,640 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:16,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 186 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:16,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-04 07:49:16,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-04 07:49:16,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 61 states have (on average 1.6885245901639345) internal successors, (103), 97 states have internal predecessors, (103), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:49:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2025-03-04 07:49:16,667 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 5 [2025-03-04 07:49:16,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:16,667 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2025-03-04 07:49:16,667 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:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2025-03-04 07:49:16,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:49:16,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:16,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:49:16,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:49:16,668 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 36 more)] === [2025-03-04 07:49:16,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:16,668 INFO L85 PathProgramCache]: Analyzing trace with hash 116422490, now seen corresponding path program 1 times [2025-03-04 07:49:16,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:16,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889499548] [2025-03-04 07:49:16,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:16,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:16,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:49:16,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:49:16,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:16,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:16,763 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:16,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:16,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889499548] [2025-03-04 07:49:16,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889499548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:16,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:16,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:49:16,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533496549] [2025-03-04 07:49:16,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:16,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:49:16,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:16,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:49:16,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:49:16,765 INFO L87 Difference]: Start difference. First operand 107 states and 115 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:16,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:16,817 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2025-03-04 07:49:16,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:49:16,817 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:16,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:16,818 INFO L225 Difference]: With dead ends: 105 [2025-03-04 07:49:16,818 INFO L226 Difference]: Without dead ends: 105 [2025-03-04 07:49:16,818 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:16,818 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 2 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:16,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 190 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:49:16,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-04 07:49:16,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-04 07:49:16,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 95 states have internal predecessors, (101), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:49:16,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2025-03-04 07:49:16,826 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 5 [2025-03-04 07:49:16,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:16,826 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2025-03-04 07:49:16,826 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:16,826 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2025-03-04 07:49:16,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 07:49:16,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:16,827 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:16,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:49:16,827 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 36 more)] === [2025-03-04 07:49:16,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:16,827 INFO L85 PathProgramCache]: Analyzing trace with hash -132999310, now seen corresponding path program 1 times [2025-03-04 07:49:16,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:16,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061261673] [2025-03-04 07:49:16,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:16,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:16,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 07:49:16,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 07:49:16,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:16,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:16,904 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:16,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:16,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061261673] [2025-03-04 07:49:16,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061261673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:16,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:16,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:49:16,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817373483] [2025-03-04 07:49:16,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:16,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:49:16,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:16,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:49:16,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:49:16,906 INFO L87 Difference]: Start difference. First operand 105 states and 113 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:16,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:16,960 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2025-03-04 07:49:16,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:49:16,961 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-04 07:49:16,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:16,962 INFO L225 Difference]: With dead ends: 104 [2025-03-04 07:49:16,963 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 07:49:16,964 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:16,964 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:16,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 181 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:49:16,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 07:49:16,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-04 07:49:16,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 61 states have (on average 1.639344262295082) internal successors, (100), 94 states have internal predecessors, (100), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:49:16,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2025-03-04 07:49:16,971 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 14 [2025-03-04 07:49:16,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:16,973 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2025-03-04 07:49:16,973 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:16,973 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2025-03-04 07:49:16,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 07:49:16,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:16,974 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:16,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:49:16,974 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 36 more)] === [2025-03-04 07:49:16,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:16,974 INFO L85 PathProgramCache]: Analyzing trace with hash -132999309, now seen corresponding path program 1 times [2025-03-04 07:49:16,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:16,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964318717] [2025-03-04 07:49:16,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:16,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:16,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 07:49:16,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 07:49:16,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:16,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:17,046 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:17,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:17,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964318717] [2025-03-04 07:49:17,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964318717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:17,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:17,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:49:17,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232210604] [2025-03-04 07:49:17,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:17,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:49:17,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:17,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:49:17,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:49:17,048 INFO L87 Difference]: Start difference. First operand 104 states and 112 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:17,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:17,096 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2025-03-04 07:49:17,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:49:17,096 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-04 07:49:17,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:17,097 INFO L225 Difference]: With dead ends: 103 [2025-03-04 07:49:17,098 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 07:49:17,098 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:17,099 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:17,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 188 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:49:17,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 07:49:17,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-04 07:49:17,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 61 states have (on average 1.6229508196721312) internal successors, (99), 93 states have internal predecessors, (99), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:49:17,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2025-03-04 07:49:17,107 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 14 [2025-03-04 07:49:17,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:17,107 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2025-03-04 07:49:17,108 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:49:17,108 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2025-03-04 07:49:17,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:49:17,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:17,108 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] [2025-03-04 07:49:17,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:49:17,109 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-04 07:49:17,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:17,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1978283411, now seen corresponding path program 1 times [2025-03-04 07:49:17,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:17,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347136140] [2025-03-04 07:49:17,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:17,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:17,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:49:17,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:49:17,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:17,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:17,350 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:17,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:17,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347136140] [2025-03-04 07:49:17,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347136140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:17,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:17,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:49:17,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210651139] [2025-03-04 07:49:17,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:17,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:49:17,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:17,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:49:17,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:49:17,352 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:17,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:17,659 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2025-03-04 07:49:17,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:49:17,660 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2025-03-04 07:49:17,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:17,661 INFO L225 Difference]: With dead ends: 120 [2025-03-04 07:49:17,662 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 07:49:17,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 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:17,664 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 18 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:17,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 468 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:49:17,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 07:49:17,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 115. [2025-03-04 07:49:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 72 states have (on average 1.6111111111111112) internal successors, (116), 102 states have internal predecessors, (116), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-04 07:49:17,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2025-03-04 07:49:17,675 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 24 [2025-03-04 07:49:17,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:17,675 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2025-03-04 07:49:17,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:17,675 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2025-03-04 07:49:17,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:49:17,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:17,676 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] [2025-03-04 07:49:17,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:49:17,676 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-04 07:49:17,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:17,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1978283412, now seen corresponding path program 1 times [2025-03-04 07:49:17,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:17,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440736251] [2025-03-04 07:49:17,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:17,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:17,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:49:17,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:49:17,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:17,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:17,991 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:17,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:17,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440736251] [2025-03-04 07:49:17,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440736251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:17,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:17,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:49:17,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226828646] [2025-03-04 07:49:17,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:17,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:49:17,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:17,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:49:17,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:49:17,993 INFO L87 Difference]: Start difference. First operand 115 states and 132 transitions. Second operand has 11 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:18,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:18,349 INFO L93 Difference]: Finished difference Result 131 states and 152 transitions. [2025-03-04 07:49:18,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:49:18,350 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2025-03-04 07:49:18,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:18,351 INFO L225 Difference]: With dead ends: 131 [2025-03-04 07:49:18,351 INFO L226 Difference]: Without dead ends: 131 [2025-03-04 07:49:18,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 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:18,352 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 16 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:18,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 519 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:49:18,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-04 07:49:18,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 126. [2025-03-04 07:49:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 81 states have (on average 1.5679012345679013) internal successors, (127), 111 states have internal predecessors, (127), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-04 07:49:18,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 148 transitions. [2025-03-04 07:49:18,362 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 148 transitions. Word has length 24 [2025-03-04 07:49:18,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:18,365 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 148 transitions. [2025-03-04 07:49:18,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:49:18,366 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 148 transitions. [2025-03-04 07:49:18,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 07:49:18,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:18,366 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:18,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:49:18,366 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_internalErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-04 07:49:18,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:18,367 INFO L85 PathProgramCache]: Analyzing trace with hash -2070115706, now seen corresponding path program 1 times [2025-03-04 07:49:18,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:18,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464951039] [2025-03-04 07:49:18,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:18,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:18,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:49:18,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:49:18,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:18,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:18,556 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:18,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:18,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464951039] [2025-03-04 07:49:18,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464951039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:18,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14375992] [2025-03-04 07:49:18,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:18,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:18,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:18,558 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:18,559 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:18,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:49:18,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:49:18,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:18,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:18,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:49:18,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:18,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:18,711 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:18,756 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:49:18,757 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:18,763 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:18,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:18,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14375992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:18,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:18,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2025-03-04 07:49:18,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731491921] [2025-03-04 07:49:18,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:18,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:49:18,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:18,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:49:18,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2025-03-04 07:49:18,827 INFO L87 Difference]: Start difference. First operand 126 states and 148 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, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:49:19,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:19,067 INFO L93 Difference]: Finished difference Result 127 states and 151 transitions. [2025-03-04 07:49:19,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:49:19,068 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, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2025-03-04 07:49:19,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:19,069 INFO L225 Difference]: With dead ends: 127 [2025-03-04 07:49:19,069 INFO L226 Difference]: Without dead ends: 127 [2025-03-04 07:49:19,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=167, Unknown=1, NotChecked=26, Total=240 [2025-03-04 07:49:19,069 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 15 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:19,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 448 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 284 Invalid, 0 Unknown, 116 Unchecked, 0.2s Time] [2025-03-04 07:49:19,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-04 07:49:19,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-04 07:49:19,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 82 states have (on average 1.5609756097560976) internal successors, (128), 111 states have internal predecessors, (128), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-04 07:49:19,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 151 transitions. [2025-03-04 07:49:19,074 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 151 transitions. Word has length 27 [2025-03-04 07:49:19,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:19,075 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 151 transitions. [2025-03-04 07:49:19,075 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, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:49:19,075 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 151 transitions. [2025-03-04 07:49:19,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 07:49:19,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:19,075 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:19,082 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:19,280 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:19,280 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_internalErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-04 07:49:19,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:19,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2070115705, now seen corresponding path program 1 times [2025-03-04 07:49:19,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:19,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479196681] [2025-03-04 07:49:19,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:19,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:19,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:49:19,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:49:19,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:19,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:19,488 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:19,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:19,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479196681] [2025-03-04 07:49:19,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479196681] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:19,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83933947] [2025-03-04 07:49:19,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:19,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:19,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:19,491 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:19,492 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:19,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:49:19,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:49:19,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:19,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:19,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 07:49:19,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:19,564 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:19,602 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:19,622 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:49:19,622 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:19,637 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:19,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:19,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83933947] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:19,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:19,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2025-03-04 07:49:19,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181332411] [2025-03-04 07:49:19,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:19,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:49:19,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:19,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:49:19,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2025-03-04 07:49:19,694 INFO L87 Difference]: Start difference. First operand 127 states and 151 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, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:49:19,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:19,906 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2025-03-04 07:49:19,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:49:19,907 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, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2025-03-04 07:49:19,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:19,908 INFO L225 Difference]: With dead ends: 129 [2025-03-04 07:49:19,908 INFO L226 Difference]: Without dead ends: 129 [2025-03-04 07:49:19,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=168, Unknown=1, NotChecked=26, Total=240 [2025-03-04 07:49:19,908 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 11 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:19,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 514 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 240 Invalid, 0 Unknown, 117 Unchecked, 0.1s Time] [2025-03-04 07:49:19,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-04 07:49:19,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-04 07:49:19,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 84 states have (on average 1.5357142857142858) internal successors, (129), 113 states have internal predecessors, (129), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-04 07:49:19,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2025-03-04 07:49:19,915 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 27 [2025-03-04 07:49:19,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:19,915 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2025-03-04 07:49:19,915 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, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:49:19,916 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2025-03-04 07:49:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:49:19,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:19,916 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] [2025-03-04 07:49:19,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:49:20,120 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:20,120 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 36 more)] === [2025-03-04 07:49:20,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:20,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1214833219, now seen corresponding path program 1 times [2025-03-04 07:49:20,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:20,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165237483] [2025-03-04 07:49:20,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:20,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:20,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:49:20,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:49:20,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:20,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:20,186 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:20,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:20,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165237483] [2025-03-04 07:49:20,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165237483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:20,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:20,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:49:20,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772199534] [2025-03-04 07:49:20,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:20,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:49:20,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:20,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:49:20,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:49:20,187 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:20,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:20,301 INFO L93 Difference]: Finished difference Result 149 states and 183 transitions. [2025-03-04 07:49:20,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:49:20,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2025-03-04 07:49:20,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:20,302 INFO L225 Difference]: With dead ends: 149 [2025-03-04 07:49:20,302 INFO L226 Difference]: Without dead ends: 149 [2025-03-04 07:49:20,302 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:20,303 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 27 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:20,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 340 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:20,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-04 07:49:20,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 144. [2025-03-04 07:49:20,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 126 states have internal predecessors, (154), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-04 07:49:20,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 180 transitions. [2025-03-04 07:49:20,312 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 180 transitions. Word has length 31 [2025-03-04 07:49:20,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:20,313 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 180 transitions. [2025-03-04 07:49:20,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:20,314 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 180 transitions. [2025-03-04 07:49:20,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:49:20,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:20,315 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] [2025-03-04 07:49:20,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:49:20,315 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 36 more)] === [2025-03-04 07:49:20,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:20,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1214833218, now seen corresponding path program 1 times [2025-03-04 07:49:20,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:20,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104067836] [2025-03-04 07:49:20,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:20,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:20,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:49:20,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:49:20,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:20,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:20,460 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:20,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:20,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104067836] [2025-03-04 07:49:20,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104067836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:20,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:20,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:49:20,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317056242] [2025-03-04 07:49:20,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:20,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:49:20,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:20,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:49:20,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:49:20,461 INFO L87 Difference]: Start difference. First operand 144 states and 180 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:20,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:20,593 INFO L93 Difference]: Finished difference Result 158 states and 194 transitions. [2025-03-04 07:49:20,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:49:20,593 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2025-03-04 07:49:20,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:20,594 INFO L225 Difference]: With dead ends: 158 [2025-03-04 07:49:20,594 INFO L226 Difference]: Without dead ends: 158 [2025-03-04 07:49:20,594 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:20,595 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 22 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:20,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 616 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:20,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-04 07:49:20,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2025-03-04 07:49:20,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 109 states have (on average 1.5412844036697249) internal successors, (168), 136 states have internal predecessors, (168), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-04 07:49:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 194 transitions. [2025-03-04 07:49:20,599 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 194 transitions. Word has length 31 [2025-03-04 07:49:20,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:20,599 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 194 transitions. [2025-03-04 07:49:20,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 194 transitions. [2025-03-04 07:49:20,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 07:49:20,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:20,600 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] [2025-03-04 07:49:20,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:49:20,600 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 36 more)] === [2025-03-04 07:49:20,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:20,600 INFO L85 PathProgramCache]: Analyzing trace with hash 776398668, now seen corresponding path program 1 times [2025-03-04 07:49:20,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:20,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905639118] [2025-03-04 07:49:20,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:20,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:20,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 07:49:20,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:49:20,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:20,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:20,663 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:20,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:20,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905639118] [2025-03-04 07:49:20,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905639118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:20,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:20,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:49:20,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439192615] [2025-03-04 07:49:20,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:20,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:49:20,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:20,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:49:20,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:49:20,665 INFO L87 Difference]: Start difference. First operand 154 states and 194 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:20,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:20,713 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2025-03-04 07:49:20,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:49:20,713 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2025-03-04 07:49:20,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:20,714 INFO L225 Difference]: With dead ends: 164 [2025-03-04 07:49:20,714 INFO L226 Difference]: Without dead ends: 164 [2025-03-04 07:49:20,714 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:20,715 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 27 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 657 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:20,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 657 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:20,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-04 07:49:20,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 155. [2025-03-04 07:49:20,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 110 states have (on average 1.518181818181818) internal successors, (167), 137 states have internal predecessors, (167), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-04 07:49:20,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 193 transitions. [2025-03-04 07:49:20,719 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 193 transitions. Word has length 33 [2025-03-04 07:49:20,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:20,719 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 193 transitions. [2025-03-04 07:49:20,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 193 transitions. [2025-03-04 07:49:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 07:49:20,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:20,720 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] [2025-03-04 07:49:20,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:49:20,720 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 36 more)] === [2025-03-04 07:49:20,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:20,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1701967368, now seen corresponding path program 1 times [2025-03-04 07:49:20,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:20,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108042256] [2025-03-04 07:49:20,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:20,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:20,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:49:20,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:49:20,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:20,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:21,018 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:21,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:21,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108042256] [2025-03-04 07:49:21,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108042256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:21,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:21,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 07:49:21,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056881125] [2025-03-04 07:49:21,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:21,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:49:21,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:21,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:49:21,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:49:21,021 INFO L87 Difference]: Start difference. First operand 155 states and 193 transitions. Second operand has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:21,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:21,372 INFO L93 Difference]: Finished difference Result 171 states and 210 transitions. [2025-03-04 07:49:21,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:49:21,373 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2025-03-04 07:49:21,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:21,374 INFO L225 Difference]: With dead ends: 171 [2025-03-04 07:49:21,374 INFO L226 Difference]: Without dead ends: 171 [2025-03-04 07:49:21,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:49:21,374 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 32 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:21,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 937 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:49:21,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-04 07:49:21,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 162. [2025-03-04 07:49:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 117 states have (on average 1.5042735042735043) internal successors, (176), 144 states have internal predecessors, (176), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-04 07:49:21,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 202 transitions. [2025-03-04 07:49:21,380 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 202 transitions. Word has length 34 [2025-03-04 07:49:21,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:21,380 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 202 transitions. [2025-03-04 07:49:21,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:21,380 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 202 transitions. [2025-03-04 07:49:21,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 07:49:21,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:21,381 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] [2025-03-04 07:49:21,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:49:21,381 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 36 more)] === [2025-03-04 07:49:21,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:21,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1701967367, now seen corresponding path program 1 times [2025-03-04 07:49:21,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:21,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208588305] [2025-03-04 07:49:21,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:21,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:21,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:49:21,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:49:21,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:21,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:21,784 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:21,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:21,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208588305] [2025-03-04 07:49:21,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208588305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:21,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:21,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 07:49:21,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199843607] [2025-03-04 07:49:21,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:21,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:49:21,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:21,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:49:21,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:49:21,786 INFO L87 Difference]: Start difference. First operand 162 states and 202 transitions. Second operand has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:22,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:22,117 INFO L93 Difference]: Finished difference Result 171 states and 209 transitions. [2025-03-04 07:49:22,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:49:22,121 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2025-03-04 07:49:22,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:22,122 INFO L225 Difference]: With dead ends: 171 [2025-03-04 07:49:22,122 INFO L226 Difference]: Without dead ends: 171 [2025-03-04 07:49:22,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:49:22,123 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 31 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:22,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 967 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:49:22,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-04 07:49:22,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 162. [2025-03-04 07:49:22,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 117 states have (on average 1.4957264957264957) internal successors, (175), 144 states have internal predecessors, (175), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2025-03-04 07:49:22,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 201 transitions. [2025-03-04 07:49:22,131 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 201 transitions. Word has length 34 [2025-03-04 07:49:22,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:22,131 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 201 transitions. [2025-03-04 07:49:22,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:22,131 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 201 transitions. [2025-03-04 07:49:22,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 07:49:22,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:22,132 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] [2025-03-04 07:49:22,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:49:22,132 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-04 07:49:22,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:22,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1141862958, now seen corresponding path program 1 times [2025-03-04 07:49:22,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:22,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843386971] [2025-03-04 07:49:22,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:22,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:22,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 07:49:22,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 07:49:22,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:22,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:22,539 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:49:22,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:22,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843386971] [2025-03-04 07:49:22,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843386971] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:22,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004574623] [2025-03-04 07:49:22,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:22,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:22,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:22,541 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:22,544 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:22,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 07:49:22,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 07:49:22,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:22,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:22,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 07:49:22,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:22,617 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:22,674 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:22,693 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_9|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_9| alloc_and_zero_internal_~pi~1.base 1)) (= .cse0 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0)) |v_old(#valid)_AFTER_CALL_9|)))) (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 false [2025-03-04 07:49:22,695 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_9|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_9| alloc_and_zero_internal_~pi~1.base 1)) (= .cse0 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0)) |v_old(#valid)_AFTER_CALL_9|)))) (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:22,711 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_9|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_9| alloc_and_zero_internal_~pi~1.base 1)) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0)) |v_old(#valid)_AFTER_CALL_9|) (= (select |c_#valid| .cse0) 1)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (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 false [2025-03-04 07:49:22,712 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_9|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_9| alloc_and_zero_internal_~pi~1.base 1)) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0)) |v_old(#valid)_AFTER_CALL_9|) (= (select |c_#valid| .cse0) 1)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (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:22,820 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:49:22,821 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:22,827 WARN L851 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_9|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_9| alloc_and_zero_internal_~pi~1.base 1)) (= (store |v_old(#valid)_AFTER_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0)) |v_old(#valid)_AFTER_CALL_9|) (= (select |c_#valid| .cse0) 1)))) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) is different from false [2025-03-04 07:49:22,829 WARN L873 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_9|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_9| alloc_and_zero_internal_~pi~1.base 1)) (= (store |v_old(#valid)_AFTER_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0)) |v_old(#valid)_AFTER_CALL_9|) (= (select |c_#valid| .cse0) 1)))) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) is different from true [2025-03-04 07:49:22,831 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-03-04 07:49:22,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:23,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004574623] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:23,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:23,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 18 [2025-03-04 07:49:23,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139877244] [2025-03-04 07:49:23,012 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:23,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 07:49:23,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:23,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 07:49:23,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=240, Unknown=7, NotChecked=140, Total=462 [2025-03-04 07:49:23,013 INFO L87 Difference]: Start difference. First operand 162 states and 201 transitions. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:49:23,265 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse1))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_9|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_9| alloc_and_zero_internal_~pi~1.base 1)) (= .cse0 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0)) |v_old(#valid)_AFTER_CALL_9|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (or (= |c_#valid| |c_old(#valid)|) (= .cse1 1)) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from false [2025-03-04 07:49:23,267 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse1))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_9|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_9| alloc_and_zero_internal_~pi~1.base 1)) (= .cse0 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0)) |v_old(#valid)_AFTER_CALL_9|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (or (= |c_#valid| |c_old(#valid)|) (= .cse1 1)) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from true [2025-03-04 07:49:23,271 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse1))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_9|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_9| alloc_and_zero_internal_~pi~1.base 1)) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0)) |v_old(#valid)_AFTER_CALL_9|) (= (select |c_#valid| .cse0) 1)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (or (= |c_#valid| |c_old(#valid)|) (= .cse1 1)) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from false [2025-03-04 07:49:23,274 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse1))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_9|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_9| alloc_and_zero_internal_~pi~1.base 1)) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_9| .cse0)) |v_old(#valid)_AFTER_CALL_9|) (= (select |c_#valid| .cse0) 1)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (or (= |c_#valid| |c_old(#valid)|) (= .cse1 1)) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from true [2025-03-04 07:49:23,279 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_9|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_9| alloc_and_zero_internal_~pi~1.base 1)) (= (store |v_old(#valid)_AFTER_CALL_10| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1)) |v_old(#valid)_AFTER_CALL_9|) (= (select |c_#valid| .cse1) 1)))) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))))) is different from false [2025-03-04 07:49:23,281 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_10| |v_old(#valid)_AFTER_CALL_9|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_9| alloc_and_zero_internal_~pi~1.base 1)) (= (store |v_old(#valid)_AFTER_CALL_10| .cse1 (select |v_old(#valid)_AFTER_CALL_9| .cse1)) |v_old(#valid)_AFTER_CALL_9|) (= (select |c_#valid| .cse1) 1)))) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))))) is different from true [2025-03-04 07:49:23,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:23,388 INFO L93 Difference]: Finished difference Result 178 states and 223 transitions. [2025-03-04 07:49:23,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:49:23,389 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2025-03-04 07:49:23,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:23,389 INFO L225 Difference]: With dead ends: 178 [2025-03-04 07:49:23,390 INFO L226 Difference]: Without dead ends: 178 [2025-03-04 07:49:23,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=393, Unknown=13, NotChecked=336, Total=870 [2025-03-04 07:49:23,390 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 26 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 747 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:23,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 572 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 467 Invalid, 0 Unknown, 747 Unchecked, 0.3s Time] [2025-03-04 07:49:23,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-04 07:49:23,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 169. [2025-03-04 07:49:23,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 123 states have (on average 1.4878048780487805) internal successors, (183), 150 states have internal predecessors, (183), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 15 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-04 07:49:23,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 213 transitions. [2025-03-04 07:49:23,394 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 213 transitions. Word has length 36 [2025-03-04 07:49:23,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:23,394 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 213 transitions. [2025-03-04 07:49:23,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:49:23,395 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 213 transitions. [2025-03-04 07:49:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 07:49:23,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:23,395 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] [2025-03-04 07:49:23,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 07:49:23,595 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:23,596 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-04 07:49:23,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:23,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1141862959, now seen corresponding path program 1 times [2025-03-04 07:49:23,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:23,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65693400] [2025-03-04 07:49:23,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:23,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:23,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 07:49:23,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 07:49:23,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:23,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:23,955 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:23,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:23,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65693400] [2025-03-04 07:49:23,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65693400] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:23,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405700962] [2025-03-04 07:49:23,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:23,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:23,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:23,958 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:23,959 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:24,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 07:49:24,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 07:49:24,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:24,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:24,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-04 07:49:24,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:24,060 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:24,064 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:24,216 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:24,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:24,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:24,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2025-03-04 07:49:24,354 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-04 07:49:24,354 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:24,357 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:24,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:24,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405700962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:24,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:24,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 18 [2025-03-04 07:49:24,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442768083] [2025-03-04 07:49:24,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:24,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 07:49:24,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:24,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 07:49:24,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=310, Unknown=1, NotChecked=36, Total=420 [2025-03-04 07:49:24,532 INFO L87 Difference]: Start difference. First operand 169 states and 213 transitions. Second operand has 19 states, 17 states have (on average 2.764705882352941) internal successors, (47), 15 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 7 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 07:49:25,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:25,017 INFO L93 Difference]: Finished difference Result 190 states and 240 transitions. [2025-03-04 07:49:25,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:49:25,018 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.764705882352941) internal successors, (47), 15 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 7 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 36 [2025-03-04 07:49:25,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:25,019 INFO L225 Difference]: With dead ends: 190 [2025-03-04 07:49:25,019 INFO L226 Difference]: Without dead ends: 190 [2025-03-04 07:49:25,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=378, Unknown=1, NotChecked=40, Total=506 [2025-03-04 07:49:25,019 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 40 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:25,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 580 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 610 Invalid, 0 Unknown, 154 Unchecked, 0.4s Time] [2025-03-04 07:49:25,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-04 07:49:25,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 175. [2025-03-04 07:49:25,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 129 states have (on average 1.4883720930232558) internal successors, (192), 155 states have internal predecessors, (192), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-04 07:49:25,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 222 transitions. [2025-03-04 07:49:25,026 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 222 transitions. Word has length 36 [2025-03-04 07:49:25,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:25,026 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 222 transitions. [2025-03-04 07:49:25,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.764705882352941) internal successors, (47), 15 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 7 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-04 07:49:25,027 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 222 transitions. [2025-03-04 07:49:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 07:49:25,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:25,028 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:25,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 07:49:25,230 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:25,230 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting create_internalErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-04 07:49:25,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:25,231 INFO L85 PathProgramCache]: Analyzing trace with hash -471579637, now seen corresponding path program 1 times [2025-03-04 07:49:25,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:25,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313403637] [2025-03-04 07:49:25,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:25,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:25,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 07:49:25,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:49:25,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:25,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:25,386 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:25,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:25,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313403637] [2025-03-04 07:49:25,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313403637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:25,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088253037] [2025-03-04 07:49:25,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:25,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:25,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:25,389 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:25,390 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:25,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 07:49:25,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:49:25,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:25,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:25,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 07:49:25,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:25,467 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:25,475 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:25,479 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:25,489 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:25,512 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:49:25,513 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:25,522 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:25,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:25,613 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:25,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088253037] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:49:25,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:49:25,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 13 [2025-03-04 07:49:25,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930140279] [2025-03-04 07:49:25,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:25,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 07:49:25,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:25,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 07:49:25,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2025-03-04 07:49:25,614 INFO L87 Difference]: Start difference. First operand 175 states and 222 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 07:49:25,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:25,981 INFO L93 Difference]: Finished difference Result 174 states and 221 transitions. [2025-03-04 07:49:25,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:49:25,981 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2025-03-04 07:49:25,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:25,982 INFO L225 Difference]: With dead ends: 174 [2025-03-04 07:49:25,982 INFO L226 Difference]: Without dead ends: 174 [2025-03-04 07:49:25,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 74 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=282, Unknown=1, NotChecked=34, Total=380 [2025-03-04 07:49:25,983 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 26 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:25,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 711 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 486 Invalid, 0 Unknown, 113 Unchecked, 0.3s Time] [2025-03-04 07:49:25,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-04 07:49:25,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2025-03-04 07:49:25,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 129 states have (on average 1.4806201550387597) internal successors, (191), 154 states have internal predecessors, (191), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-04 07:49:25,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 221 transitions. [2025-03-04 07:49:25,986 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 221 transitions. Word has length 39 [2025-03-04 07:49:25,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:25,986 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 221 transitions. [2025-03-04 07:49:25,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 07:49:25,987 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 221 transitions. [2025-03-04 07:49:25,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 07:49:25,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:25,987 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:25,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 07:49:26,191 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:26,191 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting create_internalErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-04 07:49:26,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:26,191 INFO L85 PathProgramCache]: Analyzing trace with hash -471579636, now seen corresponding path program 1 times [2025-03-04 07:49:26,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:26,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026781764] [2025-03-04 07:49:26,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:26,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:26,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 07:49:26,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:49:26,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:26,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:26,396 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:26,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:26,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026781764] [2025-03-04 07:49:26,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026781764] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:26,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384270003] [2025-03-04 07:49:26,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:26,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:26,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:26,399 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:26,401 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:26,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 07:49:26,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:49:26,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:26,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:26,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 07:49:26,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:26,487 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:26,489 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:26,551 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:26,554 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:26,582 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 26 treesize of output 14 [2025-03-04 07:49:26,651 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:26,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:26,669 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:26,675 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:49:26,676 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:26,692 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:26,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:26,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384270003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:26,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:26,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2025-03-04 07:49:26,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722434166] [2025-03-04 07:49:26,770 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:26,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 07:49:26,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:26,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 07:49:26,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=372, Unknown=1, NotChecked=38, Total=462 [2025-03-04 07:49:26,771 INFO L87 Difference]: Start difference. First operand 174 states and 221 transitions. Second operand has 20 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 15 states have internal predecessors, (45), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:49:27,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:27,215 INFO L93 Difference]: Finished difference Result 172 states and 219 transitions. [2025-03-04 07:49:27,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:49:27,219 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 15 states have internal predecessors, (45), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2025-03-04 07:49:27,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:27,220 INFO L225 Difference]: With dead ends: 172 [2025-03-04 07:49:27,220 INFO L226 Difference]: Without dead ends: 172 [2025-03-04 07:49:27,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=715, Unknown=1, NotChecked=54, Total=870 [2025-03-04 07:49:27,221 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 15 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:27,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1074 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 730 Invalid, 0 Unknown, 113 Unchecked, 0.3s Time] [2025-03-04 07:49:27,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-04 07:49:27,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-03-04 07:49:27,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 129 states have (on average 1.4651162790697674) internal successors, (189), 152 states have internal predecessors, (189), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-04 07:49:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 219 transitions. [2025-03-04 07:49:27,224 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 219 transitions. Word has length 39 [2025-03-04 07:49:27,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:27,225 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 219 transitions. [2025-03-04 07:49:27,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 15 states have internal predecessors, (45), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:49:27,225 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 219 transitions. [2025-03-04 07:49:27,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:49:27,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:27,225 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, 1, 1] [2025-03-04 07:49:27,232 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:27,426 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:27,426 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-04 07:49:27,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:27,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1220912809, now seen corresponding path program 1 times [2025-03-04 07:49:27,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:27,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812586256] [2025-03-04 07:49:27,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:27,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:27,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:49:27,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:49:27,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:27,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:27,978 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:27,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:27,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812586256] [2025-03-04 07:49:27,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812586256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:27,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183378945] [2025-03-04 07:49:27,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:27,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:27,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:27,981 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:27,984 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:28,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:49:28,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:49:28,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:28,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:28,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-03-04 07:49:28,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:28,073 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:28,154 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:28,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:49:28,324 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:49:28,324 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:28,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:28,366 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:28,632 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:49:28,637 INFO L349 Elim1Store]: treesize reduction 29, result has 9.4 percent of original size [2025-03-04 07:49:28,637 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:28,648 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 07:49:28,648 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:28,652 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:28,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:29,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:29,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1007 treesize of output 963 [2025-03-04 07:49:29,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:29,445 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 2769 treesize of output 2600 [2025-03-04 07:49:31,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183378945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:31,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:31,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 35 [2025-03-04 07:49:31,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137133599] [2025-03-04 07:49:31,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:31,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 07:49:31,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:31,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 07:49:31,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1620, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 07:49:31,625 INFO L87 Difference]: Start difference. First operand 172 states and 219 transitions. Second operand has 35 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 28 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:49:32,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:32,572 INFO L93 Difference]: Finished difference Result 177 states and 225 transitions. [2025-03-04 07:49:32,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 07:49:32,572 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 28 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2025-03-04 07:49:32,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:32,573 INFO L225 Difference]: With dead ends: 177 [2025-03-04 07:49:32,573 INFO L226 Difference]: Without dead ends: 177 [2025-03-04 07:49:32,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=170, Invalid=2586, Unknown=0, NotChecked=0, Total=2756 [2025-03-04 07:49:32,574 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 28 mSDsluCounter, 1803 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:32,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1885 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:49:32,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-04 07:49:32,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2025-03-04 07:49:32,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 131 states have (on average 1.4580152671755726) internal successors, (191), 154 states have internal predecessors, (191), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-04 07:49:32,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 221 transitions. [2025-03-04 07:49:32,580 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 221 transitions. Word has length 37 [2025-03-04 07:49:32,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:32,581 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 221 transitions. [2025-03-04 07:49:32,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 28 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:49:32,581 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 221 transitions. [2025-03-04 07:49:32,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 07:49:32,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:32,581 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, 1, 1, 1] [2025-03-04 07:49:32,588 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:32,782 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:32,782 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-04 07:49:32,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:32,783 INFO L85 PathProgramCache]: Analyzing trace with hash 833063185, now seen corresponding path program 1 times [2025-03-04 07:49:32,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:32,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301663881] [2025-03-04 07:49:32,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:32,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:32,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:49:32,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:49:32,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:32,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:33,236 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:33,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:33,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301663881] [2025-03-04 07:49:33,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301663881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:33,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696658353] [2025-03-04 07:49:33,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:33,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:33,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:33,238 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:33,239 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:33,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:49:33,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:49:33,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:33,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:33,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 07:49:33,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:33,410 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:33,461 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:33,492 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:33,492 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:49:33,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696658353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:33,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:49:33,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [18] total 30 [2025-03-04 07:49:33,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801412832] [2025-03-04 07:49:33,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:33,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 07:49:33,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:33,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 07:49:33,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=802, Unknown=0, NotChecked=0, Total=870 [2025-03-04 07:49:33,493 INFO L87 Difference]: Start difference. First operand 174 states and 221 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:33,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:33,658 INFO L93 Difference]: Finished difference Result 180 states and 224 transitions. [2025-03-04 07:49:33,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:49:33,658 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2025-03-04 07:49:33,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:33,659 INFO L225 Difference]: With dead ends: 180 [2025-03-04 07:49:33,659 INFO L226 Difference]: Without dead ends: 180 [2025-03-04 07:49:33,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=976, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 07:49:33,660 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 32 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:33,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1008 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:33,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-04 07:49:33,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2025-03-04 07:49:33,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 132 states have (on average 1.446969696969697) internal successors, (191), 155 states have internal predecessors, (191), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-04 07:49:33,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 221 transitions. [2025-03-04 07:49:33,663 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 221 transitions. Word has length 38 [2025-03-04 07:49:33,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:33,664 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 221 transitions. [2025-03-04 07:49:33,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:33,664 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 221 transitions. [2025-03-04 07:49:33,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 07:49:33,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:33,664 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, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:33,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 07:49:33,865 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:33,865 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-04 07:49:33,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:33,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1993281776, now seen corresponding path program 1 times [2025-03-04 07:49:33,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:33,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479498958] [2025-03-04 07:49:33,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:33,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:33,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:49:33,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:49:33,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:33,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:34,266 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:34,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:34,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479498958] [2025-03-04 07:49:34,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479498958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:34,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051867718] [2025-03-04 07:49:34,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:34,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:34,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:34,269 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:34,270 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:34,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:49:34,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:49:34,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:34,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:34,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-03-04 07:49:34,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:34,349 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:34,362 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:34,365 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:34,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 07:49:34,394 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 21 treesize of output 20 [2025-03-04 07:49:34,540 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) |c_#memory_$Pointer$#0.offset|))) is different from true [2025-03-04 07:49:34,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:34,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2025-03-04 07:49:34,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:34,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2025-03-04 07:49:34,598 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:49:34,598 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:34,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:34,639 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-03-04 07:49:34,640 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 1 case distinctions, treesize of input 36 treesize of output 27 [2025-03-04 07:49:34,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:34,650 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-03-04 07:49:34,650 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 1 case distinctions, treesize of input 36 treesize of output 27 [2025-03-04 07:49:34,688 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:34,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:34,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051867718] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:34,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:34,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2025-03-04 07:49:34,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271902134] [2025-03-04 07:49:34,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:34,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 07:49:34,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:34,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 07:49:34,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=578, Unknown=1, NotChecked=48, Total=702 [2025-03-04 07:49:34,889 INFO L87 Difference]: Start difference. First operand 175 states and 221 transitions. Second operand has 25 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 20 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:49:35,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:35,361 INFO L93 Difference]: Finished difference Result 180 states and 227 transitions. [2025-03-04 07:49:35,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 07:49:35,362 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 20 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2025-03-04 07:49:35,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:35,363 INFO L225 Difference]: With dead ends: 180 [2025-03-04 07:49:35,363 INFO L226 Difference]: Without dead ends: 180 [2025-03-04 07:49:35,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=888, Unknown=1, NotChecked=60, Total=1056 [2025-03-04 07:49:35,363 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 10 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:35,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1024 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 667 Invalid, 0 Unknown, 125 Unchecked, 0.3s Time] [2025-03-04 07:49:35,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-04 07:49:35,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2025-03-04 07:49:35,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 136 states have (on average 1.4338235294117647) internal successors, (195), 159 states have internal predecessors, (195), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-04 07:49:35,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 225 transitions. [2025-03-04 07:49:35,369 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 225 transitions. Word has length 41 [2025-03-04 07:49:35,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:35,369 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 225 transitions. [2025-03-04 07:49:35,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 20 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:49:35,370 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 225 transitions. [2025-03-04 07:49:35,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 07:49:35,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:35,370 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, 1] [2025-03-04 07:49:35,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 07:49:35,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:35,571 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-04 07:49:35,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:35,571 INFO L85 PathProgramCache]: Analyzing trace with hash -11609665, now seen corresponding path program 1 times [2025-03-04 07:49:35,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:35,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806924603] [2025-03-04 07:49:35,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:35,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:35,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 07:49:35,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 07:49:35,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:35,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:35,622 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:35,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:35,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806924603] [2025-03-04 07:49:35,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806924603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:35,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:35,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:49:35,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893086211] [2025-03-04 07:49:35,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:35,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:49:35,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:35,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:49:35,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:49:35,623 INFO L87 Difference]: Start difference. First operand 179 states and 225 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:35,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:35,755 INFO L93 Difference]: Finished difference Result 215 states and 265 transitions. [2025-03-04 07:49:35,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:49:35,756 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2025-03-04 07:49:35,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:35,756 INFO L225 Difference]: With dead ends: 215 [2025-03-04 07:49:35,756 INFO L226 Difference]: Without dead ends: 215 [2025-03-04 07:49:35,757 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:35,757 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 42 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:35,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 356 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:35,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-04 07:49:35,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 195. [2025-03-04 07:49:35,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 153 states have (on average 1.457516339869281) internal successors, (223), 175 states have internal predecessors, (223), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-04 07:49:35,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 253 transitions. [2025-03-04 07:49:35,761 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 253 transitions. Word has length 43 [2025-03-04 07:49:35,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:35,762 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 253 transitions. [2025-03-04 07:49:35,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:35,762 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 253 transitions. [2025-03-04 07:49:35,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 07:49:35,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:35,762 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, 1] [2025-03-04 07:49:35,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 07:49:35,763 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-04 07:49:35,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:35,763 INFO L85 PathProgramCache]: Analyzing trace with hash -11609664, now seen corresponding path program 1 times [2025-03-04 07:49:35,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:35,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687536273] [2025-03-04 07:49:35,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:35,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:35,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 07:49:35,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 07:49:35,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:35,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:35,880 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:35,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:35,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687536273] [2025-03-04 07:49:35,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687536273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:35,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823255103] [2025-03-04 07:49:35,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:35,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:35,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:35,883 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:35,884 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:35,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 07:49:35,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 07:49:35,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:35,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:35,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 07:49:35,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:36,115 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:36,115 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:49:36,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823255103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:36,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:49:36,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 18 [2025-03-04 07:49:36,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466306731] [2025-03-04 07:49:36,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:36,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:49:36,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:36,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:49:36,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:49:36,116 INFO L87 Difference]: Start difference. First operand 195 states and 253 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:36,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:36,281 INFO L93 Difference]: Finished difference Result 233 states and 296 transitions. [2025-03-04 07:49:36,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:49:36,282 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2025-03-04 07:49:36,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:36,285 INFO L225 Difference]: With dead ends: 233 [2025-03-04 07:49:36,285 INFO L226 Difference]: Without dead ends: 233 [2025-03-04 07:49:36,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:49:36,286 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 35 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:36,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 595 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:49:36,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-04 07:49:36,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 209. [2025-03-04 07:49:36,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 167 states have (on average 1.467065868263473) internal successors, (245), 189 states have internal predecessors, (245), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-04 07:49:36,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 275 transitions. [2025-03-04 07:49:36,293 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 275 transitions. Word has length 43 [2025-03-04 07:49:36,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:36,293 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 275 transitions. [2025-03-04 07:49:36,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:36,293 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 275 transitions. [2025-03-04 07:49:36,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 07:49:36,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:36,294 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:36,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 07:49:36,494 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,SelfDestructingSolverStorable21 [2025-03-04 07:49:36,495 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-04 07:49:36,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:36,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1150493918, now seen corresponding path program 1 times [2025-03-04 07:49:36,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:36,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082545936] [2025-03-04 07:49:36,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:36,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:36,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:49:36,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:49:36,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:36,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:36,625 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:49:36,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:36,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082545936] [2025-03-04 07:49:36,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082545936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:36,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:36,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:49:36,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945055395] [2025-03-04 07:49:36,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:36,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:49:36,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:36,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:49:36,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:49:36,627 INFO L87 Difference]: Start difference. First operand 209 states and 275 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:49:36,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:36,825 INFO L93 Difference]: Finished difference Result 209 states and 272 transitions. [2025-03-04 07:49:36,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:49:36,825 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 51 [2025-03-04 07:49:36,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:36,826 INFO L225 Difference]: With dead ends: 209 [2025-03-04 07:49:36,826 INFO L226 Difference]: Without dead ends: 209 [2025-03-04 07:49:36,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:49:36,827 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 8 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:36,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 480 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:49:36,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-04 07:49:36,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2025-03-04 07:49:36,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 167 states have (on average 1.4491017964071857) internal successors, (242), 189 states have internal predecessors, (242), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-04 07:49:36,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 272 transitions. [2025-03-04 07:49:36,831 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 272 transitions. Word has length 51 [2025-03-04 07:49:36,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:36,831 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 272 transitions. [2025-03-04 07:49:36,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:49:36,832 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 272 transitions. [2025-03-04 07:49:36,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 07:49:36,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:36,832 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:36,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 07:49:36,832 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-04 07:49:36,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:36,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1150493917, now seen corresponding path program 1 times [2025-03-04 07:49:36,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:36,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149141736] [2025-03-04 07:49:36,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:36,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:36,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:49:36,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:49:36,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:36,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:37,072 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:49:37,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:37,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149141736] [2025-03-04 07:49:37,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149141736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:37,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:37,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 07:49:37,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706817127] [2025-03-04 07:49:37,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:37,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 07:49:37,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:37,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 07:49:37,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:49:37,074 INFO L87 Difference]: Start difference. First operand 209 states and 272 transitions. Second operand has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:49:37,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:37,276 INFO L93 Difference]: Finished difference Result 209 states and 269 transitions. [2025-03-04 07:49:37,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:49:37,277 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 51 [2025-03-04 07:49:37,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:37,278 INFO L225 Difference]: With dead ends: 209 [2025-03-04 07:49:37,278 INFO L226 Difference]: Without dead ends: 209 [2025-03-04 07:49:37,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:49:37,278 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 9 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:37,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 645 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:49:37,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-04 07:49:37,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2025-03-04 07:49:37,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 167 states have (on average 1.4311377245508983) internal successors, (239), 189 states have internal predecessors, (239), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-04 07:49:37,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 269 transitions. [2025-03-04 07:49:37,286 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 269 transitions. Word has length 51 [2025-03-04 07:49:37,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:37,286 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 269 transitions. [2025-03-04 07:49:37,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:49:37,287 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 269 transitions. [2025-03-04 07:49:37,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 07:49:37,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:37,287 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, 1, 1] [2025-03-04 07:49:37,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 07:49:37,287 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-04 07:49:37,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:37,287 INFO L85 PathProgramCache]: Analyzing trace with hash -359899450, now seen corresponding path program 1 times [2025-03-04 07:49:37,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:37,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971959206] [2025-03-04 07:49:37,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:37,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:37,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:49:37,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:49:37,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:37,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:37,344 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:37,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:37,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971959206] [2025-03-04 07:49:37,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971959206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:49:37,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:49:37,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:49:37,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941981566] [2025-03-04 07:49:37,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:49:37,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:49:37,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:37,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:49:37,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:49:37,346 INFO L87 Difference]: Start difference. First operand 209 states and 269 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:37,408 INFO L93 Difference]: Finished difference Result 235 states and 302 transitions. [2025-03-04 07:49:37,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:49:37,408 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2025-03-04 07:49:37,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:37,409 INFO L225 Difference]: With dead ends: 235 [2025-03-04 07:49:37,409 INFO L226 Difference]: Without dead ends: 235 [2025-03-04 07:49:37,410 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:37,410 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 43 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 668 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:37,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 668 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:37,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-04 07:49:37,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 210. [2025-03-04 07:49:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 168 states have (on average 1.4166666666666667) internal successors, (238), 190 states have internal predecessors, (238), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-04 07:49:37,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 268 transitions. [2025-03-04 07:49:37,414 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 268 transitions. Word has length 44 [2025-03-04 07:49:37,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:37,414 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 268 transitions. [2025-03-04 07:49:37,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:49:37,414 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 268 transitions. [2025-03-04 07:49:37,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 07:49:37,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:37,416 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:37,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 07:49:37,416 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-04 07:49:37,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:37,416 INFO L85 PathProgramCache]: Analyzing trace with hash 2127593683, now seen corresponding path program 1 times [2025-03-04 07:49:37,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:37,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235481840] [2025-03-04 07:49:37,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:37,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:37,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 07:49:37,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 07:49:37,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:37,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:37,666 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:37,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:37,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235481840] [2025-03-04 07:49:37,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235481840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:37,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724781671] [2025-03-04 07:49:37,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:37,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:37,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:37,669 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:37,672 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:37,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 07:49:37,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 07:49:37,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:37,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:37,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 07:49:37,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:37,811 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:37,857 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:37,861 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:37,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:37,876 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:37,933 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 07:49:37,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2025-03-04 07:49:37,944 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:37,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724781671] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:49:37,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:49:37,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 21 [2025-03-04 07:49:37,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845155623] [2025-03-04 07:49:37,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:37,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 07:49:37,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:37,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 07:49:37,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2025-03-04 07:49:37,945 INFO L87 Difference]: Start difference. First operand 210 states and 268 transitions. Second operand has 22 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-04 07:49:38,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:38,245 INFO L93 Difference]: Finished difference Result 228 states and 288 transitions. [2025-03-04 07:49:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 07:49:38,249 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 46 [2025-03-04 07:49:38,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:38,249 INFO L225 Difference]: With dead ends: 228 [2025-03-04 07:49:38,249 INFO L226 Difference]: Without dead ends: 228 [2025-03-04 07:49:38,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:49:38,250 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 27 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:38,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1435 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:49:38,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-04 07:49:38,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 217. [2025-03-04 07:49:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 175 states have (on average 1.4057142857142857) internal successors, (246), 197 states have internal predecessors, (246), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-04 07:49:38,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 276 transitions. [2025-03-04 07:49:38,254 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 276 transitions. Word has length 46 [2025-03-04 07:49:38,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:38,254 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 276 transitions. [2025-03-04 07:49:38,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-04 07:49:38,254 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 276 transitions. [2025-03-04 07:49:38,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 07:49:38,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:38,255 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:38,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 07:49:38,459 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,SelfDestructingSolverStorable25 [2025-03-04 07:49:38,459 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-04 07:49:38,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:38,459 INFO L85 PathProgramCache]: Analyzing trace with hash 2127593684, now seen corresponding path program 1 times [2025-03-04 07:49:38,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:38,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412023169] [2025-03-04 07:49:38,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:38,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:38,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 07:49:38,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 07:49:38,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:38,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:38,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:49:38,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:38,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412023169] [2025-03-04 07:49:38,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412023169] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:38,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077625922] [2025-03-04 07:49:38,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:49:38,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:38,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:38,938 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:38,939 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:39,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 07:49:39,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 07:49:39,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:49:39,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:39,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-04 07:49:39,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:39,182 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:39,184 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:39,263 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:39,302 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:39,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:39,435 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:39,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:39,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:39,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:39,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:49:39,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:39,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2025-03-04 07:49:39,691 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:39,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077625922] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:49:39,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:49:39,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14, 14] total 48 [2025-03-04 07:49:39,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241669591] [2025-03-04 07:49:39,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:39,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-04 07:49:39,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:39,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-04 07:49:39,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2205, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 07:49:39,693 INFO L87 Difference]: Start difference. First operand 217 states and 276 transitions. Second operand has 49 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 41 states have internal predecessors, (100), 6 states have call successors, (7), 2 states have call predecessors, (7), 9 states have return successors, (11), 11 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-04 07:49:40,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:40,476 INFO L93 Difference]: Finished difference Result 227 states and 285 transitions. [2025-03-04 07:49:40,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 07:49:40,477 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 41 states have internal predecessors, (100), 6 states have call successors, (7), 2 states have call predecessors, (7), 9 states have return successors, (11), 11 states have call predecessors, (11), 6 states have call successors, (11) Word has length 46 [2025-03-04 07:49:40,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:40,478 INFO L225 Difference]: With dead ends: 227 [2025-03-04 07:49:40,478 INFO L226 Difference]: Without dead ends: 227 [2025-03-04 07:49:40,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=235, Invalid=3425, Unknown=0, NotChecked=0, Total=3660 [2025-03-04 07:49:40,479 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 62 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:40,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1521 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:49:40,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-04 07:49:40,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 217. [2025-03-04 07:49:40,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 175 states have (on average 1.4) internal successors, (245), 197 states have internal predecessors, (245), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-04 07:49:40,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 275 transitions. [2025-03-04 07:49:40,485 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 275 transitions. Word has length 46 [2025-03-04 07:49:40,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:40,487 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 275 transitions. [2025-03-04 07:49:40,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 41 states have internal predecessors, (100), 6 states have call successors, (7), 2 states have call predecessors, (7), 9 states have return successors, (11), 11 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-04 07:49:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 275 transitions. [2025-03-04 07:49:40,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 07:49:40,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:40,489 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:40,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 07:49:40,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 07:49:40,690 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-04 07:49:40,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:40,690 INFO L85 PathProgramCache]: Analyzing trace with hash 563060297, now seen corresponding path program 2 times [2025-03-04 07:49:40,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:40,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336140230] [2025-03-04 07:49:40,690 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:49:40,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:40,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-04 07:49:40,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 07:49:40,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:49:40,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:41,336 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:49:41,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:41,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336140230] [2025-03-04 07:49:41,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336140230] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:41,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395778080] [2025-03-04 07:49:41,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:49:41,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:41,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:41,338 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:49:41,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 07:49:41,406 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-04 07:49:41,428 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 07:49:41,428 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:49:41,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:41,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 07:49:41,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:41,434 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:41,525 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:41,553 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_46|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| alloc_and_zero_internal_~pi~1.base 1)) (= c_create_internal_~now~0.base .cse0) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)) |v_old(#valid)_AFTER_CALL_46|)))) (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 false [2025-03-04 07:49:41,555 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_46|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| alloc_and_zero_internal_~pi~1.base 1)) (= c_create_internal_~now~0.base .cse0) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)) |v_old(#valid)_AFTER_CALL_46|)))) (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:41,576 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_46|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse0) 1) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)) |v_old(#valid)_AFTER_CALL_46|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (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 false [2025-03-04 07:49:41,584 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_46|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse0) 1) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)) |v_old(#valid)_AFTER_CALL_46|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (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:41,663 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (create_internal_~now~0.base Int) (v_alloc_and_zero_internal_~pi~1.base_97 Int)) (let ((.cse0 (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_97 1))) (and (= |c_#valid| (store .cse0 alloc_and_zero_internal_~pi~1.base 1)) (= (select .cse0 create_internal_~now~0.base) 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_98 Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (let ((.cse2 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_46|)) (.cse1 (store |v_old(#valid)_AFTER_CALL_46| v_alloc_and_zero_internal_~pi~1.base_98 1))) (and (= 1 (select .cse1 .cse2)) (= (store |c_old(#valid)| .cse2 (select |v_old(#valid)_AFTER_CALL_46| .cse2)) |v_old(#valid)_AFTER_CALL_46|) (= |c_#valid| (store .cse1 alloc_and_zero_internal_~pi~1.base 1)))))) is different from false [2025-03-04 07:49:41,665 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (create_internal_~now~0.base Int) (v_alloc_and_zero_internal_~pi~1.base_97 Int)) (let ((.cse0 (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_97 1))) (and (= |c_#valid| (store .cse0 alloc_and_zero_internal_~pi~1.base 1)) (= (select .cse0 create_internal_~now~0.base) 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_98 Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (let ((.cse2 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_46|)) (.cse1 (store |v_old(#valid)_AFTER_CALL_46| v_alloc_and_zero_internal_~pi~1.base_98 1))) (and (= 1 (select .cse1 .cse2)) (= (store |c_old(#valid)| .cse2 (select |v_old(#valid)_AFTER_CALL_46| .cse2)) |v_old(#valid)_AFTER_CALL_46|) (= |c_#valid| (store .cse1 alloc_and_zero_internal_~pi~1.base 1)))))) is different from true [2025-03-04 07:49:41,790 INFO L349 Elim1Store]: treesize reduction 70, result has 28.6 percent of original size [2025-03-04 07:49:41,791 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 4 case distinctions, treesize of input 29 treesize of output 48 [2025-03-04 07:49:41,807 WARN L851 $PredicateComparison]: unable to prove that (or (and (exists ((v_alloc_and_zero_internal_~pi~1.base_97 Int)) (= 1 (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_97))) (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_98 Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_46|)) (.cse1 (store |v_old(#valid)_AFTER_CALL_46| v_alloc_and_zero_internal_~pi~1.base_98 1))) (and (= (store |v_old(#valid)_AFTER_CALL_48| .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)) |v_old(#valid)_AFTER_CALL_46|) (= (select .cse1 .cse0) 1) (= |c_#valid| (store .cse1 alloc_and_zero_internal_~pi~1.base 1)))))))) is different from false [2025-03-04 07:49:41,809 WARN L873 $PredicateComparison]: unable to prove that (or (and (exists ((v_alloc_and_zero_internal_~pi~1.base_97 Int)) (= 1 (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_97))) (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_98 Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_46|)) (.cse1 (store |v_old(#valid)_AFTER_CALL_46| v_alloc_and_zero_internal_~pi~1.base_98 1))) (and (= (store |v_old(#valid)_AFTER_CALL_48| .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)) |v_old(#valid)_AFTER_CALL_46|) (= (select .cse1 .cse0) 1) (= |c_#valid| (store .cse1 alloc_and_zero_internal_~pi~1.base 1)))))))) is different from true [2025-03-04 07:49:41,809 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 19 not checked. [2025-03-04 07:49:41,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:49:41,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395778080] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:41,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:49:41,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 25 [2025-03-04 07:49:41,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343905525] [2025-03-04 07:49:41,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:49:41,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 07:49:41,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:49:41,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 07:49:41,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=380, Unknown=9, NotChecked=220, Total=702 [2025-03-04 07:49:41,959 INFO L87 Difference]: Start difference. First operand 217 states and 275 transitions. Second operand has 26 states, 25 states have (on average 2.36) internal successors, (59), 19 states have internal predecessors, (59), 7 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-04 07:49:42,262 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse3))) (let ((.cse14 (store |c_old(#valid)| .cse3 .cse8))) (let ((.cse5 (@diff .cse14 |c_#valid|))) (let ((.cse9 (select |c_#valid| .cse5))) (let ((.cse13 (store .cse14 .cse5 .cse9))) (let ((.cse11 (@diff .cse13 |c_#valid|))) (let ((.cse10 (select |c_#valid| .cse11)) (.cse4 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse6 (= (select |c_old(#valid)| .cse5) 0)) (.cse7 (= |c_#valid| .cse14)) (.cse12 (= |c_#valid| .cse13)) (.cse1 (= |c_#valid| |c_old(#valid)|)) (.cse2 (= (select |c_old(#valid)| .cse3) 0))) (and (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_46|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| alloc_and_zero_internal_~pi~1.base 1)) (= c_create_internal_~now~0.base .cse0) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)) |v_old(#valid)_AFTER_CALL_46|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (or .cse1 .cse2 (= .cse3 .cse4)) (or .cse1 .cse2 (= |c_create_internal_#t~mem8.base| .cse3)) (or .cse1 (= .cse3 |c_create_internal_#t~ret7.base|) .cse2) (or (= .cse5 |c_create_internal_#t~mem8.base|) .cse6 .cse7) (or .cse1 .cse2 (= .cse8 1)) (or (= .cse9 1) .cse6 .cse7) (or (= .cse10 1) (= (select |c_old(#valid)| .cse11) 0) .cse12) (or (= .cse5 |c_create_internal_#t~ret7.base|) .cse6 .cse7) (= |c_#valid| (store .cse13 .cse11 .cse10)) (or (= .cse5 c_create_internal_~now~0.base) .cse6 .cse7) (or (= .cse5 .cse4) .cse6 .cse7) .cse12 (or .cse1 .cse2 (= c_create_internal_~now~0.base .cse3))))))))))) is different from false [2025-03-04 07:49:42,267 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse3))) (let ((.cse14 (store |c_old(#valid)| .cse3 .cse8))) (let ((.cse5 (@diff .cse14 |c_#valid|))) (let ((.cse9 (select |c_#valid| .cse5))) (let ((.cse13 (store .cse14 .cse5 .cse9))) (let ((.cse11 (@diff .cse13 |c_#valid|))) (let ((.cse10 (select |c_#valid| .cse11)) (.cse4 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse6 (= (select |c_old(#valid)| .cse5) 0)) (.cse7 (= |c_#valid| .cse14)) (.cse12 (= |c_#valid| .cse13)) (.cse1 (= |c_#valid| |c_old(#valid)|)) (.cse2 (= (select |c_old(#valid)| .cse3) 0))) (and (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_46|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| alloc_and_zero_internal_~pi~1.base 1)) (= c_create_internal_~now~0.base .cse0) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)) |v_old(#valid)_AFTER_CALL_46|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (or .cse1 .cse2 (= .cse3 .cse4)) (or .cse1 .cse2 (= |c_create_internal_#t~mem8.base| .cse3)) (or .cse1 (= .cse3 |c_create_internal_#t~ret7.base|) .cse2) (or (= .cse5 |c_create_internal_#t~mem8.base|) .cse6 .cse7) (or .cse1 .cse2 (= .cse8 1)) (or (= .cse9 1) .cse6 .cse7) (or (= .cse10 1) (= (select |c_old(#valid)| .cse11) 0) .cse12) (or (= .cse5 |c_create_internal_#t~ret7.base|) .cse6 .cse7) (= |c_#valid| (store .cse13 .cse11 .cse10)) (or (= .cse5 c_create_internal_~now~0.base) .cse6 .cse7) (or (= .cse5 .cse4) .cse6 .cse7) .cse12 (or .cse1 .cse2 (= c_create_internal_~now~0.base .cse3))))))))))) is different from true [2025-03-04 07:49:42,282 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse2))) (let ((.cse14 (store |c_old(#valid)| .cse2 .cse4))) (let ((.cse12 (@diff .cse14 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse12))) (let ((.cse11 (store .cse14 .cse12 .cse5))) (let ((.cse9 (@diff .cse11 |c_#valid|))) (let ((.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse2) 0)) (.cse8 (select |c_#valid| .cse9)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse6 (= (select |c_old(#valid)| .cse12) 0)) (.cse7 (= |c_#valid| .cse14)) (.cse10 (= |c_#valid| .cse11))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse0 .cse1 (= .cse4 1)) (or (= .cse5 1) .cse6 .cse7) (or (= .cse8 1) (= (select |c_old(#valid)| .cse9) 0) .cse10) (= |c_#valid| (store .cse11 .cse9 .cse8)) (or (= .cse12 .cse3) .cse6 .cse7) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (let ((.cse13 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_46|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse13) 1) (= (store |c_old(#valid)| .cse13 (select |v_old(#valid)_AFTER_CALL_46| .cse13)) |v_old(#valid)_AFTER_CALL_46|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) .cse10))))))))) is different from false [2025-03-04 07:49:42,287 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse2))) (let ((.cse14 (store |c_old(#valid)| .cse2 .cse4))) (let ((.cse12 (@diff .cse14 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse12))) (let ((.cse11 (store .cse14 .cse12 .cse5))) (let ((.cse9 (@diff .cse11 |c_#valid|))) (let ((.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse2) 0)) (.cse8 (select |c_#valid| .cse9)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse6 (= (select |c_old(#valid)| .cse12) 0)) (.cse7 (= |c_#valid| .cse14)) (.cse10 (= |c_#valid| .cse11))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse0 .cse1 (= .cse4 1)) (or (= .cse5 1) .cse6 .cse7) (or (= .cse8 1) (= (select |c_old(#valid)| .cse9) 0) .cse10) (= |c_#valid| (store .cse11 .cse9 .cse8)) (or (= .cse12 .cse3) .cse6 .cse7) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (let ((.cse13 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_46|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse13) 1) (= (store |c_old(#valid)| .cse13 (select |v_old(#valid)_AFTER_CALL_46| .cse13)) |v_old(#valid)_AFTER_CALL_46|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) .cse10))))))))) is different from true [2025-03-04 07:49:42,293 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse2))) (let ((.cse13 (store |c_old(#valid)| .cse2 .cse6))) (let ((.cse3 (@diff .cse13 |c_#valid|))) (let ((.cse7 (select |c_#valid| .cse3))) (let ((.cse11 (store .cse13 .cse3 .cse7))) (let ((.cse9 (@diff .cse11 |c_#valid|))) (let ((.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse2) 0)) (.cse4 (= (select |c_old(#valid)| .cse3) 0)) (.cse5 (= |c_#valid| .cse13)) (.cse8 (select |c_#valid| .cse9)) (.cse10 (= |c_#valid| .cse11))) (and (or .cse0 .cse1 (= |c_create_internal_#t~mem8.base| .cse2)) (or (= .cse3 |c_create_internal_#t~mem8.base|) .cse4 .cse5) (or .cse0 .cse1 (= .cse6 1)) (or (= .cse7 1) .cse4 .cse5) (or (= .cse8 1) (= (select |c_old(#valid)| .cse9) 0) .cse10) (= |c_#valid| (store .cse11 .cse9 .cse8)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (let ((.cse12 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_46|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse12) 1) (= (store |c_old(#valid)| .cse12 (select |v_old(#valid)_AFTER_CALL_46| .cse12)) |v_old(#valid)_AFTER_CALL_46|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) .cse10))))))))) is different from false [2025-03-04 07:49:42,297 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse2))) (let ((.cse13 (store |c_old(#valid)| .cse2 .cse6))) (let ((.cse3 (@diff .cse13 |c_#valid|))) (let ((.cse7 (select |c_#valid| .cse3))) (let ((.cse11 (store .cse13 .cse3 .cse7))) (let ((.cse9 (@diff .cse11 |c_#valid|))) (let ((.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse2) 0)) (.cse4 (= (select |c_old(#valid)| .cse3) 0)) (.cse5 (= |c_#valid| .cse13)) (.cse8 (select |c_#valid| .cse9)) (.cse10 (= |c_#valid| .cse11))) (and (or .cse0 .cse1 (= |c_create_internal_#t~mem8.base| .cse2)) (or (= .cse3 |c_create_internal_#t~mem8.base|) .cse4 .cse5) (or .cse0 .cse1 (= .cse6 1)) (or (= .cse7 1) .cse4 .cse5) (or (= .cse8 1) (= (select |c_old(#valid)| .cse9) 0) .cse10) (= |c_#valid| (store .cse11 .cse9 .cse8)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (let ((.cse12 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_46|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse12) 1) (= (store |c_old(#valid)| .cse12 (select |v_old(#valid)_AFTER_CALL_46| .cse12)) |v_old(#valid)_AFTER_CALL_46|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) .cse10))))))))) is different from true [2025-03-04 07:49:42,303 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse2 (select |c_#valid| .cse12))) (let ((.cse13 (store |c_old(#valid)| .cse12 .cse2))) (let ((.cse10 (@diff .cse13 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse10))) (let ((.cse9 (store .cse13 .cse10 .cse3))) (let ((.cse7 (@diff .cse9 |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse7)) (.cse4 (= (select |c_old(#valid)| .cse10) 0)) (.cse5 (= |c_#valid| .cse13)) (.cse8 (= |c_#valid| .cse9)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse12) 0))) (and (or .cse0 .cse1 (= .cse2 1)) (or (= .cse3 1) .cse4 .cse5) (or (= .cse6 1) (= (select |c_old(#valid)| .cse7) 0) .cse8) (= |c_#valid| (store .cse9 .cse7 .cse6)) (or (= .cse10 c_create_internal_~now~0.base) .cse4 .cse5) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (let ((.cse11 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_46|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse11) 1) (= (store |c_old(#valid)| .cse11 (select |v_old(#valid)_AFTER_CALL_46| .cse11)) |v_old(#valid)_AFTER_CALL_46|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) .cse8 (or .cse0 .cse1 (= c_create_internal_~now~0.base .cse12))))))))))) is different from false [2025-03-04 07:49:42,307 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse12 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse2 (select |c_#valid| .cse12))) (let ((.cse13 (store |c_old(#valid)| .cse12 .cse2))) (let ((.cse10 (@diff .cse13 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse10))) (let ((.cse9 (store .cse13 .cse10 .cse3))) (let ((.cse7 (@diff .cse9 |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse7)) (.cse4 (= (select |c_old(#valid)| .cse10) 0)) (.cse5 (= |c_#valid| .cse13)) (.cse8 (= |c_#valid| .cse9)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse12) 0))) (and (or .cse0 .cse1 (= .cse2 1)) (or (= .cse3 1) .cse4 .cse5) (or (= .cse6 1) (= (select |c_old(#valid)| .cse7) 0) .cse8) (= |c_#valid| (store .cse9 .cse7 .cse6)) (or (= .cse10 c_create_internal_~now~0.base) .cse4 .cse5) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (let ((.cse11 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_46|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse11) 1) (= (store |c_old(#valid)| .cse11 (select |v_old(#valid)_AFTER_CALL_46| .cse11)) |v_old(#valid)_AFTER_CALL_46|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) .cse8 (or .cse0 .cse1 (= c_create_internal_~now~0.base .cse12))))))))))) is different from true [2025-03-04 07:49:42,312 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (let ((.cse0 (@diff .cse1 |c_#valid|))) (and (or (= .cse0 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse0) 0) (= |c_#valid| .cse1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (let ((.cse2 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_46|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse2) 1) (= (store |c_old(#valid)| .cse2 (select |v_old(#valid)_AFTER_CALL_46| .cse2)) |v_old(#valid)_AFTER_CALL_46|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (= |c_#valid| (store .cse1 .cse0 (select |c_#valid| .cse0))) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse3) 0) (= c_create_internal_~now~0.base .cse3)))))) is different from false [2025-03-04 07:49:42,315 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (let ((.cse0 (@diff .cse1 |c_#valid|))) (and (or (= .cse0 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse0) 0) (= |c_#valid| .cse1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (let ((.cse2 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_46|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse2) 1) (= (store |c_old(#valid)| .cse2 (select |v_old(#valid)_AFTER_CALL_46| .cse2)) |v_old(#valid)_AFTER_CALL_46|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (= |c_#valid| (store .cse1 .cse0 (select |c_#valid| .cse0))) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse3) 0) (= c_create_internal_~now~0.base .cse3)))))) is different from true [2025-03-04 07:49:42,413 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse7 (select |c_#valid| .cse6))) (let ((.cse10 (store |c_old(#valid)| .cse6 .cse7))) (let ((.cse9 (@diff .cse10 |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse9))) (let ((.cse5 (store .cse10 .cse9 .cse8))) (let ((.cse4 (@diff .cse5 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse4))) (and (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (create_internal_~now~0.base Int) (v_alloc_and_zero_internal_~pi~1.base_97 Int)) (let ((.cse0 (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_97 1))) (and (= |c_#valid| (store .cse0 alloc_and_zero_internal_~pi~1.base 1)) (= (select .cse0 create_internal_~now~0.base) 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_98 Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (let ((.cse2 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_46|)) (.cse1 (store |v_old(#valid)_AFTER_CALL_46| v_alloc_and_zero_internal_~pi~1.base_98 1))) (and (= 1 (select .cse1 .cse2)) (= (store |c_old(#valid)| .cse2 (select |v_old(#valid)_AFTER_CALL_46| .cse2)) |v_old(#valid)_AFTER_CALL_46|) (= |c_#valid| (store .cse1 alloc_and_zero_internal_~pi~1.base 1)))))) (or (= .cse3 1) (= (select |c_old(#valid)| .cse4) 0) (= .cse4 c_create_internal_~now~0.base) (= |c_#valid| .cse5)) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse6) 0) (= .cse7 1) (= c_create_internal_~now~0.base .cse6)) (= |c_#valid| (store .cse5 .cse4 .cse3)) (or (= .cse8 1) (= .cse9 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse9) 0) (= |c_#valid| .cse10))))))))))) is different from false [2025-03-04 07:49:42,416 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse7 (select |c_#valid| .cse6))) (let ((.cse10 (store |c_old(#valid)| .cse6 .cse7))) (let ((.cse9 (@diff .cse10 |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse9))) (let ((.cse5 (store .cse10 .cse9 .cse8))) (let ((.cse4 (@diff .cse5 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse4))) (and (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (create_internal_~now~0.base Int) (v_alloc_and_zero_internal_~pi~1.base_97 Int)) (let ((.cse0 (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_97 1))) (and (= |c_#valid| (store .cse0 alloc_and_zero_internal_~pi~1.base 1)) (= (select .cse0 create_internal_~now~0.base) 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_98 Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (let ((.cse2 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_46|)) (.cse1 (store |v_old(#valid)_AFTER_CALL_46| v_alloc_and_zero_internal_~pi~1.base_98 1))) (and (= 1 (select .cse1 .cse2)) (= (store |c_old(#valid)| .cse2 (select |v_old(#valid)_AFTER_CALL_46| .cse2)) |v_old(#valid)_AFTER_CALL_46|) (= |c_#valid| (store .cse1 alloc_and_zero_internal_~pi~1.base 1)))))) (or (= .cse3 1) (= (select |c_old(#valid)| .cse4) 0) (= .cse4 c_create_internal_~now~0.base) (= |c_#valid| .cse5)) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse6) 0) (= .cse7 1) (= c_create_internal_~now~0.base .cse6)) (= |c_#valid| (store .cse5 .cse4 .cse3)) (or (= .cse8 1) (= .cse9 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse9) 0) (= |c_#valid| .cse10))))))))))) is different from true [2025-03-04 07:49:42,423 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (let ((.cse7 (store |c_old(#valid)| .cse3 .cse4))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (let ((.cse10 (store .cse7 .cse6 .cse5))) (let ((.cse9 (@diff .cse10 |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse9))) (and (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (create_internal_~now~0.base Int) (v_alloc_and_zero_internal_~pi~1.base_97 Int)) (let ((.cse0 (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_97 1))) (and (= |c_#valid| (store .cse0 alloc_and_zero_internal_~pi~1.base 1)) (= (select .cse0 create_internal_~now~0.base) 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_98 Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (let ((.cse2 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_46|)) (.cse1 (store |v_old(#valid)_AFTER_CALL_46| v_alloc_and_zero_internal_~pi~1.base_98 1))) (and (= 1 (select .cse1 .cse2)) (= (store |c_old(#valid)| .cse2 (select |v_old(#valid)_AFTER_CALL_46| .cse2)) |v_old(#valid)_AFTER_CALL_46|) (= |c_#valid| (store .cse1 alloc_and_zero_internal_~pi~1.base 1)))))) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse3) 0) (= .cse4 1)) (or (= .cse5 1) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (or (= .cse8 1) (= (select |c_old(#valid)| .cse9) 0) (= |c_#valid| .cse10)) (= |c_#valid| (store .cse10 .cse9 .cse8))))))))))) is different from false [2025-03-04 07:49:42,426 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (let ((.cse7 (store |c_old(#valid)| .cse3 .cse4))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (let ((.cse10 (store .cse7 .cse6 .cse5))) (let ((.cse9 (@diff .cse10 |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse9))) (and (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (create_internal_~now~0.base Int) (v_alloc_and_zero_internal_~pi~1.base_97 Int)) (let ((.cse0 (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_97 1))) (and (= |c_#valid| (store .cse0 alloc_and_zero_internal_~pi~1.base 1)) (= (select .cse0 create_internal_~now~0.base) 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_98 Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (let ((.cse2 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_46|)) (.cse1 (store |v_old(#valid)_AFTER_CALL_46| v_alloc_and_zero_internal_~pi~1.base_98 1))) (and (= 1 (select .cse1 .cse2)) (= (store |c_old(#valid)| .cse2 (select |v_old(#valid)_AFTER_CALL_46| .cse2)) |v_old(#valid)_AFTER_CALL_46|) (= |c_#valid| (store .cse1 alloc_and_zero_internal_~pi~1.base 1)))))) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse3) 0) (= .cse4 1)) (or (= .cse5 1) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (or (= .cse8 1) (= (select |c_old(#valid)| .cse9) 0) (= |c_#valid| .cse10)) (= |c_#valid| (store .cse10 .cse9 .cse8))))))))))) is different from true [2025-03-04 07:49:42,432 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (and (exists ((v_alloc_and_zero_internal_~pi~1.base_97 Int)) (= 1 (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_97))) .cse0 (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_98 Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_46|)) (.cse2 (store |v_old(#valid)_AFTER_CALL_46| v_alloc_and_zero_internal_~pi~1.base_98 1))) (and (= (store |v_old(#valid)_AFTER_CALL_48| .cse1 (select |v_old(#valid)_AFTER_CALL_46| .cse1)) |v_old(#valid)_AFTER_CALL_46|) (= (select .cse2 .cse1) 1) (= |c_#valid| (store .cse2 alloc_and_zero_internal_~pi~1.base 1)))))))))) is different from false [2025-03-04 07:49:42,433 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (and (exists ((v_alloc_and_zero_internal_~pi~1.base_97 Int)) (= 1 (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_97))) .cse0 (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_old(#valid)_AFTER_CALL_48| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_48| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_98 Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_48| |v_old(#valid)_AFTER_CALL_46|)) (.cse2 (store |v_old(#valid)_AFTER_CALL_46| v_alloc_and_zero_internal_~pi~1.base_98 1))) (and (= (store |v_old(#valid)_AFTER_CALL_48| .cse1 (select |v_old(#valid)_AFTER_CALL_46| .cse1)) |v_old(#valid)_AFTER_CALL_46|) (= (select .cse2 .cse1) 1) (= |c_#valid| (store .cse2 alloc_and_zero_internal_~pi~1.base 1)))))))))) is different from true [2025-03-04 07:49:42,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:49:42,567 INFO L93 Difference]: Finished difference Result 243 states and 313 transitions. [2025-03-04 07:49:42,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:49:42,568 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.36) internal successors, (59), 19 states have internal predecessors, (59), 7 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Word has length 48 [2025-03-04 07:49:42,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:49:42,569 INFO L225 Difference]: With dead ends: 243 [2025-03-04 07:49:42,569 INFO L226 Difference]: Without dead ends: 243 [2025-03-04 07:49:42,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=598, Unknown=25, NotChecked=832, Total=1640 [2025-03-04 07:49:42,569 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 40 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 1865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1176 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:49:42,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 803 Invalid, 1865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 643 Invalid, 0 Unknown, 1176 Unchecked, 0.4s Time] [2025-03-04 07:49:42,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-04 07:49:42,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 228. [2025-03-04 07:49:42,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 184 states have (on average 1.4076086956521738) internal successors, (259), 204 states have internal predecessors, (259), 12 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) [2025-03-04 07:49:42,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 295 transitions. [2025-03-04 07:49:42,573 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 295 transitions. Word has length 48 [2025-03-04 07:49:42,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:49:42,574 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 295 transitions. [2025-03-04 07:49:42,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.36) internal successors, (59), 19 states have internal predecessors, (59), 7 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-04 07:49:42,574 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 295 transitions. [2025-03-04 07:49:42,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 07:49:42,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:49:42,574 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:49:42,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 07:49:42,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 07:49:42,775 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-04 07:49:42,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:49:42,775 INFO L85 PathProgramCache]: Analyzing trace with hash 563060298, now seen corresponding path program 2 times [2025-03-04 07:49:42,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:49:42,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169831800] [2025-03-04 07:49:42,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:49:42,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:49:42,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-04 07:49:42,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 07:49:42,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:49:42,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:43,420 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:49:43,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:49:43,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169831800] [2025-03-04 07:49:43,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169831800] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:49:43,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462739329] [2025-03-04 07:49:43,421 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:49:43,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:49:43,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:49:43,423 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:49:43,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 07:49:43,492 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-04 07:49:43,518 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 07:49:43,518 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:49:43,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:49:43,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-04 07:49:43,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:49:43,528 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:43,532 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:43,678 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))) (= (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:43,865 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:44,633 INFO L349 Elim1Store]: treesize reduction 270, result has 13.2 percent of original size [2025-03-04 07:49:44,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 146 treesize of output 320 [2025-03-04 07:49:45,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:49:45,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 117 treesize of output 457