./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/LexIndexValue-Pointer-2.c --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/termination-crafted/LexIndexValue-Pointer-2.c -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 1bedc761cea545b8144ad4138a379d7139cc98703c76e9b536a2e7389d5b6a10 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 08:03:27,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 08:03:27,632 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-04 08:03:27,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 08:03:27,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 08:03:27,661 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 08:03:27,662 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 08:03:27,662 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 08:03:27,662 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 08:03:27,662 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 08:03:27,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 08:03:27,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 08:03:27,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 08:03:27,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 08:03:27,663 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 08:03:27,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 08:03:27,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 08:03:27,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 08:03:27,664 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 08:03:27,664 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 08:03:27,664 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 08:03:27,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 08:03:27,664 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 08:03:27,664 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 08:03:27,664 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 08:03:27,664 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 08:03:27,664 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 08:03:27,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 08:03:27,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 08:03:27,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 08:03:27,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 08:03:27,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 08:03:27,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 08:03:27,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 08:03:27,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 08:03:27,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 08:03:27,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 08:03:27,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 08:03:27,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 08:03:27,665 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 -> 1bedc761cea545b8144ad4138a379d7139cc98703c76e9b536a2e7389d5b6a10 [2025-03-04 08:03:27,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 08:03:27,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 08:03:27,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 08:03:27,920 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 08:03:27,920 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 08:03:27,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/LexIndexValue-Pointer-2.c [2025-03-04 08:03:29,116 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e28dc7ee8/568bbda720334b31a26150b40af88098/FLAG4c96ac391 [2025-03-04 08:03:29,333 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 08:03:29,334 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/LexIndexValue-Pointer-2.c [2025-03-04 08:03:29,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e28dc7ee8/568bbda720334b31a26150b40af88098/FLAG4c96ac391 [2025-03-04 08:03:29,667 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e28dc7ee8/568bbda720334b31a26150b40af88098 [2025-03-04 08:03:29,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 08:03:29,670 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 08:03:29,671 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 08:03:29,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 08:03:29,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 08:03:29,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 08:03:29" (1/1) ... [2025-03-04 08:03:29,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@362ee57a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:29, skipping insertion in model container [2025-03-04 08:03:29,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 08:03:29" (1/1) ... [2025-03-04 08:03:29,685 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 08:03:29,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 08:03:29,778 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 08:03:29,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 08:03:29,795 INFO L204 MainTranslator]: Completed translation [2025-03-04 08:03:29,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:29 WrapperNode [2025-03-04 08:03:29,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 08:03:29,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 08:03:29,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 08:03:29,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 08:03:29,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:29" (1/1) ... [2025-03-04 08:03:29,805 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:29" (1/1) ... [2025-03-04 08:03:29,814 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2025-03-04 08:03:29,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 08:03:29,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 08:03:29,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 08:03:29,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 08:03:29,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:29" (1/1) ... [2025-03-04 08:03:29,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:29" (1/1) ... [2025-03-04 08:03:29,822 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:29" (1/1) ... [2025-03-04 08:03:29,828 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-03-04 08:03:29,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:29" (1/1) ... [2025-03-04 08:03:29,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:29" (1/1) ... [2025-03-04 08:03:29,833 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:29" (1/1) ... [2025-03-04 08:03:29,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:29" (1/1) ... [2025-03-04 08:03:29,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:29" (1/1) ... [2025-03-04 08:03:29,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:29" (1/1) ... [2025-03-04 08:03:29,835 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 08:03:29,836 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 08:03:29,836 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 08:03:29,836 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 08:03:29,837 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:29" (1/1) ... [2025-03-04 08:03:29,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 08:03:29,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:03:29,859 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 08:03:29,861 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 08:03:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 08:03:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 08:03:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 08:03:29,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 08:03:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 08:03:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 08:03:29,924 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 08:03:29,925 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 08:03:30,094 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-04 08:03:30,098 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 08:03:30,104 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 08:03:30,105 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 08:03:30,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 08:03:30 BoogieIcfgContainer [2025-03-04 08:03:30,105 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 08:03:30,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 08:03:30,108 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 08:03:30,111 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 08:03:30,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 08:03:29" (1/3) ... [2025-03-04 08:03:30,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6296c3d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 08:03:30, skipping insertion in model container [2025-03-04 08:03:30,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:03:29" (2/3) ... [2025-03-04 08:03:30,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6296c3d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 08:03:30, skipping insertion in model container [2025-03-04 08:03:30,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 08:03:30" (3/3) ... [2025-03-04 08:03:30,114 INFO L128 eAbstractionObserver]: Analyzing ICFG LexIndexValue-Pointer-2.c [2025-03-04 08:03:30,126 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 08:03:30,127 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG LexIndexValue-Pointer-2.c that has 1 procedures, 33 locations, 1 initial locations, 2 loop locations, and 12 error locations. [2025-03-04 08:03:30,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 08:03:30,174 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;@89dc514, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 08:03:30,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-04 08:03:30,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 20 states have (on average 1.85) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:30,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 08:03:30,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:30,182 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 08:03:30,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-04 08:03:30,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:30,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2092286, now seen corresponding path program 1 times [2025-03-04 08:03:30,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:30,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826197318] [2025-03-04 08:03:30,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:30,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:30,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 08:03:30,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 08:03:30,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:30,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:30,338 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 08:03:30,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:30,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826197318] [2025-03-04 08:03:30,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826197318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:03:30,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:03:30,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 08:03:30,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899994821] [2025-03-04 08:03:30,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:03:30,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:03:30,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:30,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:03:30,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:03:30,367 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.85) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:30,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:30,444 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-03-04 08:03:30,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:03:30,446 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 08:03:30,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:30,450 INFO L225 Difference]: With dead ends: 43 [2025-03-04 08:03:30,450 INFO L226 Difference]: Without dead ends: 41 [2025-03-04 08:03:30,452 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 08:03:30,455 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:30,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 49 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:03:30,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-04 08:03:30,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2025-03-04 08:03:30,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.72) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:30,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2025-03-04 08:03:30,480 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 4 [2025-03-04 08:03:30,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:30,481 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2025-03-04 08:03:30,481 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:30,481 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2025-03-04 08:03:30,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 08:03:30,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:30,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 08:03:30,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 08:03:30,482 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-04 08:03:30,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:30,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2092287, now seen corresponding path program 1 times [2025-03-04 08:03:30,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:30,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319532729] [2025-03-04 08:03:30,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:30,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:30,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 08:03:30,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 08:03:30,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:30,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:30,600 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 08:03:30,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:30,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319532729] [2025-03-04 08:03:30,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319532729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:03:30,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:03:30,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 08:03:30,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307505440] [2025-03-04 08:03:30,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:03:30,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:03:30,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:30,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:03:30,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:03:30,602 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:30,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:30,631 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2025-03-04 08:03:30,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:03:30,632 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 08:03:30,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:30,633 INFO L225 Difference]: With dead ends: 38 [2025-03-04 08:03:30,633 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 08:03:30,633 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 08:03:30,634 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:30,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 45 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:03:30,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 08:03:30,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2025-03-04 08:03:30,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:30,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2025-03-04 08:03:30,640 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 4 [2025-03-04 08:03:30,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:30,641 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2025-03-04 08:03:30,641 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:30,641 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2025-03-04 08:03:30,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 08:03:30,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:30,641 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 08:03:30,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 08:03:30,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-04 08:03:30,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:30,642 INFO L85 PathProgramCache]: Analyzing trace with hash -2093215102, now seen corresponding path program 1 times [2025-03-04 08:03:30,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:30,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112661008] [2025-03-04 08:03:30,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:30,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:30,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 08:03:30,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 08:03:30,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:30,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:30,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:30,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112661008] [2025-03-04 08:03:30,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112661008] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:03:30,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283087953] [2025-03-04 08:03:30,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:30,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:03:30,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:03:30,811 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 08:03:30,812 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 08:03:30,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 08:03:30,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 08:03:30,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:30,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:30,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 08:03:30,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:03:30,898 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 08:03:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:30,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:03:31,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:31,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283087953] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:03:31,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:03:31,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-03-04 08:03:31,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855875334] [2025-03-04 08:03:31,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:03:31,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 08:03:31,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:31,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 08:03:31,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 08:03:31,051 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:31,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:31,156 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2025-03-04 08:03:31,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 08:03:31,156 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 08:03:31,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:31,158 INFO L225 Difference]: With dead ends: 44 [2025-03-04 08:03:31,158 INFO L226 Difference]: Without dead ends: 44 [2025-03-04 08:03:31,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-04 08:03:31,160 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:31,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 107 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:03:31,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-04 08:03:31,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-04 08:03:31,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:31,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2025-03-04 08:03:31,165 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 7 [2025-03-04 08:03:31,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:31,166 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2025-03-04 08:03:31,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:31,166 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2025-03-04 08:03:31,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 08:03:31,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:31,167 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 08:03:31,173 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 08:03:31,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:03:31,371 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-04 08:03:31,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:31,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1880834684, now seen corresponding path program 1 times [2025-03-04 08:03:31,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:31,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489241521] [2025-03-04 08:03:31,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:31,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:31,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 08:03:31,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 08:03:31,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:31,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:31,473 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 08:03:31,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:31,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489241521] [2025-03-04 08:03:31,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489241521] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:03:31,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27605623] [2025-03-04 08:03:31,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:31,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:03:31,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:03:31,476 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 08:03:31,477 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 08:03:31,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 08:03:31,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 08:03:31,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:31,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:31,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 08:03:31,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:03:31,582 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:31,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:03:31,648 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:31,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27605623] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:03:31,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:03:31,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 16 [2025-03-04 08:03:31,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553525477] [2025-03-04 08:03:31,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:03:31,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 08:03:31,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:31,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 08:03:31,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2025-03-04 08:03:31,649 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:31,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:31,823 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2025-03-04 08:03:31,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 08:03:31,824 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 08:03:31,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:31,825 INFO L225 Difference]: With dead ends: 59 [2025-03-04 08:03:31,825 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 08:03:31,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=237, Invalid=413, Unknown=0, NotChecked=0, Total=650 [2025-03-04 08:03:31,826 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 68 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:31,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 27 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:03:31,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 08:03:31,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2025-03-04 08:03:31,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 52 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:31,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2025-03-04 08:03:31,830 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 18 [2025-03-04 08:03:31,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:31,830 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2025-03-04 08:03:31,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:31,830 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2025-03-04 08:03:31,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 08:03:31,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:31,831 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 08:03:31,837 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 08:03:32,032 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,SelfDestructingSolverStorable3 [2025-03-04 08:03:32,032 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-04 08:03:32,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:32,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1294460451, now seen corresponding path program 1 times [2025-03-04 08:03:32,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:32,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614655679] [2025-03-04 08:03:32,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:32,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:32,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 08:03:32,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 08:03:32,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:32,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:32,242 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:32,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:32,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614655679] [2025-03-04 08:03:32,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614655679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:03:32,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511177821] [2025-03-04 08:03:32,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:32,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:03:32,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:03:32,245 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 08:03:32,246 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 08:03:32,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 08:03:32,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 08:03:32,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:32,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:32,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 08:03:32,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:03:32,351 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:32,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:03:32,564 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:32,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511177821] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:03:32,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:03:32,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-04 08:03:32,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78425751] [2025-03-04 08:03:32,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:03:32,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 08:03:32,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:32,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 08:03:32,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-04 08:03:32,569 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 25 states, 25 states have (on average 2.88) internal successors, (72), 25 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:32,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:32,665 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2025-03-04 08:03:32,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 08:03:32,666 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.88) internal successors, (72), 25 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-04 08:03:32,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:32,666 INFO L225 Difference]: With dead ends: 89 [2025-03-04 08:03:32,666 INFO L226 Difference]: Without dead ends: 89 [2025-03-04 08:03:32,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-04 08:03:32,667 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:32,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 117 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:03:32,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-04 08:03:32,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-04 08:03:32,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 83 states have (on average 1.108433734939759) internal successors, (92), 88 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:32,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2025-03-04 08:03:32,674 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 36 [2025-03-04 08:03:32,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:32,674 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2025-03-04 08:03:32,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.88) internal successors, (72), 25 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:32,675 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2025-03-04 08:03:32,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 08:03:32,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:32,676 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1] [2025-03-04 08:03:32,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 08:03:32,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:03:32,878 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-04 08:03:32,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:32,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1558085789, now seen corresponding path program 2 times [2025-03-04 08:03:32,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:32,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294121063] [2025-03-04 08:03:32,879 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:03:32,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:32,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-03-04 08:03:32,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 72 statements. [2025-03-04 08:03:32,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 08:03:32,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:32,937 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-03-04 08:03:32,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:32,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294121063] [2025-03-04 08:03:32,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294121063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:03:32,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:03:32,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:03:32,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949242582] [2025-03-04 08:03:32,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:03:32,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 08:03:32,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:32,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 08:03:32,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 08:03:32,939 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:32,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:32,982 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2025-03-04 08:03:32,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 08:03:32,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-04 08:03:32,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:32,984 INFO L225 Difference]: With dead ends: 104 [2025-03-04 08:03:32,984 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 08:03:32,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 08:03:32,985 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 48 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:32,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 31 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:03:32,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 08:03:32,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2025-03-04 08:03:32,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 93 states have (on average 1.118279569892473) internal successors, (104), 97 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:32,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2025-03-04 08:03:32,991 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 72 [2025-03-04 08:03:32,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:32,992 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2025-03-04 08:03:32,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:32,992 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2025-03-04 08:03:32,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 08:03:32,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:32,994 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:03:32,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 08:03:32,994 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-04 08:03:32,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:32,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1623117866, now seen corresponding path program 1 times [2025-03-04 08:03:32,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:32,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296733048] [2025-03-04 08:03:32,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:32,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:33,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 08:03:33,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 08:03:33,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:33,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:33,092 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-03-04 08:03:33,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:33,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296733048] [2025-03-04 08:03:33,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296733048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:03:33,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:03:33,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 08:03:33,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502179412] [2025-03-04 08:03:33,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:03:33,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:03:33,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:33,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:03:33,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:03:33,093 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:33,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:33,099 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2025-03-04 08:03:33,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:03:33,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-04 08:03:33,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:33,100 INFO L225 Difference]: With dead ends: 97 [2025-03-04 08:03:33,100 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 08:03:33,100 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 08:03:33,101 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:33,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 23 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:03:33,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 08:03:33,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-04 08:03:33,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 93 states have (on average 1.10752688172043) internal successors, (103), 96 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:33,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2025-03-04 08:03:33,109 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 74 [2025-03-04 08:03:33,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:33,109 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2025-03-04 08:03:33,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:33,110 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2025-03-04 08:03:33,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 08:03:33,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:33,110 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:03:33,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 08:03:33,112 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-04 08:03:33,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:33,113 INFO L85 PathProgramCache]: Analyzing trace with hash -743141645, now seen corresponding path program 1 times [2025-03-04 08:03:33,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:33,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997605252] [2025-03-04 08:03:33,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:33,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:33,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 08:03:33,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 08:03:33,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:33,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:33,344 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-03-04 08:03:33,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:33,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997605252] [2025-03-04 08:03:33,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997605252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:03:33,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:03:33,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 08:03:33,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410949808] [2025-03-04 08:03:33,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:03:33,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 08:03:33,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:33,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 08:03:33,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 08:03:33,346 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:33,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:33,384 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2025-03-04 08:03:33,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 08:03:33,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-04 08:03:33,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:33,384 INFO L225 Difference]: With dead ends: 98 [2025-03-04 08:03:33,384 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 08:03:33,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 08:03:33,385 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:33,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 43 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:03:33,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 08:03:33,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-03-04 08:03:33,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 93 states have (on average 1.096774193548387) internal successors, (102), 96 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:33,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2025-03-04 08:03:33,391 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 76 [2025-03-04 08:03:33,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:33,391 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2025-03-04 08:03:33,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:33,391 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2025-03-04 08:03:33,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 08:03:33,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:33,391 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:03:33,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 08:03:33,392 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-04 08:03:33,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:33,392 INFO L85 PathProgramCache]: Analyzing trace with hash 198116853, now seen corresponding path program 1 times [2025-03-04 08:03:33,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:33,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707506378] [2025-03-04 08:03:33,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:33,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:33,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 08:03:33,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 08:03:33,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:33,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:33,950 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:33,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:33,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707506378] [2025-03-04 08:03:33,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707506378] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:03:33,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077579704] [2025-03-04 08:03:33,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:33,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:03:33,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:03:33,953 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 08:03:33,955 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 08:03:34,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 08:03:34,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 08:03:34,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:34,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:34,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 08:03:34,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:03:34,169 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:34,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:03:34,859 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:03:34,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077579704] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:03:34,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:03:34,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2025-03-04 08:03:34,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506670032] [2025-03-04 08:03:34,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:03:34,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-04 08:03:34,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:34,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-04 08:03:34,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 08:03:34,862 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 49 states, 49 states have (on average 3.061224489795918) internal successors, (150), 49 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:35,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:35,028 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2025-03-04 08:03:35,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 08:03:35,029 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.061224489795918) internal successors, (150), 49 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-04 08:03:35,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:35,029 INFO L225 Difference]: With dead ends: 169 [2025-03-04 08:03:35,029 INFO L226 Difference]: Without dead ends: 169 [2025-03-04 08:03:35,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 08:03:35,031 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:35,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 65 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:03:35,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-04 08:03:35,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-03-04 08:03:35,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 165 states have (on average 1.0545454545454545) internal successors, (174), 168 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:35,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 174 transitions. [2025-03-04 08:03:35,036 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 174 transitions. Word has length 78 [2025-03-04 08:03:35,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:35,036 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 174 transitions. [2025-03-04 08:03:35,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.061224489795918) internal successors, (150), 49 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:35,036 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 174 transitions. [2025-03-04 08:03:35,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 08:03:35,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:35,037 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:03:35,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 08:03:35,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:03:35,238 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-04 08:03:35,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:35,239 INFO L85 PathProgramCache]: Analyzing trace with hash -237071499, now seen corresponding path program 2 times [2025-03-04 08:03:35,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:35,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029880119] [2025-03-04 08:03:35,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:03:35,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:35,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 150 statements into 2 equivalence classes. [2025-03-04 08:03:35,277 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 150 statements. [2025-03-04 08:03:35,277 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 08:03:35,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:35,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3151 trivial. 0 not checked. [2025-03-04 08:03:35,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:35,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029880119] [2025-03-04 08:03:35,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029880119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:03:35,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:03:35,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:03:35,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41247383] [2025-03-04 08:03:35,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:03:35,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 08:03:35,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:35,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 08:03:35,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 08:03:35,319 INFO L87 Difference]: Start difference. First operand 169 states and 174 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:35,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:35,335 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2025-03-04 08:03:35,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 08:03:35,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2025-03-04 08:03:35,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:35,337 INFO L225 Difference]: With dead ends: 168 [2025-03-04 08:03:35,337 INFO L226 Difference]: Without dead ends: 164 [2025-03-04 08:03:35,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 08:03:35,337 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:35,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 32 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:03:35,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-04 08:03:35,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-03-04 08:03:35,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 161 states have (on average 1.0434782608695652) internal successors, (168), 163 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:35,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 168 transitions. [2025-03-04 08:03:35,342 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 168 transitions. Word has length 150 [2025-03-04 08:03:35,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:35,343 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 168 transitions. [2025-03-04 08:03:35,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:35,343 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2025-03-04 08:03:35,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 08:03:35,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:35,344 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:03:35,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 08:03:35,344 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-04 08:03:35,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:35,345 INFO L85 PathProgramCache]: Analyzing trace with hash -236064563, now seen corresponding path program 1 times [2025-03-04 08:03:35,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:35,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179512981] [2025-03-04 08:03:35,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:35,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:35,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 08:03:35,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 08:03:35,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:35,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3154 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 08:03:37,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:37,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179512981] [2025-03-04 08:03:37,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179512981] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:03:37,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040169557] [2025-03-04 08:03:37,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:37,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:03:37,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:03:37,097 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 08:03:37,099 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 08:03:37,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 08:03:37,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 08:03:37,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:37,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:37,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 08:03:37,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:03:37,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3154 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 08:03:37,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:03:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3154 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 08:03:39,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040169557] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:03:39,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:03:39,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2025-03-04 08:03:39,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416014930] [2025-03-04 08:03:39,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:03:39,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2025-03-04 08:03:39,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:39,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2025-03-04 08:03:39,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2025-03-04 08:03:39,562 INFO L87 Difference]: Start difference. First operand 164 states and 168 transitions. Second operand has 97 states, 97 states have (on average 3.0103092783505154) internal successors, (292), 97 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:39,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:39,859 INFO L93 Difference]: Finished difference Result 308 states and 312 transitions. [2025-03-04 08:03:39,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-04 08:03:39,860 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 3.0103092783505154) internal successors, (292), 97 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2025-03-04 08:03:39,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:39,861 INFO L225 Difference]: With dead ends: 308 [2025-03-04 08:03:39,861 INFO L226 Difference]: Without dead ends: 308 [2025-03-04 08:03:39,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2025-03-04 08:03:39,863 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:39,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 146 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 08:03:39,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-04 08:03:39,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2025-03-04 08:03:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 305 states have (on average 1.022950819672131) internal successors, (312), 307 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:39,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 312 transitions. [2025-03-04 08:03:39,876 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 312 transitions. Word has length 150 [2025-03-04 08:03:39,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:39,876 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 312 transitions. [2025-03-04 08:03:39,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 3.0103092783505154) internal successors, (292), 97 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:39,877 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 312 transitions. [2025-03-04 08:03:39,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-04 08:03:39,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:39,879 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:03:39,886 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 08:03:40,080 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,SelfDestructingSolverStorable10 [2025-03-04 08:03:40,080 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-04 08:03:40,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:40,081 INFO L85 PathProgramCache]: Analyzing trace with hash 186158029, now seen corresponding path program 2 times [2025-03-04 08:03:40,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:40,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931426679] [2025-03-04 08:03:40,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:03:40,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:40,109 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 294 statements into 2 equivalence classes. [2025-03-04 08:03:40,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 294 of 294 statements. [2025-03-04 08:03:40,171 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 08:03:40,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:44,729 INFO L134 CoverageAnalysis]: Checked inductivity of 13210 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 08:03:44,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:44,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931426679] [2025-03-04 08:03:44,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931426679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:03:44,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379157454] [2025-03-04 08:03:44,730 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:03:44,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:03:44,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:03:44,732 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 08:03:44,734 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 08:03:44,842 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 294 statements into 2 equivalence classes. [2025-03-04 08:03:44,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 294 of 294 statements. [2025-03-04 08:03:44,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 08:03:44,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:44,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-04 08:03:44,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:03:45,301 INFO L134 CoverageAnalysis]: Checked inductivity of 13210 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 08:03:45,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:03:52,422 INFO L134 CoverageAnalysis]: Checked inductivity of 13210 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 08:03:52,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379157454] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:03:52,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:03:52,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2025-03-04 08:03:52,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671469396] [2025-03-04 08:03:52,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:03:52,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 193 states [2025-03-04 08:03:52,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:52,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2025-03-04 08:03:52,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2025-03-04 08:03:52,434 INFO L87 Difference]: Start difference. First operand 308 states and 312 transitions. Second operand has 193 states, 193 states have (on average 3.005181347150259) internal successors, (580), 193 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:53,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:53,439 INFO L93 Difference]: Finished difference Result 596 states and 600 transitions. [2025-03-04 08:03:53,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-03-04 08:03:53,441 INFO L78 Accepts]: Start accepts. Automaton has has 193 states, 193 states have (on average 3.005181347150259) internal successors, (580), 193 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 294 [2025-03-04 08:03:53,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:53,443 INFO L225 Difference]: With dead ends: 596 [2025-03-04 08:03:53,443 INFO L226 Difference]: Without dead ends: 596 [2025-03-04 08:03:53,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2025-03-04 08:03:53,445 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:53,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 114 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 08:03:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-04 08:03:53,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-03-04 08:03:53,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 593 states have (on average 1.0118043844856661) internal successors, (600), 595 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:53,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 600 transitions. [2025-03-04 08:03:53,455 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 600 transitions. Word has length 294 [2025-03-04 08:03:53,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:53,455 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 600 transitions. [2025-03-04 08:03:53,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 193 states, 193 states have (on average 3.005181347150259) internal successors, (580), 193 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:53,456 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 600 transitions. [2025-03-04 08:03:53,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2025-03-04 08:03:53,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:53,461 INFO L218 NwaCegarLoop]: trace histogram [190, 190, 190, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:03:53,470 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 08:03:53,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:03:53,663 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-04 08:03:53,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:53,664 INFO L85 PathProgramCache]: Analyzing trace with hash -878984755, now seen corresponding path program 3 times [2025-03-04 08:03:53,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:53,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420219981] [2025-03-04 08:03:53,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 08:03:53,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:53,714 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 582 statements into 191 equivalence classes. [2025-03-04 08:03:53,717 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 582 statements. [2025-03-04 08:03:53,717 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 08:03:53,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:53,802 INFO L134 CoverageAnalysis]: Checked inductivity of 54058 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 54055 trivial. 0 not checked. [2025-03-04 08:03:53,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:53,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420219981] [2025-03-04 08:03:53,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420219981] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:03:53,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342732713] [2025-03-04 08:03:53,805 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 08:03:53,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:03:53,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:03:53,807 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 08:03:53,809 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 08:03:53,982 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 582 statements into 191 equivalence classes. [2025-03-04 08:03:53,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 582 statements. [2025-03-04 08:03:53,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 08:03:53,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:53,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 08:03:53,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:03:54,004 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 08:03:55,248 INFO L134 CoverageAnalysis]: Checked inductivity of 54058 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 54055 trivial. 0 not checked. [2025-03-04 08:03:55,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:03:56,773 INFO L134 CoverageAnalysis]: Checked inductivity of 54058 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 54055 trivial. 0 not checked. [2025-03-04 08:03:56,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342732713] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:03:56,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:03:56,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2025-03-04 08:03:56,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541235771] [2025-03-04 08:03:56,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:03:56,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 08:03:56,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:56,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 08:03:56,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-03-04 08:03:56,775 INFO L87 Difference]: Start difference. First operand 596 states and 600 transitions. Second operand has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:57,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:57,019 INFO L93 Difference]: Finished difference Result 635 states and 648 transitions. [2025-03-04 08:03:57,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 08:03:57,020 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 582 [2025-03-04 08:03:57,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:57,022 INFO L225 Difference]: With dead ends: 635 [2025-03-04 08:03:57,022 INFO L226 Difference]: Without dead ends: 635 [2025-03-04 08:03:57,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1178 GetRequests, 1151 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2025-03-04 08:03:57,023 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 215 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:57,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 101 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:03:57,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-03-04 08:03:57,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 617. [2025-03-04 08:03:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 1.0162337662337662) internal successors, (626), 616 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 626 transitions. [2025-03-04 08:03:57,035 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 626 transitions. Word has length 582 [2025-03-04 08:03:57,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:57,035 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 626 transitions. [2025-03-04 08:03:57,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:57,036 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 626 transitions. [2025-03-04 08:03:57,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-03-04 08:03:57,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:57,042 INFO L218 NwaCegarLoop]: trace histogram [190, 190, 190, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 08:03:57,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 08:03:57,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:03:57,243 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-04 08:03:57,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:57,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1731024937, now seen corresponding path program 1 times [2025-03-04 08:03:57,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:57,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666247491] [2025-03-04 08:03:57,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:03:57,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:57,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-03-04 08:03:57,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-03-04 08:03:57,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:03:57,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:03:57,495 INFO L134 CoverageAnalysis]: Checked inductivity of 54088 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 54067 trivial. 0 not checked. [2025-03-04 08:03:57,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:03:57,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666247491] [2025-03-04 08:03:57,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666247491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:03:57,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:03:57,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:03:57,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242559192] [2025-03-04 08:03:57,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:03:57,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:03:57,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:03:57,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:03:57,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:03:57,497 INFO L87 Difference]: Start difference. First operand 617 states and 626 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:57,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:03:57,502 INFO L93 Difference]: Finished difference Result 620 states and 626 transitions. [2025-03-04 08:03:57,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:03:57,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 594 [2025-03-04 08:03:57,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:03:57,505 INFO L225 Difference]: With dead ends: 620 [2025-03-04 08:03:57,505 INFO L226 Difference]: Without dead ends: 617 [2025-03-04 08:03:57,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 08:03:57,505 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:03:57,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:03:57,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-03-04 08:03:57,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2025-03-04 08:03:57,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 1.0097402597402598) internal successors, (622), 616 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:57,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 622 transitions. [2025-03-04 08:03:57,513 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 622 transitions. Word has length 594 [2025-03-04 08:03:57,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:03:57,513 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 622 transitions. [2025-03-04 08:03:57,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:03:57,514 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 622 transitions. [2025-03-04 08:03:57,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2025-03-04 08:03:57,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:03:57,516 INFO L218 NwaCegarLoop]: trace histogram [190, 190, 190, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1] [2025-03-04 08:03:57,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 08:03:57,516 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 9 more)] === [2025-03-04 08:03:57,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:03:57,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1731710499, now seen corresponding path program 4 times [2025-03-04 08:03:57,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:03:57,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812362573] [2025-03-04 08:03:57,517 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 08:03:57,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:03:57,570 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 600 statements into 2 equivalence classes. [2025-03-04 08:03:57,881 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 600 of 600 statements. [2025-03-04 08:03:57,882 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 08:03:57,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:04:19,634 INFO L134 CoverageAnalysis]: Checked inductivity of 54103 backedges. 0 proven. 54097 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 08:04:19,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:04:19,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812362573] [2025-03-04 08:04:19,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812362573] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:04:19,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125022218] [2025-03-04 08:04:19,635 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 08:04:19,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:04:19,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:04:19,638 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 08:04:19,639 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 08:04:19,843 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 600 statements into 2 equivalence classes.